./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_loopvsstraightlinecode_100-1loop_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-8.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1f77d3fa5e179feeb79449d942d251fd79b5fcf3b2d3e183583549dc44656dd2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:09:34,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:09:34,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:09:34,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:09:34,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:09:34,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:09:34,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:09:34,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:09:34,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:09:34,320 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:09:34,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:09:34,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:09:34,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:09:34,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:09:34,323 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:09:34,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:09:34,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:09:34,324 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:09:34,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:09:34,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:09:34,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:09:34,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:09:34,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:09:34,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:09:34,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:09:34,328 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:09:34,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:09:34,329 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:09:34,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:09:34,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:09:34,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:09:34,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:09:34,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:09:34,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:09:34,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:09:34,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:09:34,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:09:34,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:09:34,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:09:34,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:09:34,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:09:34,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:09:34,331 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/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/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 -> 1f77d3fa5e179feeb79449d942d251fd79b5fcf3b2d3e183583549dc44656dd2 [2024-10-24 09:09:34,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:09:34,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:09:34,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:09:34,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:09:34,624 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:09:34,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-8.i [2024-10-24 09:09:36,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:09:36,260 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:09:36,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-8.i [2024-10-24 09:09:36,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315f74c09/3d8cff9f76d44350b68bc71d8583da15/FLAG0bd6c4ddf [2024-10-24 09:09:36,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315f74c09/3d8cff9f76d44350b68bc71d8583da15 [2024-10-24 09:09:36,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:09:36,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:09:36,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:09:36,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:09:36,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:09:36,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:09:36" (1/1) ... [2024-10-24 09:09:36,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ced2c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:36, skipping insertion in model container [2024-10-24 09:09:36,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:09:36" (1/1) ... [2024-10-24 09:09:36,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:09:36,487 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_loopvsstraightlinecode_100-1loop_file-8.i[915,928] [2024-10-24 09:09:36,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:09:36,592 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:09:36,604 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_loopvsstraightlinecode_100-1loop_file-8.i[915,928] [2024-10-24 09:09:36,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:09:36,649 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:09:36,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:36 WrapperNode [2024-10-24 09:09:36,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:09:36,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:09:36,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:09:36,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:09:36,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:36" (1/1) ... [2024-10-24 09:09:36,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:36" (1/1) ... [2024-10-24 09:09:36,745 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 255 [2024-10-24 09:09:36,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:09:36,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:09:36,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:09:36,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:09:36,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:36" (1/1) ... [2024-10-24 09:09:36,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:36" (1/1) ... [2024-10-24 09:09:36,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:36" (1/1) ... [2024-10-24 09:09:36,831 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-24 09:09:36,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:36" (1/1) ... [2024-10-24 09:09:36,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:36" (1/1) ... [2024-10-24 09:09:36,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:36" (1/1) ... [2024-10-24 09:09:36,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:36" (1/1) ... [2024-10-24 09:09:36,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:36" (1/1) ... [2024-10-24 09:09:36,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:36" (1/1) ... [2024-10-24 09:09:36,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:09:36,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:09:36,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:09:36,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:09:36,904 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:36" (1/1) ... [2024-10-24 09:09:36,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:09:36,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:09:36,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:09:36,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:09:36,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:09:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:09:36,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:09:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:09:36,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:09:36,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:09:37,108 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:09:37,114 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:09:37,550 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-24 09:09:37,551 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:09:37,596 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:09:37,597 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:09:37,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:09:37 BoogieIcfgContainer [2024-10-24 09:09:37,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:09:37,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:09:37,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:09:37,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:09:37,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:09:36" (1/3) ... [2024-10-24 09:09:37,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38276cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:09:37, skipping insertion in model container [2024-10-24 09:09:37,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:36" (2/3) ... [2024-10-24 09:09:37,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38276cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:09:37, skipping insertion in model container [2024-10-24 09:09:37,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:09:37" (3/3) ... [2024-10-24 09:09:37,609 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-8.i [2024-10-24 09:09:37,635 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:09:37,635 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:09:37,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:09:37,701 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;@24e37a5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:09:37,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:09:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 70 states have internal predecessors, (103), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:09:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 09:09:37,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:09:37,720 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:09:37,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:09:37,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:09:37,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1549259112, now seen corresponding path program 1 times [2024-10-24 09:09:37,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:09:37,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198533854] [2024-10-24 09:09:37,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:09:37,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:09:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:09:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:09:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:09:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:09:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:09:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:09:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:09:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:09:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:09:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:09:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:09:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:09:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:09:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:09:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:09:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:09:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:09:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:09:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:09:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:09:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:09:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:09:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:09:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:09:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:09:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:09:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 09:09:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:09:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 09:09:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 09:09:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 09:09:38,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:09:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198533854] [2024-10-24 09:09:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198533854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:09:38,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:09:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:09:38,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259060692] [2024-10-24 09:09:38,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:09:38,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:09:38,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:09:38,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:09:38,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:09:38,563 INFO L87 Difference]: Start difference. First operand has 102 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 70 states have internal predecessors, (103), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:09:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:09:38,784 INFO L93 Difference]: Finished difference Result 304 states and 547 transitions. [2024-10-24 09:09:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:09:38,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-24 09:09:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:09:38,798 INFO L225 Difference]: With dead ends: 304 [2024-10-24 09:09:38,799 INFO L226 Difference]: Without dead ends: 199 [2024-10-24 09:09:38,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 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-24 09:09:38,809 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 154 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:09:38,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 432 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:09:38,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-24 09:09:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 110. [2024-10-24 09:09:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 78 states have internal predecessors, (113), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:09:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 173 transitions. [2024-10-24 09:09:38,867 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 173 transitions. Word has length 194 [2024-10-24 09:09:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:09:38,869 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 173 transitions. [2024-10-24 09:09:38,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:09:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 173 transitions. [2024-10-24 09:09:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 09:09:38,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:09:38,874 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:09:38,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:09:38,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:09:38,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:09:38,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2044643606, now seen corresponding path program 1 times [2024-10-24 09:09:38,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:09:38,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117001955] [2024-10-24 09:09:38,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:09:38,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:09:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:09:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:09:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:09:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:09:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:09:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:09:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:09:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:09:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:09:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:09:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:09:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:09:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:09:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:09:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:09:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:09:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:09:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:09:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:09:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:09:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:09:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:09:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:09:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:09:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:09:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:09:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 09:09:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:09:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 09:09:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 09:09:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 09:09:39,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:09:39,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117001955] [2024-10-24 09:09:39,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117001955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:09:39,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:09:39,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:09:39,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325257460] [2024-10-24 09:09:39,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:09:39,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:09:39,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:09:39,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:09:39,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:09:39,239 INFO L87 Difference]: Start difference. First operand 110 states and 173 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:09:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:09:39,311 INFO L93 Difference]: Finished difference Result 294 states and 467 transitions. [2024-10-24 09:09:39,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:09:39,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-24 09:09:39,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:09:39,318 INFO L225 Difference]: With dead ends: 294 [2024-10-24 09:09:39,318 INFO L226 Difference]: Without dead ends: 185 [2024-10-24 09:09:39,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-24 09:09:39,322 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 152 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:09:39,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 382 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:09:39,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-24 09:09:39,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 100. [2024-10-24 09:09:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:09:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 156 transitions. [2024-10-24 09:09:39,344 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 156 transitions. Word has length 194 [2024-10-24 09:09:39,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:09:39,346 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 156 transitions. [2024-10-24 09:09:39,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:09:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 156 transitions. [2024-10-24 09:09:39,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-24 09:09:39,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:09:39,353 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:09:39,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:09:39,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:09:39,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:09:39,354 INFO L85 PathProgramCache]: Analyzing trace with hash -316662217, now seen corresponding path program 1 times [2024-10-24 09:09:39,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:09:39,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661228171] [2024-10-24 09:09:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:09:39,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:09:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:09:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:09:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:09:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:09:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:09:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:09:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:09:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:09:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:09:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:09:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:09:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:09:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:09:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:09:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:09:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:09:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:09:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:09:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:09:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:09:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:09:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:09:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:09:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:09:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:09:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:09:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 09:09:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:09:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 09:09:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 09:09:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 09:09:39,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:09:39,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661228171] [2024-10-24 09:09:39,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661228171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:09:39,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:09:39,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:09:39,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652297292] [2024-10-24 09:09:39,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:09:39,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:09:39,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:09:39,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:09:39,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:09:39,671 INFO L87 Difference]: Start difference. First operand 100 states and 156 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:09:39,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:09:39,772 INFO L93 Difference]: Finished difference Result 298 states and 466 transitions. [2024-10-24 09:09:39,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:09:39,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2024-10-24 09:09:39,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:09:39,774 INFO L225 Difference]: With dead ends: 298 [2024-10-24 09:09:39,774 INFO L226 Difference]: Without dead ends: 199 [2024-10-24 09:09:39,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 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-24 09:09:39,776 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 86 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:09:39,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 275 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:09:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-24 09:09:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2024-10-24 09:09:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 133 states have (on average 1.3984962406015038) internal successors, (186), 133 states have internal predecessors, (186), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 09:09:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 306 transitions. [2024-10-24 09:09:39,795 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 306 transitions. Word has length 195 [2024-10-24 09:09:39,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:09:39,795 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 306 transitions. [2024-10-24 09:09:39,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:09:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 306 transitions. [2024-10-24 09:09:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 09:09:39,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:09:39,797 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:09:39,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:09:39,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:09:39,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:09:39,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1521981005, now seen corresponding path program 1 times [2024-10-24 09:09:39,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:09:39,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910767424] [2024-10-24 09:09:39,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:09:39,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:09:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:09:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:09:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:09:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:09:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:09:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:09:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:09:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:09:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:09:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:09:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:09:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:09:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:09:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:09:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:09:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:09:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:09:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:09:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:09:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:09:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:09:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:09:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:09:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:09:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:39,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:09:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:09:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 09:09:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:09:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 09:09:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 09:09:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 09:09:40,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:09:40,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910767424] [2024-10-24 09:09:40,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910767424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:09:40,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:09:40,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:09:40,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798565811] [2024-10-24 09:09:40,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:09:40,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:09:40,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:09:40,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:09:40,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:09:40,035 INFO L87 Difference]: Start difference. First operand 196 states and 306 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:09:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:09:40,456 INFO L93 Difference]: Finished difference Result 493 states and 767 transitions. [2024-10-24 09:09:40,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:09:40,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 196 [2024-10-24 09:09:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:09:40,458 INFO L225 Difference]: With dead ends: 493 [2024-10-24 09:09:40,458 INFO L226 Difference]: Without dead ends: 298 [2024-10-24 09:09:40,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 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-24 09:09:40,460 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 255 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:09:40,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 468 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 09:09:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-24 09:09:40,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 208. [2024-10-24 09:09:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 145 states have internal predecessors, (201), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 09:09:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 321 transitions. [2024-10-24 09:09:40,480 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 321 transitions. Word has length 196 [2024-10-24 09:09:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:09:40,481 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 321 transitions. [2024-10-24 09:09:40,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:09:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 321 transitions. [2024-10-24 09:09:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 09:09:40,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:09:40,482 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:09:40,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:09:40,483 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:09:40,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:09:40,483 INFO L85 PathProgramCache]: Analyzing trace with hash 935174991, now seen corresponding path program 1 times [2024-10-24 09:09:40,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:09:40,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681556476] [2024-10-24 09:09:40,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:09:40,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:09:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:09:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:09:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:09:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:09:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:09:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:09:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:09:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:09:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:09:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:09:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:09:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:09:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:09:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:09:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:09:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:09:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:09:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:09:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:09:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:09:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:09:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:09:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:09:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:09:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:09:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:09:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 09:09:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:09:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 09:09:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 09:09:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:40,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 09:09:40,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:09:40,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681556476] [2024-10-24 09:09:40,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681556476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:09:40,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:09:40,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:09:40,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930816627] [2024-10-24 09:09:40,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:09:40,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:09:40,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:09:40,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:09:40,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:09:40,643 INFO L87 Difference]: Start difference. First operand 208 states and 321 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:09:40,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:09:40,949 INFO L93 Difference]: Finished difference Result 493 states and 766 transitions. [2024-10-24 09:09:40,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:09:40,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 196 [2024-10-24 09:09:40,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:09:40,951 INFO L225 Difference]: With dead ends: 493 [2024-10-24 09:09:40,951 INFO L226 Difference]: Without dead ends: 286 [2024-10-24 09:09:40,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 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-24 09:09:40,953 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 171 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:09:40,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 484 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 09:09:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-24 09:09:40,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 196. [2024-10-24 09:09:40,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 133 states have (on average 1.3834586466165413) internal successors, (184), 133 states have internal predecessors, (184), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 09:09:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 304 transitions. [2024-10-24 09:09:40,980 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 304 transitions. Word has length 196 [2024-10-24 09:09:40,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:09:40,982 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 304 transitions. [2024-10-24 09:09:40,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:09:40,983 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 304 transitions. [2024-10-24 09:09:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 09:09:40,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:09:40,985 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:09:40,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:09:40,986 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:09:40,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:09:40,986 INFO L85 PathProgramCache]: Analyzing trace with hash 340656682, now seen corresponding path program 1 times [2024-10-24 09:09:40,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:09:40,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125908760] [2024-10-24 09:09:40,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:09:40,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:09:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:09:41,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2108256675] [2024-10-24 09:09:41,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:09:41,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:09:41,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:09:41,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:09:41,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 09:09:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:09:41,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:09:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:09:41,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:09:41,514 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:09:41,515 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:09:41,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:09:41,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 09:09:41,725 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 09:09:41,811 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:09:41,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:09:41 BoogieIcfgContainer [2024-10-24 09:09:41,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:09:41,814 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:09:41,814 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:09:41,815 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:09:41,815 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:09:37" (3/4) ... [2024-10-24 09:09:41,816 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:09:41,817 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:09:41,818 INFO L158 Benchmark]: Toolchain (without parser) took 5532.50ms. Allocated memory was 151.0MB in the beginning and 249.6MB in the end (delta: 98.6MB). Free memory was 79.2MB in the beginning and 110.8MB in the end (delta: -31.6MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2024-10-24 09:09:41,818 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:09:41,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.25ms. Allocated memory is still 151.0MB. Free memory was 78.9MB in the beginning and 61.4MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 09:09:41,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.38ms. Allocated memory is still 151.0MB. Free memory was 61.4MB in the beginning and 57.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:09:41,819 INFO L158 Benchmark]: Boogie Preprocessor took 143.10ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 57.0MB in the beginning and 173.3MB in the end (delta: -116.3MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-10-24 09:09:41,819 INFO L158 Benchmark]: RCFGBuilder took 698.87ms. Allocated memory is still 203.4MB. Free memory was 173.3MB in the beginning and 138.7MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 09:09:41,819 INFO L158 Benchmark]: TraceAbstraction took 4213.98ms. Allocated memory was 203.4MB in the beginning and 249.6MB in the end (delta: 46.1MB). Free memory was 138.7MB in the beginning and 110.8MB in the end (delta: 27.9MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. [2024-10-24 09:09:41,819 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 249.6MB. Free memory is still 110.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:09:41,820 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.15ms. Allocated memory is still 151.0MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.25ms. Allocated memory is still 151.0MB. Free memory was 78.9MB in the beginning and 61.4MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.38ms. Allocated memory is still 151.0MB. Free memory was 61.4MB in the beginning and 57.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 143.10ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 57.0MB in the beginning and 173.3MB in the end (delta: -116.3MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * RCFGBuilder took 698.87ms. Allocated memory is still 203.4MB. Free memory was 173.3MB in the beginning and 138.7MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4213.98ms. Allocated memory was 203.4MB in the beginning and 249.6MB in the end (delta: 46.1MB). Free memory was 138.7MB in the beginning and 110.8MB in the end (delta: 27.9MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 249.6MB. Free memory is still 110.8MB. 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 someBinaryFLOATComparisonOperation at line 193, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryArithmeticFLOAToperation at line 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 256.8; [L23] signed long int var_1_4 = -5; [L24] float var_1_5 = 7.875; [L25] float var_1_6 = 99.04; [L26] signed long int var_1_7 = -2; [L27] signed long int var_1_8 = 1227169815; [L28] signed short int var_1_11 = 4; [L29] unsigned char var_1_12 = 1; [L30] double var_1_14 = -0.5; [L31] double var_1_15 = 7.5; [L32] unsigned char var_1_16 = 1; [L33] double var_1_17 = 25.2; [L34] double var_1_18 = 256.4; [L35] signed long int var_1_19 = 4; [L36] unsigned char var_1_20 = 1; [L37] unsigned char var_1_22 = 50; [L38] float var_1_23 = 15.4; [L39] signed short int var_1_24 = -32; [L40] signed short int var_1_25 = 20388; [L41] signed long int var_1_26 = 0; [L42] double var_1_27 = 0.6; [L43] unsigned char var_1_28 = 128; [L44] unsigned char var_1_29 = 5; [L45] signed char var_1_30 = -2; [L46] signed char var_1_31 = 5; [L47] signed char var_1_32 = 10; [L48] signed char var_1_33 = 4; [L49] signed char var_1_34 = 8; [L50] float last_1_var_1_1 = 256.8; [L51] unsigned char last_1_var_1_20 = 1; [L52] float last_1_var_1_23 = 15.4; [L197] isInitial = 1 [L198] FCALL initially() [L199] int k_loop; [L200] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=-5, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L200] COND TRUE k_loop < 1 [L201] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_20 = var_1_20 [L190] last_1_var_1_23 = var_1_23 [L201] RET updateLastVariables() [L202] CALL updateVariables() [L140] var_1_4 = __VERIFIER_nondet_long() [L141] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L141] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L142] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L142] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L143] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L143] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L144] var_1_5 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L145] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L146] var_1_6 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1227169815] [L147] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1227169815] [L148] var_1_8 = __VERIFIER_nondet_long() [L149] CALL assume_abort_if_not(var_1_8 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L149] RET assume_abort_if_not(var_1_8 >= 1073741822) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L150] CALL assume_abort_if_not(var_1_8 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L150] RET assume_abort_if_not(var_1_8 <= 2147483646) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L151] var_1_12 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L152] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L153] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L153] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L154] var_1_16 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L155] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L156] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L156] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L157] var_1_17 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L158] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L159] var_1_18 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L160] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L161] var_1_22 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L162] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L163] CALL assume_abort_if_not(var_1_22 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L163] RET assume_abort_if_not(var_1_22 <= 254) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L164] var_1_24 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_24 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L165] RET assume_abort_if_not(var_1_24 >= -32768) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L166] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L166] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L167] CALL assume_abort_if_not(var_1_24 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L167] RET assume_abort_if_not(var_1_24 != 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L168] var_1_25 = __VERIFIER_nondet_short() [L169] CALL assume_abort_if_not(var_1_25 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L169] RET assume_abort_if_not(var_1_25 >= 16383) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L170] CALL assume_abort_if_not(var_1_25 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L170] RET assume_abort_if_not(var_1_25 <= 32767) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L171] var_1_29 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L172] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L173] CALL assume_abort_if_not(var_1_29 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L173] RET assume_abort_if_not(var_1_29 <= 254) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L174] var_1_31 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_31 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L175] RET assume_abort_if_not(var_1_31 >= -63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L176] CALL assume_abort_if_not(var_1_31 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L176] RET assume_abort_if_not(var_1_31 <= 63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L177] var_1_32 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_32 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L178] RET assume_abort_if_not(var_1_32 >= -63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L179] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L179] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L180] var_1_33 = __VERIFIER_nondet_char() [L181] CALL assume_abort_if_not(var_1_33 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L181] RET assume_abort_if_not(var_1_33 >= -127) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L182] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L182] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L183] var_1_34 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_34 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L184] RET assume_abort_if_not(var_1_34 >= -127) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L185] CALL assume_abort_if_not(var_1_34 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L185] RET assume_abort_if_not(var_1_34 <= 126) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L202] RET updateVariables() [L203] CALL step() [L56] COND FALSE !(var_1_18 < last_1_var_1_23) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L67] COND TRUE var_1_8 > var_1_4 [L68] var_1_11 = 0 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L80] COND TRUE (var_1_22 + (var_1_20 / var_1_24)) <= var_1_20 [L81] var_1_27 = (10000.2 + (((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) < 0 ) ? -((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) : ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L85] signed long int stepLocal_5 = 10000000; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_5=10000000, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L86] COND TRUE (var_1_5 - var_1_6) >= var_1_27 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_5=10000000, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-768, var_1_30=-2, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L87] COND TRUE stepLocal_5 > var_1_11 [L88] var_1_30 = (((((var_1_31 + var_1_32)) > (var_1_33)) ? ((var_1_31 + var_1_32)) : (var_1_33))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L93] signed char stepLocal_4 = var_1_30; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_4=0, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L94] COND TRUE ((var_1_30 + var_1_20) / var_1_4) > stepLocal_4 [L95] var_1_28 = ((((var_1_22) < (var_1_29)) ? (var_1_22) : (var_1_29))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L97] var_1_19 = (var_1_28 + (var_1_30 + var_1_11)) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L98] EXPR 8 << var_1_19 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L98] COND FALSE !(var_1_20 < ((8 << var_1_19) / ((((var_1_4) < (var_1_24)) ? (var_1_4) : (var_1_24))))) [L103] unsigned char stepLocal_1 = var_1_4 >= var_1_11; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_1=1, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=-2, var_1_8=1073741822] [L104] COND TRUE ((var_1_6 - var_1_5) < var_1_23) || stepLocal_1 [L105] var_1_7 = ((var_1_8 - var_1_28) - var_1_28) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=1073741822, var_1_8=1073741822] [L109] signed long int stepLocal_0 = var_1_7 % var_1_4; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=1073741822, var_1_8=1073741822] [L110] COND TRUE var_1_19 == stepLocal_0 [L111] var_1_1 = (var_1_5 - var_1_6) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_7=1073741822, var_1_8=1073741822] [L113] COND FALSE !(\read(var_1_12)) [L120] var_1_14 = var_1_6 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L122] COND TRUE 1.000000004E8 == var_1_23 [L123] var_1_26 = (64 + var_1_20) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L127] unsigned char stepLocal_3 = var_1_16; [L128] signed long int stepLocal_2 = var_1_8; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_2=1073741822, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L129] EXPR var_1_26 ^ var_1_30 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_2=1073741822, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L129] COND FALSE !(stepLocal_2 < (var_1_26 ^ var_1_30)) [L136] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L203] RET step() [L204] CALL, EXPR property() [L193] EXPR (((((var_1_19 == (var_1_7 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((((var_1_6 - var_1_5) < var_1_23) || (var_1_4 >= var_1_11)) ? (var_1_7 == ((signed long int) ((var_1_8 - var_1_28) - var_1_28))) : (var_1_7 == ((signed long int) -32)))) && ((var_1_8 > var_1_4) ? (var_1_11 == ((signed short int) 0)) : ((var_1_8 <= (last_1_var_1_20 + (last_1_var_1_20 / var_1_4))) ? (var_1_12 ? (var_1_11 == ((signed short int) last_1_var_1_20)) : (var_1_11 == ((signed short int) last_1_var_1_20))) : (var_1_11 == ((signed short int) last_1_var_1_20))))) && (var_1_12 ? ((((var_1_19 + var_1_20) * var_1_20) == ((var_1_8 + var_1_4) * var_1_20)) ? (var_1_14 == ((double) var_1_6)) : (var_1_14 == ((double) var_1_6))) : (var_1_14 == ((double) var_1_6)))) && ((var_1_8 < (var_1_26 ^ var_1_30)) ? (((! var_1_12) || var_1_16) ? (var_1_15 == ((double) ((((var_1_6) < ((var_1_17 + var_1_18))) ? (var_1_6) : ((var_1_17 + var_1_18)))))) : (var_1_15 == ((double) var_1_17))) : (var_1_15 == ((double) var_1_17))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L193] EXPR ((((((((var_1_19 == (var_1_7 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((((var_1_6 - var_1_5) < var_1_23) || (var_1_4 >= var_1_11)) ? (var_1_7 == ((signed long int) ((var_1_8 - var_1_28) - var_1_28))) : (var_1_7 == ((signed long int) -32)))) && ((var_1_8 > var_1_4) ? (var_1_11 == ((signed short int) 0)) : ((var_1_8 <= (last_1_var_1_20 + (last_1_var_1_20 / var_1_4))) ? (var_1_12 ? (var_1_11 == ((signed short int) last_1_var_1_20)) : (var_1_11 == ((signed short int) last_1_var_1_20))) : (var_1_11 == ((signed short int) last_1_var_1_20))))) && (var_1_12 ? ((((var_1_19 + var_1_20) * var_1_20) == ((var_1_8 + var_1_4) * var_1_20)) ? (var_1_14 == ((double) var_1_6)) : (var_1_14 == ((double) var_1_6))) : (var_1_14 == ((double) var_1_6)))) && ((var_1_8 < (var_1_26 ^ var_1_30)) ? (((! var_1_12) || var_1_16) ? (var_1_15 == ((double) ((((var_1_6) < ((var_1_17 + var_1_18))) ? (var_1_6) : ((var_1_17 + var_1_18)))))) : (var_1_15 == ((double) var_1_17))) : (var_1_15 == ((double) var_1_17)))) && (var_1_19 == ((signed long int) (var_1_28 + (var_1_30 + var_1_11))))) && ((var_1_18 < last_1_var_1_23) ? (var_1_12 ? (((last_1_var_1_1 + var_1_6) != last_1_var_1_1) ? (var_1_20 == ((unsigned char) var_1_22)) : (var_1_20 == ((unsigned char) var_1_22))) : (var_1_20 == ((unsigned char) var_1_22))) : 1)) && ((var_1_20 < ((8 << var_1_19) / ((((var_1_4) < (var_1_24)) ? (var_1_4) : (var_1_24))))) ? (((256 - (var_1_25 - var_1_22)) >= var_1_11) ? (var_1_23 == ((float) (((((var_1_5 - var_1_6)) < (var_1_17)) ? ((var_1_5 - var_1_6)) : (var_1_17))))) : 1) : 1) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L193-L194] return ((((((((((((var_1_19 == (var_1_7 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((((var_1_6 - var_1_5) < var_1_23) || (var_1_4 >= var_1_11)) ? (var_1_7 == ((signed long int) ((var_1_8 - var_1_28) - var_1_28))) : (var_1_7 == ((signed long int) -32)))) && ((var_1_8 > var_1_4) ? (var_1_11 == ((signed short int) 0)) : ((var_1_8 <= (last_1_var_1_20 + (last_1_var_1_20 / var_1_4))) ? (var_1_12 ? (var_1_11 == ((signed short int) last_1_var_1_20)) : (var_1_11 == ((signed short int) last_1_var_1_20))) : (var_1_11 == ((signed short int) last_1_var_1_20))))) && (var_1_12 ? ((((var_1_19 + var_1_20) * var_1_20) == ((var_1_8 + var_1_4) * var_1_20)) ? (var_1_14 == ((double) var_1_6)) : (var_1_14 == ((double) var_1_6))) : (var_1_14 == ((double) var_1_6)))) && ((var_1_8 < (var_1_26 ^ var_1_30)) ? (((! var_1_12) || var_1_16) ? (var_1_15 == ((double) ((((var_1_6) < ((var_1_17 + var_1_18))) ? (var_1_6) : ((var_1_17 + var_1_18)))))) : (var_1_15 == ((double) var_1_17))) : (var_1_15 == ((double) var_1_17)))) && (var_1_19 == ((signed long int) (var_1_28 + (var_1_30 + var_1_11))))) && ((var_1_18 < last_1_var_1_23) ? (var_1_12 ? (((last_1_var_1_1 + var_1_6) != last_1_var_1_1) ? (var_1_20 == ((unsigned char) var_1_22)) : (var_1_20 == ((unsigned char) var_1_22))) : (var_1_20 == ((unsigned char) var_1_22))) : 1)) && ((var_1_20 < ((8 << var_1_19) / ((((var_1_4) < (var_1_24)) ? (var_1_4) : (var_1_24))))) ? (((256 - (var_1_25 - var_1_22)) >= var_1_11) ? (var_1_23 == ((float) (((((var_1_5 - var_1_6)) < (var_1_17)) ? ((var_1_5 - var_1_6)) : (var_1_17))))) : 1) : 1)) && ((1.000000004E8 == var_1_23) ? (var_1_26 == ((signed long int) (64 + var_1_20))) : (var_1_26 == ((signed long int) ((((-4) < 0 ) ? -(-4) : (-4))))))) && (((var_1_22 + (var_1_20 / var_1_24)) <= var_1_20) ? (var_1_27 == ((double) (10000.2 + (((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) < 0 ) ? -((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) : ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))))))) : (var_1_27 == ((double) (var_1_5 - var_1_6))))) && ((((var_1_30 + var_1_20) / var_1_4) > var_1_30) ? (var_1_28 == ((unsigned char) ((((var_1_22) < (var_1_29)) ? (var_1_22) : (var_1_29))))) : 1)) && (((var_1_5 - var_1_6) >= var_1_27) ? ((10000000 > var_1_11) ? (var_1_30 == ((signed char) (((((var_1_31 + var_1_32)) > (var_1_33)) ? ((var_1_31 + var_1_32)) : (var_1_33))))) : (var_1_30 == ((signed char) var_1_34))) : 1) ; [L204] RET, EXPR property() [L204] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=-512, var_1_23=77/5, var_1_24=-9, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-768, var_1_30=0, var_1_31=-63, var_1_32=-63, var_1_33=0, var_1_34=-1, var_1_4=1, var_1_6=2, var_1_7=1073741822, var_1_8=1073741822] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 6, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 818 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 818 mSDsluCounter, 2041 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 796 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 377 IncrementalHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 1245 mSDtfsCounter, 377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=4, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 357 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1367 NumberOfCodeBlocks, 1367 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 970 ConstructedInterpolants, 0 QuantifiedInterpolants, 1804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 8700/8700 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-24 09:09:41,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-8.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1f77d3fa5e179feeb79449d942d251fd79b5fcf3b2d3e183583549dc44656dd2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:09:44,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:09:44,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:09:44,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:09:44,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:09:44,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:09:44,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:09:44,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:09:44,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:09:44,339 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:09:44,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:09:44,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:09:44,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:09:44,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:09:44,340 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:09:44,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:09:44,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:09:44,341 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:09:44,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:09:44,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:09:44,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:09:44,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:09:44,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:09:44,345 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:09:44,345 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:09:44,345 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:09:44,346 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:09:44,346 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:09:44,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:09:44,347 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:09:44,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:09:44,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:09:44,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:09:44,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:09:44,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:09:44,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:09:44,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:09:44,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:09:44,349 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:09:44,350 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:09:44,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:09:44,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:09:44,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:09:44,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:09:44,351 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:09:44,352 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/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/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 -> 1f77d3fa5e179feeb79449d942d251fd79b5fcf3b2d3e183583549dc44656dd2 [2024-10-24 09:09:44,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:09:44,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:09:44,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:09:44,669 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:09:44,670 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:09:44,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-8.i [2024-10-24 09:09:46,203 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:09:46,402 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:09:46,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-8.i [2024-10-24 09:09:46,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf8445b5/f247d25e5a3741f88f54ecb4797f4b0c/FLAG0a4a9e9ba [2024-10-24 09:09:46,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf8445b5/f247d25e5a3741f88f54ecb4797f4b0c [2024-10-24 09:09:46,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:09:46,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:09:46,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:09:46,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:09:46,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:09:46,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:09:46" (1/1) ... [2024-10-24 09:09:46,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@86b29e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:46, skipping insertion in model container [2024-10-24 09:09:46,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:09:46" (1/1) ... [2024-10-24 09:09:46,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:09:46,655 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_loopvsstraightlinecode_100-1loop_file-8.i[915,928] [2024-10-24 09:09:46,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:09:46,767 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:09:46,780 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_loopvsstraightlinecode_100-1loop_file-8.i[915,928] [2024-10-24 09:09:46,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:09:46,864 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:09:46,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:46 WrapperNode [2024-10-24 09:09:46,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:09:46,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:09:46,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:09:46,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:09:46,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:46" (1/1) ... [2024-10-24 09:09:46,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:46" (1/1) ... [2024-10-24 09:09:46,998 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-10-24 09:09:46,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:09:47,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:09:47,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:09:47,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:09:47,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:46" (1/1) ... [2024-10-24 09:09:47,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:46" (1/1) ... [2024-10-24 09:09:47,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:46" (1/1) ... [2024-10-24 09:09:47,081 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-24 09:09:47,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:46" (1/1) ... [2024-10-24 09:09:47,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:46" (1/1) ... [2024-10-24 09:09:47,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:46" (1/1) ... [2024-10-24 09:09:47,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:46" (1/1) ... [2024-10-24 09:09:47,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:46" (1/1) ... [2024-10-24 09:09:47,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:46" (1/1) ... [2024-10-24 09:09:47,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:09:47,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:09:47,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:09:47,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:09:47,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:46" (1/1) ... [2024-10-24 09:09:47,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:09:47,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:09:47,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:09:47,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:09:47,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:09:47,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:09:47,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:09:47,264 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:09:47,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:09:47,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:09:47,363 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:09:47,365 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:09:55,175 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-24 09:09:55,175 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:09:55,237 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:09:55,238 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:09:55,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:09:55 BoogieIcfgContainer [2024-10-24 09:09:55,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:09:55,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:09:55,240 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:09:55,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:09:55,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:09:46" (1/3) ... [2024-10-24 09:09:55,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a289b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:09:55, skipping insertion in model container [2024-10-24 09:09:55,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:09:46" (2/3) ... [2024-10-24 09:09:55,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a289b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:09:55, skipping insertion in model container [2024-10-24 09:09:55,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:09:55" (3/3) ... [2024-10-24 09:09:55,245 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-8.i [2024-10-24 09:09:55,259 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:09:55,259 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:09:55,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:09:55,330 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;@2239601e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:09:55,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:09:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:09:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 09:09:55,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:09:55,351 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:09:55,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:09:55,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:09:55,357 INFO L85 PathProgramCache]: Analyzing trace with hash 88038310, now seen corresponding path program 1 times [2024-10-24 09:09:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:09:55,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60734923] [2024-10-24 09:09:55,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:09:55,373 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-24 09:09:55,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:09:55,374 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-24 09:09:55,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-24 09:09:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:09:55,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:09:55,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:09:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 09:09:56,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:09:56,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:09:56,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60734923] [2024-10-24 09:09:56,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60734923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:09:56,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:09:56,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:09:56,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161564758] [2024-10-24 09:09:56,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:09:56,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:09:56,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:09:56,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:09:56,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:09:56,074 INFO L87 Difference]: Start difference. First operand has 84 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:10:00,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:10:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:10:00,377 INFO L93 Difference]: Finished difference Result 167 states and 299 transitions. [2024-10-24 09:10:00,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:10:00,383 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2024-10-24 09:10:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:10:00,394 INFO L225 Difference]: With dead ends: 167 [2024-10-24 09:10:00,394 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 09:10:00,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 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-24 09:10:00,405 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:10:00,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-24 09:10:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 09:10:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-24 09:10:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:10:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2024-10-24 09:10:00,443 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 188 [2024-10-24 09:10:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:10:00,445 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2024-10-24 09:10:00,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:10:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2024-10-24 09:10:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 09:10:00,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:10:00,448 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:10:00,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-24 09:10:00,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-24 09:10:00,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:10:00,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:10:00,650 INFO L85 PathProgramCache]: Analyzing trace with hash 145296612, now seen corresponding path program 1 times [2024-10-24 09:10:00,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:10:00,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680755413] [2024-10-24 09:10:00,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:10:00,651 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-24 09:10:00,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:10:00,654 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-24 09:10:00,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-24 09:10:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:01,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-24 09:10:01,212 INFO L278 TraceCheckSpWp]: Computing forward predicates...