./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-while_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-while_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 9cd61dabb502d294946ebef32260e71c9554ff9367245793066a81be145185c6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:29:28,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:29:28,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:29:28,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:29:28,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:29:28,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:29:28,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:29:28,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:29:28,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:29:28,180 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:29:28,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:29:28,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:29:28,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:29:28,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:29:28,182 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:29:28,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:29:28,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:29:28,185 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:29:28,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:29:28,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:29:28,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:29:28,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:29:28,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:29:28,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:29:28,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:29:28,191 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:29:28,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:29:28,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:29:28,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:29:28,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:29:28,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:29:28,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:29:28,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:29:28,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:29:28,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:29:28,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:29:28,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:29:28,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:29:28,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:29:28,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:29:28,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:29:28,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:29:28,197 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 -> 9cd61dabb502d294946ebef32260e71c9554ff9367245793066a81be145185c6 [2024-10-14 11:29:28,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:29:28,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:29:28,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:29:28,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:29:28,457 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:29:28,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i [2024-10-14 11:29:29,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:29:30,119 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:29:30,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i [2024-10-14 11:29:30,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054de99f1/7583d08e408f4d619d1264f4b20f35fd/FLAG82e426492 [2024-10-14 11:29:30,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/054de99f1/7583d08e408f4d619d1264f4b20f35fd [2024-10-14 11:29:30,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:29:30,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:29:30,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:29:30,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:29:30,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:29:30,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:29:30" (1/1) ... [2024-10-14 11:29:30,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29004525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:30, skipping insertion in model container [2024-10-14 11:29:30,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:29:30" (1/1) ... [2024-10-14 11:29:30,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:29:30,341 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-while_file-8.i[915,928] [2024-10-14 11:29:30,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:29:30,476 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:29:30,491 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-while_file-8.i[915,928] [2024-10-14 11:29:30,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:29:30,559 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:29:30,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:30 WrapperNode [2024-10-14 11:29:30,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:29:30,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:29:30,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:29:30,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:29:30,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:30" (1/1) ... [2024-10-14 11:29:30,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:30" (1/1) ... [2024-10-14 11:29:30,618 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2024-10-14 11:29:30,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:29:30,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:29:30,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:29:30,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:29:30,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:30" (1/1) ... [2024-10-14 11:29:30,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:30" (1/1) ... [2024-10-14 11:29:30,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:30" (1/1) ... [2024-10-14 11:29:30,662 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-14 11:29:30,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:30" (1/1) ... [2024-10-14 11:29:30,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:30" (1/1) ... [2024-10-14 11:29:30,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:30" (1/1) ... [2024-10-14 11:29:30,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:30" (1/1) ... [2024-10-14 11:29:30,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:30" (1/1) ... [2024-10-14 11:29:30,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:30" (1/1) ... [2024-10-14 11:29:30,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:29:30,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:29:30,692 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:29:30,692 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:29:30,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:30" (1/1) ... [2024-10-14 11:29:30,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:29:30,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:29:30,731 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-14 11:29:30,739 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-14 11:29:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:29:30,792 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:29:30,793 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:29:30,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:29:30,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:29:30,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:29:30,898 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:29:30,900 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:29:31,405 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-14 11:29:31,406 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:29:31,439 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:29:31,439 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:29:31,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:29:31 BoogieIcfgContainer [2024-10-14 11:29:31,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:29:31,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:29:31,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:29:31,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:29:31,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:29:30" (1/3) ... [2024-10-14 11:29:31,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c22e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:29:31, skipping insertion in model container [2024-10-14 11:29:31,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:30" (2/3) ... [2024-10-14 11:29:31,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c22e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:29:31, skipping insertion in model container [2024-10-14 11:29:31,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:29:31" (3/3) ... [2024-10-14 11:29:31,450 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-8.i [2024-10-14 11:29:31,468 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:29:31,468 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:29:31,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:29:31,548 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;@cfd81b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:29:31,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:29:31,553 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-14 11:29:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-14 11:29:31,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:29:31,573 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-14 11:29:31,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:29:31,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:29:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash 386756682, now seen corresponding path program 1 times [2024-10-14 11:29:31,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:29:31,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950015473] [2024-10-14 11:29:31,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:29:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:29:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:29:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:29:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:29:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:29:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:29:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:29:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:29:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:29:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:29:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:29:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:29:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:29:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:29:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:29:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:29:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:29:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:29:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:29:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:29:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:29:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:29:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 11:29:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:29:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 11:29:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:29:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 11:29:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:29:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 11:29:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 11:29:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 11:29:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,489 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-14 11:29:32,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:29:32,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950015473] [2024-10-14 11:29:32,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950015473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:29:32,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:29:32,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:29:32,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666507138] [2024-10-14 11:29:32,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:29:32,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:29:32,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:29:32,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:29:32,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:29:32,530 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-14 11:29:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:29:32,644 INFO L93 Difference]: Finished difference Result 300 states and 545 transitions. [2024-10-14 11:29:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:29:32,648 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-14 11:29:32,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:29:32,664 INFO L225 Difference]: With dead ends: 300 [2024-10-14 11:29:32,665 INFO L226 Difference]: Without dead ends: 199 [2024-10-14 11:29:32,670 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-14 11:29:32,673 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 152 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:29:32,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 432 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:29:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-14 11:29:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 110. [2024-10-14 11:29:32,740 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-14 11:29:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 173 transitions. [2024-10-14 11:29:32,745 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 173 transitions. Word has length 194 [2024-10-14 11:29:32,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:29:32,747 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 173 transitions. [2024-10-14 11:29:32,747 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-14 11:29:32,748 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 173 transitions. [2024-10-14 11:29:32,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-14 11:29:32,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:29:32,756 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-14 11:29:32,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:29:32,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:29:32,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:29:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1087821260, now seen corresponding path program 1 times [2024-10-14 11:29:32,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:29:32,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256992078] [2024-10-14 11:29:32,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:29:32,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:29:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:29:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:29:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:29:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:29:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:29:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:32,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:29:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:29:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:29:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:29:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:29:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:29:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:29:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:29:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:29:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:29:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:29:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:29:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:29:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:29:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:29:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:29:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 11:29:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:29:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 11:29:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:29:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 11:29:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:29:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 11:29:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 11:29:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 11:29:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,092 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-14 11:29:33,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:29:33,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256992078] [2024-10-14 11:29:33,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256992078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:29:33,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:29:33,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:29:33,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839465472] [2024-10-14 11:29:33,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:29:33,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:29:33,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:29:33,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:29:33,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:29:33,098 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-14 11:29:33,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:29:33,159 INFO L93 Difference]: Finished difference Result 294 states and 467 transitions. [2024-10-14 11:29:33,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:29:33,160 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-14 11:29:33,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:29:33,167 INFO L225 Difference]: With dead ends: 294 [2024-10-14 11:29:33,167 INFO L226 Difference]: Without dead ends: 185 [2024-10-14 11:29:33,172 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-14 11:29:33,173 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 152 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:29:33,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 383 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:29:33,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-14 11:29:33,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 100. [2024-10-14 11:29:33,193 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-14 11:29:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 156 transitions. [2024-10-14 11:29:33,194 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 156 transitions. Word has length 194 [2024-10-14 11:29:33,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:29:33,198 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 156 transitions. [2024-10-14 11:29:33,198 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-14 11:29:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 156 transitions. [2024-10-14 11:29:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-14 11:29:33,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:29:33,202 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-14 11:29:33,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:29:33,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:29:33,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:29:33,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1994441518, now seen corresponding path program 1 times [2024-10-14 11:29:33,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:29:33,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674248660] [2024-10-14 11:29:33,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:29:33,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:29:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:29:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:29:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:29:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:29:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:29:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:29:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:29:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:29:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:29:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:29:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:29:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:29:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:29:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:29:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:29:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:29:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:29:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:29:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:29:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:29:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:29:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 11:29:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:29:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 11:29:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:29:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 11:29:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:29:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 11:29:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 11:29:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 11:29:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,498 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-14 11:29:33,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:29:33,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674248660] [2024-10-14 11:29:33,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674248660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:29:33,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:29:33,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:29:33,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973285780] [2024-10-14 11:29:33,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:29:33,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:29:33,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:29:33,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:29:33,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:29:33,505 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-14 11:29:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:29:33,590 INFO L93 Difference]: Finished difference Result 298 states and 466 transitions. [2024-10-14 11:29:33,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:29:33,595 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-14 11:29:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:29:33,599 INFO L225 Difference]: With dead ends: 298 [2024-10-14 11:29:33,599 INFO L226 Difference]: Without dead ends: 199 [2024-10-14 11:29:33,600 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-14 11:29:33,601 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 86 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:29:33,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 277 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:29:33,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-14 11:29:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2024-10-14 11:29:33,627 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-14 11:29:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 306 transitions. [2024-10-14 11:29:33,631 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 306 transitions. Word has length 195 [2024-10-14 11:29:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:29:33,632 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 306 transitions. [2024-10-14 11:29:33,632 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-14 11:29:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 306 transitions. [2024-10-14 11:29:33,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-14 11:29:33,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:29:33,636 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-14 11:29:33,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:29:33,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:29:33,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:29:33,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1050487887, now seen corresponding path program 1 times [2024-10-14 11:29:33,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:29:33,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465364005] [2024-10-14 11:29:33,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:29:33,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:29:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:29:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:29:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:29:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:29:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:29:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:29:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:29:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:29:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:29:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:29:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:29:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:29:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:29:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:29:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:29:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:29:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:29:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:29:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:29:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:29:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:29:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 11:29:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:29:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 11:29:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:29:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 11:29:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:29:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 11:29:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 11:29:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 11:29:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:33,912 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-14 11:29:33,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:29:33,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465364005] [2024-10-14 11:29:33,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465364005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:29:33,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:29:33,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 11:29:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001449329] [2024-10-14 11:29:33,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:29:33,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 11:29:33,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:29:33,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 11:29:33,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:29:33,915 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-14 11:29:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:29:34,299 INFO L93 Difference]: Finished difference Result 493 states and 767 transitions. [2024-10-14 11:29:34,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:29:34,300 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-14 11:29:34,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:29:34,305 INFO L225 Difference]: With dead ends: 493 [2024-10-14 11:29:34,305 INFO L226 Difference]: Without dead ends: 298 [2024-10-14 11:29:34,306 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-14 11:29:34,307 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 191 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:29:34,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 608 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:29:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-14 11:29:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 208. [2024-10-14 11:29:34,348 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-14 11:29:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 321 transitions. [2024-10-14 11:29:34,354 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 321 transitions. Word has length 196 [2024-10-14 11:29:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:29:34,355 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 321 transitions. [2024-10-14 11:29:34,355 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-14 11:29:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 321 transitions. [2024-10-14 11:29:34,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-14 11:29:34,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:29:34,359 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-14 11:29:34,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:29:34,359 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:29:34,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:29:34,360 INFO L85 PathProgramCache]: Analyzing trace with hash 463681873, now seen corresponding path program 1 times [2024-10-14 11:29:34,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:29:34,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354519995] [2024-10-14 11:29:34,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:29:34,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:29:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:29:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:29:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:29:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:29:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:29:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:29:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:29:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:29:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:29:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:29:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:29:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:29:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:29:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:29:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:29:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:29:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:29:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:29:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:29:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:29:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:29:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 11:29:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:29:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 11:29:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:29:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 11:29:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:29:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 11:29:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 11:29:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 11:29:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:34,590 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-14 11:29:34,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:29:34,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354519995] [2024-10-14 11:29:34,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354519995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:29:34,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:29:34,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:29:34,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384377098] [2024-10-14 11:29:34,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:29:34,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:29:34,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:29:34,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:29:34,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:29:34,594 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-14 11:29:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:29:34,892 INFO L93 Difference]: Finished difference Result 493 states and 766 transitions. [2024-10-14 11:29:34,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:29:34,893 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-14 11:29:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:29:34,897 INFO L225 Difference]: With dead ends: 493 [2024-10-14 11:29:34,897 INFO L226 Difference]: Without dead ends: 286 [2024-10-14 11:29:34,898 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-14 11:29:34,899 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 171 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:29:34,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 488 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:29:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-14 11:29:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 196. [2024-10-14 11:29:34,916 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-14 11:29:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 304 transitions. [2024-10-14 11:29:34,918 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 304 transitions. Word has length 196 [2024-10-14 11:29:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:29:34,919 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 304 transitions. [2024-10-14 11:29:34,919 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-14 11:29:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 304 transitions. [2024-10-14 11:29:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-14 11:29:34,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:29:34,921 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-14 11:29:34,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 11:29:34,921 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:29:34,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:29:34,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1936274770, now seen corresponding path program 1 times [2024-10-14 11:29:34,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:29:34,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77696250] [2024-10-14 11:29:34,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:29:34,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:29:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:29:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:29:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 11:29:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:29:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:29:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:29:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:29:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:29:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:29:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:29:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:29:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:29:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:29:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:29:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:29:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:29:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:29:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:29:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:29:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 11:29:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:29:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 11:29:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 11:29:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 11:29:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 11:29:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 11:29:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 11:29:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-14 11:29:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 11:29:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-14 11:29:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:35,138 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-14 11:29:35,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:29:35,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77696250] [2024-10-14 11:29:35,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77696250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:29:35,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:29:35,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:29:35,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71243569] [2024-10-14 11:29:35,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:29:35,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:29:35,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:29:35,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:29:35,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:29:35,142 INFO L87 Difference]: Start difference. First operand 196 states and 304 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-14 11:29:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:29:35,321 INFO L93 Difference]: Finished difference Result 512 states and 797 transitions. [2024-10-14 11:29:35,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:29:35,321 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-14 11:29:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:29:35,326 INFO L225 Difference]: With dead ends: 512 [2024-10-14 11:29:35,326 INFO L226 Difference]: Without dead ends: 413 [2024-10-14 11:29:35,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:29:35,328 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 210 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:29:35,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 458 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:29:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-14 11:29:35,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 203. [2024-10-14 11:29:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 140 states have internal predecessors, (195), 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-14 11:29:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 315 transitions. [2024-10-14 11:29:35,352 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 315 transitions. Word has length 196 [2024-10-14 11:29:35,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:29:35,352 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 315 transitions. [2024-10-14 11:29:35,353 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-14 11:29:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 315 transitions. [2024-10-14 11:29:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-14 11:29:35,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:29:35,354 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-14 11:29:35,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 11:29:35,355 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:29:35,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:29:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash -130836436, now seen corresponding path program 1 times [2024-10-14 11:29:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:29:35,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912200807] [2024-10-14 11:29:35,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:29:35,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:29:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 11:29:35,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2086883284] [2024-10-14 11:29:35,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:29:35,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:29:35,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:29:35,512 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-14 11:29:35,513 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-14 11:29:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:29:35,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:29:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:29:35,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:29:35,910 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:29:35,911 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:29:35,935 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-14 11:29:36,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:29:36,117 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:29:36,260 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:29:36,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:29:36 BoogieIcfgContainer [2024-10-14 11:29:36,265 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:29:36,265 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:29:36,265 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:29:36,265 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:29:36,266 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:29:31" (3/4) ... [2024-10-14 11:29:36,268 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:29:36,269 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:29:36,269 INFO L158 Benchmark]: Toolchain (without parser) took 6121.12ms. Allocated memory was 180.4MB in the beginning and 274.7MB in the end (delta: 94.4MB). Free memory was 124.7MB in the beginning and 80.8MB in the end (delta: 43.9MB). Peak memory consumption was 140.2MB. Max. memory is 16.1GB. [2024-10-14 11:29:36,269 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 180.4MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:29:36,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.15ms. Allocated memory is still 180.4MB. Free memory was 124.7MB in the beginning and 106.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 11:29:36,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.77ms. Allocated memory is still 180.4MB. Free memory was 106.7MB in the beginning and 102.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:29:36,270 INFO L158 Benchmark]: Boogie Preprocessor took 71.40ms. Allocated memory is still 180.4MB. Free memory was 102.5MB in the beginning and 97.1MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 11:29:36,270 INFO L158 Benchmark]: RCFGBuilder took 747.16ms. Allocated memory is still 180.4MB. Free memory was 96.7MB in the beginning and 63.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 11:29:36,271 INFO L158 Benchmark]: TraceAbstraction took 4820.77ms. Allocated memory was 180.4MB in the beginning and 274.7MB in the end (delta: 94.4MB). Free memory was 62.7MB in the beginning and 81.9MB in the end (delta: -19.2MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. [2024-10-14 11:29:36,271 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 274.7MB. Free memory was 81.9MB in the beginning and 80.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:29:36,272 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.18ms. Allocated memory is still 180.4MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.15ms. Allocated memory is still 180.4MB. Free memory was 124.7MB in the beginning and 106.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.77ms. Allocated memory is still 180.4MB. Free memory was 106.7MB in the beginning and 102.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.40ms. Allocated memory is still 180.4MB. Free memory was 102.5MB in the beginning and 97.1MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 747.16ms. Allocated memory is still 180.4MB. Free memory was 96.7MB in the beginning and 63.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4820.77ms. Allocated memory was 180.4MB in the beginning and 274.7MB in the end (delta: 94.4MB). Free memory was 62.7MB in the beginning and 81.9MB in the end (delta: -19.2MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 274.7MB. Free memory was 81.9MB in the beginning and 80.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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] COND TRUE 1 [L200] 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 [L200] RET updateLastVariables() [L201] 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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=1073741823] [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=-255, 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=1073741823] [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=-255, 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=1073741823] [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=-255, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, 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=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L201] RET updateVariables() [L202] 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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=1073741823, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=1073741823, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=1073741823, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [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=1073741823, 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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [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=1073741823, 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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [L202] RET step() [L203] 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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [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) ; [L203] RET, EXPR property() [L203] 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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [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=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 7, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 962 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 962 mSDsluCounter, 2646 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1153 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 486 IncrementalHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 1493 mSDtfsCounter, 486 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=4, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 567 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1563 NumberOfCodeBlocks, 1563 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1165 ConstructedInterpolants, 0 QuantifiedInterpolants, 2054 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 10440/10440 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-14 11:29:36,316 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-while_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 9cd61dabb502d294946ebef32260e71c9554ff9367245793066a81be145185c6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:29:38,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:29:38,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:29:38,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:29:38,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:29:38,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:29:38,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:29:38,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:29:38,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:29:38,593 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:29:38,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:29:38,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:29:38,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:29:38,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:29:38,595 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:29:38,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:29:38,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:29:38,596 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:29:38,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:29:38,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:29:38,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:29:38,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:29:38,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:29:38,603 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:29:38,603 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:29:38,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:29:38,604 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:29:38,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:29:38,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:29:38,605 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:29:38,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:29:38,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:29:38,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:29:38,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:29:38,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:29:38,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:29:38,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:29:38,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:29:38,608 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:29:38,608 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:29:38,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:29:38,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:29:38,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:29:38,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:29:38,609 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:29:38,610 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 -> 9cd61dabb502d294946ebef32260e71c9554ff9367245793066a81be145185c6 [2024-10-14 11:29:38,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:29:38,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:29:38,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:29:38,934 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:29:38,935 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:29:38,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i [2024-10-14 11:29:40,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:29:40,709 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:29:40,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i [2024-10-14 11:29:40,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f8784b49/87c78e81a49347f981a486e4d7138749/FLAGe25ea8a51 [2024-10-14 11:29:40,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f8784b49/87c78e81a49347f981a486e4d7138749 [2024-10-14 11:29:40,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:29:40,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:29:40,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:29:40,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:29:40,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:29:40,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:29:40" (1/1) ... [2024-10-14 11:29:40,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b931a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:40, skipping insertion in model container [2024-10-14 11:29:40,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:29:40" (1/1) ... [2024-10-14 11:29:40,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:29:40,960 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-while_file-8.i[915,928] [2024-10-14 11:29:41,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:29:41,081 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:29:41,094 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-while_file-8.i[915,928] [2024-10-14 11:29:41,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:29:41,166 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:29:41,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:41 WrapperNode [2024-10-14 11:29:41,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:29:41,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:29:41,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:29:41,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:29:41,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:41" (1/1) ... [2024-10-14 11:29:41,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:41" (1/1) ... [2024-10-14 11:29:41,226 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-10-14 11:29:41,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:29:41,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:29:41,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:29:41,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:29:41,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:41" (1/1) ... [2024-10-14 11:29:41,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:41" (1/1) ... [2024-10-14 11:29:41,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:41" (1/1) ... [2024-10-14 11:29:41,265 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-14 11:29:41,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:41" (1/1) ... [2024-10-14 11:29:41,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:41" (1/1) ... [2024-10-14 11:29:41,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:41" (1/1) ... [2024-10-14 11:29:41,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:41" (1/1) ... [2024-10-14 11:29:41,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:41" (1/1) ... [2024-10-14 11:29:41,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:41" (1/1) ... [2024-10-14 11:29:41,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:29:41,309 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:29:41,310 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:29:41,310 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:29:41,310 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:41" (1/1) ... [2024-10-14 11:29:41,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:29:41,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:29:41,338 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-14 11:29:41,342 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-14 11:29:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:29:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:29:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:29:41,374 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:29:41,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:29:41,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:29:41,457 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:29:41,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:29:48,274 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-14 11:29:48,275 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:29:48,321 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:29:48,321 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:29:48,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:29:48 BoogieIcfgContainer [2024-10-14 11:29:48,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:29:48,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:29:48,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:29:48,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:29:48,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:29:40" (1/3) ... [2024-10-14 11:29:48,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b081a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:29:48, skipping insertion in model container [2024-10-14 11:29:48,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:29:41" (2/3) ... [2024-10-14 11:29:48,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b081a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:29:48, skipping insertion in model container [2024-10-14 11:29:48,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:29:48" (3/3) ... [2024-10-14 11:29:48,332 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-8.i [2024-10-14 11:29:48,348 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:29:48,349 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:29:48,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:29:48,424 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;@5b12c0b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:29:48,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:29:48,428 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-14 11:29:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 11:29:48,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:29:48,445 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-14 11:29:48,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:29:48,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:29:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash -131504856, now seen corresponding path program 1 times [2024-10-14 11:29:48,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:29:48,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213002167] [2024-10-14 11:29:48,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:29:48,469 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-14 11:29:48,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:29:48,473 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-14 11:29:48,477 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-14 11:29:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:49,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:29:49,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:29:49,165 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-14 11:29:49,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:29:49,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:29:49,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213002167] [2024-10-14 11:29:49,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213002167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:29:49,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:29:49,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:29:49,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693553031] [2024-10-14 11:29:49,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:29:49,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:29:49,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:29:49,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:29:49,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:29:49,209 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-14 11:29:53,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:29:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:29:53,409 INFO L93 Difference]: Finished difference Result 165 states and 298 transitions. [2024-10-14 11:29:53,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:29:53,457 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-14 11:29:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:29:53,465 INFO L225 Difference]: With dead ends: 165 [2024-10-14 11:29:53,465 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 11:29:53,469 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-14 11:29:53,472 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:29:53,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 11:29:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 11:29:53,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-14 11:29:53,539 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-14 11:29:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2024-10-14 11:29:53,546 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 188 [2024-10-14 11:29:53,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:29:53,551 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2024-10-14 11:29:53,552 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-14 11:29:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2024-10-14 11:29:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-14 11:29:53,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:29:53,558 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-14 11:29:53,585 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-14 11:29:53,759 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-14 11:29:53,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:29:53,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:29:53,760 INFO L85 PathProgramCache]: Analyzing trace with hash -74246554, now seen corresponding path program 1 times [2024-10-14 11:29:53,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:29:53,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001068070] [2024-10-14 11:29:53,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:29:53,763 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-14 11:29:53,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:29:53,765 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-14 11:29:53,766 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-14 11:29:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:29:54,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-14 11:29:54,353 INFO L278 TraceCheckSpWp]: Computing forward predicates...