./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff8bee30ebc0a54ebfcfd9d99cb415407b7814d567c1f87cff440d6e8ced68ab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:21:11,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:21:11,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:21:11,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:21:11,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:21:11,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:21:11,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:21:11,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:21:11,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:21:11,126 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:21:11,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:21:11,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:21:11,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:21:11,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:21:11,128 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:21:11,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:21:11,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:21:11,128 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:21:11,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:21:11,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:21:11,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:21:11,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:21:11,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:21:11,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:21:11,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:21:11,132 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:21:11,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:21:11,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:21:11,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:21:11,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:21:11,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:21:11,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:21:11,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:21:11,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:21:11,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:21:11,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:21:11,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:21:11,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:21:11,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:21:11,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:21:11,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:21:11,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:21:11,138 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff8bee30ebc0a54ebfcfd9d99cb415407b7814d567c1f87cff440d6e8ced68ab [2024-10-11 10:21:11,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:21:11,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:21:11,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:21:11,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:21:11,424 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:21:11,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-10-11 10:21:12,903 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:21:13,125 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:21:13,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-10-11 10:21:13,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0d011df41/46b50cbcf85642d0b881b71c8e8e6c28/FLAG2977eb740 [2024-10-11 10:21:13,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0d011df41/46b50cbcf85642d0b881b71c8e8e6c28 [2024-10-11 10:21:13,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:21:13,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:21:13,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:21:13,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:21:13,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:21:13,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:21:13" (1/1) ... [2024-10-11 10:21:13,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@93d69d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:13, skipping insertion in model container [2024-10-11 10:21:13,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:21:13" (1/1) ... [2024-10-11 10:21:13,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:21:13,389 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i[919,932] [2024-10-11 10:21:13,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:21:13,502 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:21:13,517 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i[919,932] [2024-10-11 10:21:13,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:21:13,570 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:21:13,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:13 WrapperNode [2024-10-11 10:21:13,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:21:13,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:21:13,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:21:13,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:21:13,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:13" (1/1) ... [2024-10-11 10:21:13,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:13" (1/1) ... [2024-10-11 10:21:13,652 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-10-11 10:21:13,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:21:13,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:21:13,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:21:13,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:21:13,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:13" (1/1) ... [2024-10-11 10:21:13,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:13" (1/1) ... [2024-10-11 10:21:13,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:13" (1/1) ... [2024-10-11 10:21:13,697 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:21:13,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:13" (1/1) ... [2024-10-11 10:21:13,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:13" (1/1) ... [2024-10-11 10:21:13,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:13" (1/1) ... [2024-10-11 10:21:13,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:13" (1/1) ... [2024-10-11 10:21:13,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:13" (1/1) ... [2024-10-11 10:21:13,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:13" (1/1) ... [2024-10-11 10:21:13,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:21:13,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:21:13,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:21:13,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:21:13,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:13" (1/1) ... [2024-10-11 10:21:13,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:21:13,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:21:13,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:21:13,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:21:13,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:21:13,876 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:21:13,877 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:21:13,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:21:13,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:21:13,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:21:13,969 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:21:13,971 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:21:14,408 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 10:21:14,408 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:21:14,444 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:21:14,445 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:21:14,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:21:14 BoogieIcfgContainer [2024-10-11 10:21:14,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:21:14,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:21:14,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:21:14,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:21:14,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:21:13" (1/3) ... [2024-10-11 10:21:14,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27259f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:21:14, skipping insertion in model container [2024-10-11 10:21:14,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:13" (2/3) ... [2024-10-11 10:21:14,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27259f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:21:14, skipping insertion in model container [2024-10-11 10:21:14,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:21:14" (3/3) ... [2024-10-11 10:21:14,455 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-10-11 10:21:14,472 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:21:14,473 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:21:14,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:21:14,541 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3fb2435, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:21:14,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:21:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 62 states have internal predecessors, (96), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 10:21:14,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 10:21:14,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:21:14,558 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:14,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:21:14,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:21:14,564 INFO L85 PathProgramCache]: Analyzing trace with hash -938193090, now seen corresponding path program 1 times [2024-10-11 10:21:14,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:21:14,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848210505] [2024-10-11 10:21:14,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:14,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:21:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:21:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:21:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:21:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:21:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:21:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:21:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 10:21:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:21:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:21:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:21:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 10:21:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:21:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:21:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 10:21:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:21:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:21:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:21:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:21:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:21:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:21:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:21:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:21:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 10:21:15,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:21:15,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848210505] [2024-10-11 10:21:15,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848210505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:21:15,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:21:15,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:21:15,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548272086] [2024-10-11 10:21:15,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:21:15,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:21:15,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:21:15,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:21:15,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:15,254 INFO L87 Difference]: Start difference. First operand has 86 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 62 states have internal predecessors, (96), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:21:15,411 INFO L93 Difference]: Finished difference Result 250 states and 456 transitions. [2024-10-11 10:21:15,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:21:15,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-10-11 10:21:15,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:21:15,427 INFO L225 Difference]: With dead ends: 250 [2024-10-11 10:21:15,428 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 10:21:15,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:15,437 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 120 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:21:15,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 314 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:21:15,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 10:21:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 146. [2024-10-11 10:21:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 99 states have internal predecessors, (141), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 10:21:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 229 transitions. [2024-10-11 10:21:15,537 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 229 transitions. Word has length 148 [2024-10-11 10:21:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:21:15,539 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 229 transitions. [2024-10-11 10:21:15,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 229 transitions. [2024-10-11 10:21:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 10:21:15,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:21:15,547 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:15,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:21:15,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:21:15,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:21:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1551335872, now seen corresponding path program 1 times [2024-10-11 10:21:15,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:21:15,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830209684] [2024-10-11 10:21:15,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:15,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:21:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:21:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:21:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:21:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:21:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:21:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:21:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 10:21:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:21:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:21:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:21:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 10:21:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:21:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:21:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 10:21:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:21:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:21:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:21:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:21:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:21:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:21:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:21:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:21:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 10:21:15,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:21:15,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830209684] [2024-10-11 10:21:15,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830209684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:21:15,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:21:15,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:21:15,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969988831] [2024-10-11 10:21:15,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:21:15,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:21:15,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:21:15,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:21:15,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:15,867 INFO L87 Difference]: Start difference. First operand 146 states and 229 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:21:15,989 INFO L93 Difference]: Finished difference Result 363 states and 570 transitions. [2024-10-11 10:21:15,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:21:15,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-10-11 10:21:15,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:21:15,996 INFO L225 Difference]: With dead ends: 363 [2024-10-11 10:21:15,996 INFO L226 Difference]: Without dead ends: 218 [2024-10-11 10:21:15,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:16,002 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 121 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:21:16,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 255 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:21:16,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-11 10:21:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 199. [2024-10-11 10:21:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 129 states have (on average 1.3565891472868217) internal successors, (175), 129 states have internal predecessors, (175), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-11 10:21:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 307 transitions. [2024-10-11 10:21:16,058 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 307 transitions. Word has length 148 [2024-10-11 10:21:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:21:16,059 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 307 transitions. [2024-10-11 10:21:16,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 307 transitions. [2024-10-11 10:21:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 10:21:16,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:21:16,064 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:16,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:21:16,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:21:16,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:21:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash 733687422, now seen corresponding path program 1 times [2024-10-11 10:21:16,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:21:16,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37025287] [2024-10-11 10:21:16,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:16,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:21:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:21:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:21:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:21:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:21:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:21:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:21:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 10:21:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:21:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:21:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:21:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 10:21:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:21:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:21:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 10:21:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:21:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:21:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:21:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:21:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:21:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:21:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:21:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:21:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 10:21:16,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:21:16,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37025287] [2024-10-11 10:21:16,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37025287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:21:16,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:21:16,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:21:16,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817576910] [2024-10-11 10:21:16,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:21:16,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:21:16,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:21:16,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:21:16,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:16,396 INFO L87 Difference]: Start difference. First operand 199 states and 307 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:21:16,500 INFO L93 Difference]: Finished difference Result 591 states and 914 transitions. [2024-10-11 10:21:16,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:21:16,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-10-11 10:21:16,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:21:16,510 INFO L225 Difference]: With dead ends: 591 [2024-10-11 10:21:16,510 INFO L226 Difference]: Without dead ends: 393 [2024-10-11 10:21:16,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:16,513 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 87 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:21:16,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 270 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:21:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-11 10:21:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 390. [2024-10-11 10:21:16,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 251 states have (on average 1.3346613545816732) internal successors, (335), 251 states have internal predecessors, (335), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-10-11 10:21:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 599 transitions. [2024-10-11 10:21:16,601 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 599 transitions. Word has length 148 [2024-10-11 10:21:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:21:16,601 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 599 transitions. [2024-10-11 10:21:16,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 599 transitions. [2024-10-11 10:21:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 10:21:16,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:21:16,604 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:16,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:21:16,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:21:16,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:21:16,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1163299100, now seen corresponding path program 1 times [2024-10-11 10:21:16,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:21:16,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305015037] [2024-10-11 10:21:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:16,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:21:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:21:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:21:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:21:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:21:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:21:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:21:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 10:21:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:21:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:21:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:21:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 10:21:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:21:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:21:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 10:21:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:21:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:21:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:21:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:21:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:21:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:21:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:21:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:21:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 10:21:16,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:21:16,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305015037] [2024-10-11 10:21:16,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305015037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:21:16,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:21:16,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:21:16,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560463121] [2024-10-11 10:21:16,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:21:16,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:21:16,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:21:16,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:21:16,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:21:16,878 INFO L87 Difference]: Start difference. First operand 390 states and 599 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:21:17,067 INFO L93 Difference]: Finished difference Result 784 states and 1204 transitions. [2024-10-11 10:21:17,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:21:17,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2024-10-11 10:21:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:21:17,074 INFO L225 Difference]: With dead ends: 784 [2024-10-11 10:21:17,074 INFO L226 Difference]: Without dead ends: 395 [2024-10-11 10:21:17,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:21:17,078 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 88 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:21:17,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 494 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:21:17,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-11 10:21:17,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 392. [2024-10-11 10:21:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 253 states have (on average 1.33201581027668) internal successors, (337), 253 states have internal predecessors, (337), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-10-11 10:21:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 601 transitions. [2024-10-11 10:21:17,128 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 601 transitions. Word has length 150 [2024-10-11 10:21:17,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:21:17,129 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 601 transitions. [2024-10-11 10:21:17,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 601 transitions. [2024-10-11 10:21:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 10:21:17,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:21:17,133 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:17,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:21:17,133 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:21:17,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:21:17,133 INFO L85 PathProgramCache]: Analyzing trace with hash -740597274, now seen corresponding path program 1 times [2024-10-11 10:21:17,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:21:17,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860011034] [2024-10-11 10:21:17,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:17,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:21:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:21:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:21:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:21:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:21:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:21:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:21:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 10:21:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:21:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:21:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:21:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 10:21:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:21:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:21:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 10:21:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:21:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:21:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:21:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:21:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:21:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:21:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:21:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:21:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 10:21:17,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:21:17,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860011034] [2024-10-11 10:21:17,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860011034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:21:17,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:21:17,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:21:17,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250821255] [2024-10-11 10:21:17,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:21:17,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:21:17,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:21:17,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:21:17,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:17,432 INFO L87 Difference]: Start difference. First operand 392 states and 601 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:21:17,571 INFO L93 Difference]: Finished difference Result 1154 states and 1771 transitions. [2024-10-11 10:21:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:21:17,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2024-10-11 10:21:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:21:17,579 INFO L225 Difference]: With dead ends: 1154 [2024-10-11 10:21:17,579 INFO L226 Difference]: Without dead ends: 763 [2024-10-11 10:21:17,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:17,582 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 92 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:21:17,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 225 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:21:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-10-11 10:21:17,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 761. [2024-10-11 10:21:17,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 484 states have (on average 1.3140495867768596) internal successors, (636), 484 states have internal predecessors, (636), 264 states have call successors, (264), 12 states have call predecessors, (264), 12 states have return successors, (264), 264 states have call predecessors, (264), 264 states have call successors, (264) [2024-10-11 10:21:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1164 transitions. [2024-10-11 10:21:17,713 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1164 transitions. Word has length 150 [2024-10-11 10:21:17,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:21:17,714 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1164 transitions. [2024-10-11 10:21:17,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1164 transitions. [2024-10-11 10:21:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 10:21:17,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:21:17,717 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:17,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:21:17,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:21:17,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:21:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1735871263, now seen corresponding path program 1 times [2024-10-11 10:21:17,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:21:17,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926522974] [2024-10-11 10:21:17,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:21:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:21:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:21:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:21:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:21:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:21:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:21:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 10:21:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:21:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:21:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:21:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 10:21:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:21:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:21:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 10:21:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:21:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:21:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:21:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:21:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:21:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:21:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:21:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:21:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 10:21:17,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:21:17,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926522974] [2024-10-11 10:21:17,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926522974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:21:17,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:21:17,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:21:17,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007984663] [2024-10-11 10:21:17,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:21:17,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:21:17,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:21:17,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:21:17,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:21:17,971 INFO L87 Difference]: Start difference. First operand 761 states and 1164 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:18,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:21:18,130 INFO L93 Difference]: Finished difference Result 1525 states and 2332 transitions. [2024-10-11 10:21:18,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:21:18,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-10-11 10:21:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:21:18,141 INFO L225 Difference]: With dead ends: 1525 [2024-10-11 10:21:18,141 INFO L226 Difference]: Without dead ends: 765 [2024-10-11 10:21:18,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:21:18,145 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 82 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:21:18,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 394 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:21:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-10-11 10:21:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 759. [2024-10-11 10:21:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 482 states have (on average 1.3070539419087137) internal successors, (630), 482 states have internal predecessors, (630), 264 states have call successors, (264), 12 states have call predecessors, (264), 12 states have return successors, (264), 264 states have call predecessors, (264), 264 states have call successors, (264) [2024-10-11 10:21:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1158 transitions. [2024-10-11 10:21:18,240 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1158 transitions. Word has length 152 [2024-10-11 10:21:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:21:18,242 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1158 transitions. [2024-10-11 10:21:18,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1158 transitions. [2024-10-11 10:21:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 10:21:18,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:21:18,245 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:18,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:21:18,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:21:18,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:21:18,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1313169437, now seen corresponding path program 1 times [2024-10-11 10:21:18,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:21:18,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570705920] [2024-10-11 10:21:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:18,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:21:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:21:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:21:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:21:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 10:21:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:21:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:21:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 10:21:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:21:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:21:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:21:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 10:21:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:21:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:21:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 10:21:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:21:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:21:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:21:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:21:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:21:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:21:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:21:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:21:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 10:21:18,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:21:18,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570705920] [2024-10-11 10:21:18,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570705920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:21:18,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:21:18,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:21:18,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671277278] [2024-10-11 10:21:18,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:21:18,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:21:18,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:21:18,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:21:18,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:21:18,516 INFO L87 Difference]: Start difference. First operand 759 states and 1158 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:18,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:21:18,673 INFO L93 Difference]: Finished difference Result 956 states and 1459 transitions. [2024-10-11 10:21:18,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:21:18,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-10-11 10:21:18,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:21:18,677 INFO L225 Difference]: With dead ends: 956 [2024-10-11 10:21:18,677 INFO L226 Difference]: Without dead ends: 198 [2024-10-11 10:21:18,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:21:18,680 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 132 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:21:18,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 215 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:21:18,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-11 10:21:18,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 130. [2024-10-11 10:21:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 10:21:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2024-10-11 10:21:18,698 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 193 transitions. Word has length 152 [2024-10-11 10:21:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:21:18,699 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 193 transitions. [2024-10-11 10:21:18,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 193 transitions. [2024-10-11 10:21:18,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 10:21:18,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:21:18,701 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:18,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 10:21:18,701 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:21:18,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:21:18,701 INFO L85 PathProgramCache]: Analyzing trace with hash 144284481, now seen corresponding path program 1 times [2024-10-11 10:21:18,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:21:18,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890474874] [2024-10-11 10:21:18,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:18,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:21:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:21:18,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319943851] [2024-10-11 10:21:18,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:18,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:21:18,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:21:18,838 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:21:18,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:21:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:21:19,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:21:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:21:19,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:21:19,171 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:21:19,172 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:21:19,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 10:21:19,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:21:19,379 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:19,510 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:21:19,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:21:19 BoogieIcfgContainer [2024-10-11 10:21:19,512 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:21:19,513 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:21:19,513 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:21:19,513 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:21:19,513 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:21:14" (3/4) ... [2024-10-11 10:21:19,515 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:21:19,516 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:21:19,517 INFO L158 Benchmark]: Toolchain (without parser) took 6351.75ms. Allocated memory was 134.2MB in the beginning and 239.1MB in the end (delta: 104.9MB). Free memory was 82.8MB in the beginning and 148.2MB in the end (delta: -65.4MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2024-10-11 10:21:19,517 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 134.2MB. Free memory was 94.6MB in the beginning and 94.5MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:21:19,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.60ms. Allocated memory is still 134.2MB. Free memory was 82.5MB in the beginning and 65.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 10:21:19,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.31ms. Allocated memory is still 134.2MB. Free memory was 65.7MB in the beginning and 61.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:21:19,517 INFO L158 Benchmark]: Boogie Preprocessor took 82.52ms. Allocated memory is still 134.2MB. Free memory was 61.5MB in the beginning and 56.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:21:19,518 INFO L158 Benchmark]: RCFGBuilder took 707.90ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 56.3MB in the beginning and 133.7MB in the end (delta: -77.4MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-10-11 10:21:19,518 INFO L158 Benchmark]: TraceAbstraction took 5064.43ms. Allocated memory was 190.8MB in the beginning and 239.1MB in the end (delta: 48.2MB). Free memory was 132.6MB in the beginning and 148.2MB in the end (delta: -15.6MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-10-11 10:21:19,518 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 239.1MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:21:19,519 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 134.2MB. Free memory was 94.6MB in the beginning and 94.5MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.60ms. Allocated memory is still 134.2MB. Free memory was 82.5MB in the beginning and 65.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.31ms. Allocated memory is still 134.2MB. Free memory was 65.7MB in the beginning and 61.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.52ms. Allocated memory is still 134.2MB. Free memory was 61.5MB in the beginning and 56.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 707.90ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 56.3MB in the beginning and 133.7MB in the end (delta: -77.4MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5064.43ms. Allocated memory was 190.8MB in the beginning and 239.1MB in the end (delta: 48.2MB). Free memory was 132.6MB in the beginning and 148.2MB in the end (delta: -15.6MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 239.1MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 203, overapproximation of someBinaryFLOATComparisonOperation at line 203, overapproximation of bitwiseOr at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] signed short int var_1_5 = -256; [L24] double var_1_7 = 256.25; [L25] double var_1_8 = 127.8; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] float var_1_12 = 999.75; [L29] float var_1_13 = 64.5; [L30] float var_1_14 = 127.25; [L31] signed char var_1_15 = -32; [L32] float var_1_16 = 32.7; [L33] unsigned char var_1_17 = 16; [L34] unsigned char var_1_18 = 32; [L35] unsigned short int var_1_19 = 5; [L36] signed long int var_1_21 = 100; [L37] signed short int var_1_22 = 50; [L38] double var_1_23 = 1000000.75; [L39] unsigned long int var_1_24 = 16; [L40] double var_1_28 = 15.5; [L41] double var_1_29 = 256.7; [L42] unsigned long int var_1_30 = 5; [L43] signed long int var_1_32 = 32; [L44] float var_1_34 = 7.5; [L45] unsigned short int var_1_35 = 100; [L46] signed short int var_1_36 = -4; [L47] unsigned short int var_1_37 = 47055; [L48] signed char var_1_39 = -64; [L49] double var_1_40 = 16.75; [L50] signed char var_1_41 = 16; [L51] signed long int last_1_var_1_1 = -256; [L52] signed short int last_1_var_1_5 = -256; [L53] unsigned char last_1_var_1_10 = 0; [L54] unsigned short int last_1_var_1_19 = 5; [L55] signed short int last_1_var_1_22 = 50; [L207] isInitial = 1 [L208] FCALL initially() [L209] COND TRUE 1 [L210] CALL updateLastVariables() [L196] last_1_var_1_1 = var_1_1 [L197] last_1_var_1_5 = var_1_5 [L198] last_1_var_1_10 = var_1_10 [L199] last_1_var_1_19 = var_1_19 [L200] last_1_var_1_22 = var_1_22 [L210] RET updateLastVariables() [L211] CALL updateVariables() [L159] var_1_7 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L160] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256, var_1_8=639/5] [L161] var_1_8 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L162] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L163] var_1_11 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L164] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L165] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L165] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L166] var_1_13 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L167] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L168] var_1_14 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L169] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L170] var_1_15 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L171] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L172] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L172] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L173] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L173] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L174] var_1_16 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L175] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L176] var_1_18 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L177] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L178] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L178] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2567/10, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L179] var_1_29 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L180] RET assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=-4, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L181] var_1_36 = __VERIFIER_nondet_short() [L182] CALL assume_abort_if_not(var_1_36 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L182] RET assume_abort_if_not(var_1_36 >= -32768) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L183] CALL assume_abort_if_not(var_1_36 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L183] RET assume_abort_if_not(var_1_36 <= 32767) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L184] CALL assume_abort_if_not(var_1_36 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L184] RET assume_abort_if_not(var_1_36 != 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=47055, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L185] var_1_37 = __VERIFIER_nondet_ushort() [L186] CALL assume_abort_if_not(var_1_37 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L186] RET assume_abort_if_not(var_1_37 >= 32767) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L187] CALL assume_abort_if_not(var_1_37 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L187] RET assume_abort_if_not(var_1_37 <= 65534) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_40=67/4, var_1_41=16, var_1_5=-256] [L188] var_1_40 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L189] RET assume_abort_if_not((var_1_40 >= -922337.2036854776000e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L190] CALL assume_abort_if_not(var_1_40 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L190] RET assume_abort_if_not(var_1_40 != 0.0F) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=16, var_1_5=-256] [L191] var_1_41 = __VERIFIER_nondet_char() [L192] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L192] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L193] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L193] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L211] RET updateVariables() [L212] CALL step() [L59] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L62] COND TRUE var_1_1 < var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L63] EXPR var_1_1 ^ var_1_17 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L63] COND FALSE !(var_1_19 < (var_1_1 ^ var_1_17)) [L73] COND FALSE !(var_1_10 || var_1_10) [L76] var_1_30 = var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L78] COND FALSE !(var_1_29 > var_1_12) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_30=5, var_1_32=32, var_1_34=15/2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L89] var_1_34 = var_1_29 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L90] EXPR (var_1_22 % var_1_36) ^ var_1_17 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=100, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L90] COND TRUE ((var_1_22 % var_1_36) ^ var_1_17) != var_1_21 [L91] var_1_35 = (((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) - var_1_17) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-64, var_1_41=-127, var_1_5=-256] [L93] COND FALSE !(((var_1_12 / var_1_40) * var_1_12) > var_1_29) [L102] var_1_39 = var_1_41 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L104] signed long int stepLocal_2 = last_1_var_1_5; [L105] unsigned char stepLocal_1 = last_1_var_1_10; [L106] signed long int stepLocal_0 = 256; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_1=0, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L107] COND FALSE !(stepLocal_1 && (last_1_var_1_5 >= last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L112] COND TRUE last_1_var_1_1 >= stepLocal_2 [L113] var_1_1 = last_1_var_1_5 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L118] var_1_10 = (last_1_var_1_10 && var_1_11) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L119] COND FALSE !(var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L124] var_1_22 = last_1_var_1_22 [L125] var_1_23 = var_1_14 [L126] unsigned char stepLocal_5 = var_1_10; [L127] unsigned char stepLocal_4 = var_1_18; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_4=51, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L128] COND TRUE var_1_22 < stepLocal_4 [L129] var_1_19 = last_1_var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L137] var_1_21 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L138] COND TRUE ! (var_1_23 <= var_1_7) [L139] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L147] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_3=0, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L148] COND FALSE !(var_1_10 && stepLocal_3) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=-256] [L151] COND TRUE (var_1_7 - var_1_8) > var_1_12 [L152] var_1_5 = var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=5] [L212] RET step() [L213] CALL, EXPR property() [L203-L204] return (((((((((last_1_var_1_10 && (last_1_var_1_5 >= last_1_var_1_1)) ? ((256 != last_1_var_1_5) ? (var_1_1 == ((signed long int) (last_1_var_1_1 + last_1_var_1_5))) : 1) : ((last_1_var_1_1 >= last_1_var_1_5) ? (var_1_1 == ((signed long int) last_1_var_1_5)) : (var_1_1 == ((signed long int) last_1_var_1_1)))) && ((var_1_10 && var_1_10) ? (var_1_5 == ((signed short int) ((((var_1_19) < (-100)) ? (var_1_19) : (-100))))) : (((var_1_7 - var_1_8) > var_1_12) ? (var_1_5 == ((signed short int) var_1_19)) : (var_1_5 == ((signed short int) var_1_19))))) && (var_1_10 == ((unsigned char) (last_1_var_1_10 && var_1_11)))) && ((! (var_1_23 <= var_1_7)) ? (var_1_12 == ((float) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) : (((((((var_1_1) > (var_1_17)) ? (var_1_1) : (var_1_17))) / var_1_15) < var_1_19) ? (var_1_12 == ((float) var_1_13)) : (var_1_12 == ((float) (var_1_16 + 49.6f)))))) && ((var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_10 ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : 1)) && ((var_1_22 < var_1_18) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (((var_1_10 || var_1_10) || var_1_10) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (var_1_19 == ((unsigned short int) var_1_22))))) && (var_1_21 == ((signed long int) var_1_22))) && (var_1_22 == ((signed short int) last_1_var_1_22))) && (var_1_23 == ((double) var_1_14)) ; [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_28=31/2, var_1_29=2, var_1_30=5, var_1_32=32, var_1_34=2, var_1_35=32751, var_1_36=1, var_1_37=32767, var_1_39=-127, var_1_41=-127, var_1_5=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 8, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 722 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 722 mSDsluCounter, 2167 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1153 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 324 IncrementalHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 1014 mSDtfsCounter, 324 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=761occurred in iteration=5, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 120 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1354 NumberOfCodeBlocks, 1354 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1041 ConstructedInterpolants, 0 QuantifiedInterpolants, 2003 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 6468/6468 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:21:19,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff8bee30ebc0a54ebfcfd9d99cb415407b7814d567c1f87cff440d6e8ced68ab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:21:21,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:21:21,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:21:21,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:21:21,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:21:21,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:21:21,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:21:21,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:21:21,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:21:21,949 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:21:21,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:21:21,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:21:21,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:21:21,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:21:21,951 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:21:21,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:21:21,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:21:21,952 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:21:21,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:21:21,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:21:21,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:21:21,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:21:21,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:21:21,955 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:21:21,955 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:21:21,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:21:21,956 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:21:21,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:21:21,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:21:21,957 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:21:21,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:21:21,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:21:21,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:21:21,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:21:21,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:21:21,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:21:21,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:21:21,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:21:21,961 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:21:21,961 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:21:21,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:21:21,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:21:21,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:21:21,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:21:21,963 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:21:21,963 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff8bee30ebc0a54ebfcfd9d99cb415407b7814d567c1f87cff440d6e8ced68ab [2024-10-11 10:21:22,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:21:22,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:21:22,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:21:22,363 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:21:22,364 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:21:22,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-10-11 10:21:23,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:21:24,162 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:21:24,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-10-11 10:21:24,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cc43136d1/682ac1407c2d4b0da68446750ad359d2/FLAG3b051e1ec [2024-10-11 10:21:24,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cc43136d1/682ac1407c2d4b0da68446750ad359d2 [2024-10-11 10:21:24,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:21:24,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:21:24,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:21:24,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:21:24,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:21:24,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:21:24" (1/1) ... [2024-10-11 10:21:24,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57143ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:24, skipping insertion in model container [2024-10-11 10:21:24,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:21:24" (1/1) ... [2024-10-11 10:21:24,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:21:24,458 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i[919,932] [2024-10-11 10:21:24,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:21:24,567 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:21:24,582 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i[919,932] [2024-10-11 10:21:24,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:21:24,640 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:21:24,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:24 WrapperNode [2024-10-11 10:21:24,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:21:24,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:21:24,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:21:24,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:21:24,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:24" (1/1) ... [2024-10-11 10:21:24,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:24" (1/1) ... [2024-10-11 10:21:24,707 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-10-11 10:21:24,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:21:24,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:21:24,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:21:24,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:21:24,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:24" (1/1) ... [2024-10-11 10:21:24,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:24" (1/1) ... [2024-10-11 10:21:24,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:24" (1/1) ... [2024-10-11 10:21:24,755 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:21:24,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:24" (1/1) ... [2024-10-11 10:21:24,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:24" (1/1) ... [2024-10-11 10:21:24,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:24" (1/1) ... [2024-10-11 10:21:24,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:24" (1/1) ... [2024-10-11 10:21:24,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:24" (1/1) ... [2024-10-11 10:21:24,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:24" (1/1) ... [2024-10-11 10:21:24,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:21:24,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:21:24,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:21:24,804 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:21:24,805 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:24" (1/1) ... [2024-10-11 10:21:24,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:21:24,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:21:24,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:21:24,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:21:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:21:24,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:21:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:21:24,891 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:21:24,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:21:24,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:21:24,973 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:21:24,975 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:21:36,944 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 10:21:36,944 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:21:37,008 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:21:37,009 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:21:37,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:21:37 BoogieIcfgContainer [2024-10-11 10:21:37,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:21:37,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:21:37,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:21:37,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:21:37,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:21:24" (1/3) ... [2024-10-11 10:21:37,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac30fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:21:37, skipping insertion in model container [2024-10-11 10:21:37,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:21:24" (2/3) ... [2024-10-11 10:21:37,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac30fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:21:37, skipping insertion in model container [2024-10-11 10:21:37,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:21:37" (3/3) ... [2024-10-11 10:21:37,024 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-25.i [2024-10-11 10:21:37,042 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:21:37,043 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:21:37,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:21:37,131 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b3dbd1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:21:37,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:21:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 54 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 10:21:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 10:21:37,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:21:37,152 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:37,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:21:37,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:21:37,158 INFO L85 PathProgramCache]: Analyzing trace with hash 25323338, now seen corresponding path program 1 times [2024-10-11 10:21:37,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:21:37,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795288556] [2024-10-11 10:21:37,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:37,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:21:37,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:21:37,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:21:37,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:21:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:38,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:21:38,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:21:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-11 10:21:38,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:21:38,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:21:38,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795288556] [2024-10-11 10:21:38,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795288556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:21:38,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:21:38,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:21:38,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605709188] [2024-10-11 10:21:38,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:21:38,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:21:38,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:21:38,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:21:38,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:21:38,445 INFO L87 Difference]: Start difference. First operand has 78 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 54 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 10:21:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:21:39,141 INFO L93 Difference]: Finished difference Result 153 states and 272 transitions. [2024-10-11 10:21:39,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:21:39,158 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 147 [2024-10-11 10:21:39,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:21:39,168 INFO L225 Difference]: With dead ends: 153 [2024-10-11 10:21:39,168 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 10:21:39,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:21:39,176 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 10:21:39,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 10:21:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 10:21:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-11 10:21:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 52 states have internal predecessors, (77), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 10:21:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 121 transitions. [2024-10-11 10:21:39,218 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 121 transitions. Word has length 147 [2024-10-11 10:21:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:21:39,218 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 121 transitions. [2024-10-11 10:21:39,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-11 10:21:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 121 transitions. [2024-10-11 10:21:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 10:21:39,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:21:39,224 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:39,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:21:39,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:21:39,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:21:39,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:21:39,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1595502730, now seen corresponding path program 1 times [2024-10-11 10:21:39,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:21:39,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069255407] [2024-10-11 10:21:39,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:39,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:21:39,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:21:39,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:21:39,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:21:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:40,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:21:40,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:21:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 10:21:46,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:21:46,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:21:46,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069255407] [2024-10-11 10:21:46,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069255407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:21:46,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:21:46,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:21:46,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156554490] [2024-10-11 10:21:46,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:21:46,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:21:46,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:21:46,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:21:46,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:46,149 INFO L87 Difference]: Start difference. First operand 76 states and 121 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:21:47,250 INFO L93 Difference]: Finished difference Result 224 states and 357 transitions. [2024-10-11 10:21:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:21:47,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-10-11 10:21:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:21:47,255 INFO L225 Difference]: With dead ends: 224 [2024-10-11 10:21:47,255 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 10:21:47,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:47,258 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 47 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:21:47,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 227 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 10:21:47,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 10:21:47,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 134. [2024-10-11 10:21:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 87 states have internal predecessors, (121), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 10:21:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 209 transitions. [2024-10-11 10:21:47,288 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 209 transitions. Word has length 147 [2024-10-11 10:21:47,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:21:47,289 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 209 transitions. [2024-10-11 10:21:47,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 209 transitions. [2024-10-11 10:21:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 10:21:47,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:21:47,292 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:47,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 10:21:47,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:21:47,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:21:47,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:21:47,494 INFO L85 PathProgramCache]: Analyzing trace with hash 125413706, now seen corresponding path program 1 times [2024-10-11 10:21:47,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:21:47,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361176122] [2024-10-11 10:21:47,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:47,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:21:47,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:21:47,498 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:21:47,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:21:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:48,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:21:48,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:21:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 10:21:54,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:21:54,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:21:54,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361176122] [2024-10-11 10:21:54,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361176122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:21:54,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:21:54,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:21:54,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108402050] [2024-10-11 10:21:54,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:21:54,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:21:54,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:21:54,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:21:54,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:54,271 INFO L87 Difference]: Start difference. First operand 134 states and 209 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:21:55,452 INFO L93 Difference]: Finished difference Result 396 states and 618 transitions. [2024-10-11 10:21:55,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:21:55,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-10-11 10:21:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:21:55,459 INFO L225 Difference]: With dead ends: 396 [2024-10-11 10:21:55,459 INFO L226 Difference]: Without dead ends: 263 [2024-10-11 10:21:55,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:21:55,462 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 49 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:21:55,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 249 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 10:21:55,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-11 10:21:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 260. [2024-10-11 10:21:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 167 states have (on average 1.3592814371257484) internal successors, (227), 167 states have internal predecessors, (227), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 10:21:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 403 transitions. [2024-10-11 10:21:55,504 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 403 transitions. Word has length 147 [2024-10-11 10:21:55,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:21:55,505 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 403 transitions. [2024-10-11 10:21:55,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:21:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 403 transitions. [2024-10-11 10:21:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 10:21:55,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:21:55,508 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:21:55,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 10:21:55,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:21:55,709 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:21:55,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:21:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash -136821744, now seen corresponding path program 1 times [2024-10-11 10:21:55,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:21:55,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171852951] [2024-10-11 10:21:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:21:55,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:21:55,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:21:55,715 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:21:55,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 10:21:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:21:56,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:21:56,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:22:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 10:22:02,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:22:02,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:22:02,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171852951] [2024-10-11 10:22:02,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171852951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:22:02,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:22:02,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:22:02,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194712798] [2024-10-11 10:22:02,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:22:02,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:22:02,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:22:02,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:22:02,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:22:02,407 INFO L87 Difference]: Start difference. First operand 260 states and 403 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:22:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:22:04,215 INFO L93 Difference]: Finished difference Result 441 states and 682 transitions. [2024-10-11 10:22:04,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:22:04,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-10-11 10:22:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:22:04,218 INFO L225 Difference]: With dead ends: 441 [2024-10-11 10:22:04,218 INFO L226 Difference]: Without dead ends: 182 [2024-10-11 10:22:04,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:22:04,223 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 109 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 10:22:04,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 191 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 10:22:04,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-11 10:22:04,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 118. [2024-10-11 10:22:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 10:22:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 177 transitions. [2024-10-11 10:22:04,271 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 177 transitions. Word has length 147 [2024-10-11 10:22:04,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:22:04,272 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 177 transitions. [2024-10-11 10:22:04,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:22:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 177 transitions. [2024-10-11 10:22:04,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 10:22:04,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:22:04,275 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:22:04,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 10:22:04,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:22:04,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:22:04,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:22:04,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1664403228, now seen corresponding path program 1 times [2024-10-11 10:22:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:22:04,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874685866] [2024-10-11 10:22:04,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:22:04,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:22:04,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:22:04,480 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:22:04,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 10:22:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:22:05,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:22:05,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:22:17,178 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 10:22:17,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:22:17,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:22:17,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874685866] [2024-10-11 10:22:17,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874685866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:22:17,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:22:17,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:22:17,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990517254] [2024-10-11 10:22:17,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:22:17,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:22:17,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:22:17,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:22:17,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:22:17,182 INFO L87 Difference]: Start difference. First operand 118 states and 177 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:22:21,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:22:21,768 INFO L93 Difference]: Finished difference Result 222 states and 333 transitions. [2024-10-11 10:22:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:22:21,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-10-11 10:22:21,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:22:21,784 INFO L225 Difference]: With dead ends: 222 [2024-10-11 10:22:21,784 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 10:22:21,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:22:21,789 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 91 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:22:21,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 366 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 10:22:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 10:22:21,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2024-10-11 10:22:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 10:22:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 196 transitions. [2024-10-11 10:22:21,823 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 196 transitions. Word has length 148 [2024-10-11 10:22:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:22:21,824 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 196 transitions. [2024-10-11 10:22:21,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 10:22:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 196 transitions. [2024-10-11 10:22:21,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 10:22:21,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:22:21,831 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:22:21,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 10:22:22,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:22:22,032 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:22:22,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:22:22,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2043758054, now seen corresponding path program 1 times [2024-10-11 10:22:22,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:22:22,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141533592] [2024-10-11 10:22:22,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:22:22,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:22:22,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:22:22,035 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:22:22,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 10:22:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:22:23,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 10:22:23,156 INFO L278 TraceCheckSpWp]: Computing forward predicates...