./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-86.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ef7d6f35f9da5e5ec239077d04f7e947dbd6ee5ea9a37dd2f0c1d8f80d29a4c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:11:19,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:11:19,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:11:19,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:11:19,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:11:19,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:11:19,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:11:19,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:11:19,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:11:19,294 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:11:19,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:11:19,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:11:19,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:11:19,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:11:19,299 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:11:19,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:11:19,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:11:19,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:11:19,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:11:19,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:11:19,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:11:19,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:11:19,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:11:19,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:11:19,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:11:19,302 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:11:19,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:11:19,302 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:11:19,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:11:19,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:11:19,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:11:19,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:11:19,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:11:19,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:11:19,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:11:19,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:11:19,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:11:19,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:11:19,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:11:19,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:11:19,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:11:19,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:11:19,307 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ef7d6f35f9da5e5ec239077d04f7e947dbd6ee5ea9a37dd2f0c1d8f80d29a4c [2024-10-11 11:11:19,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:11:19,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:11:19,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:11:19,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:11:19,571 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:11:19,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-86.i [2024-10-11 11:11:20,940 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:11:21,144 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:11:21,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-86.i [2024-10-11 11:11:21,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/51cc478de/b3f6d96ea31b421d97f82af5644662fb/FLAGe7024dd6f [2024-10-11 11:11:21,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/51cc478de/b3f6d96ea31b421d97f82af5644662fb [2024-10-11 11:11:21,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:11:21,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:11:21,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:11:21,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:11:21,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:11:21,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:11:21" (1/1) ... [2024-10-11 11:11:21,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed8dce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:21, skipping insertion in model container [2024-10-11 11:11:21,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:11:21" (1/1) ... [2024-10-11 11:11:21,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:11:21,415 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-86.i[916,929] [2024-10-11 11:11:21,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:11:21,555 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:11:21,568 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-86.i[916,929] [2024-10-11 11:11:21,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:11:21,618 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:11:21,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:21 WrapperNode [2024-10-11 11:11:21,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:11:21,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:11:21,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:11:21,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:11:21,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:21" (1/1) ... [2024-10-11 11:11:21,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:21" (1/1) ... [2024-10-11 11:11:21,678 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 296 [2024-10-11 11:11:21,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:11:21,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:11:21,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:11:21,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:11:21,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:21" (1/1) ... [2024-10-11 11:11:21,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:21" (1/1) ... [2024-10-11 11:11:21,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:21" (1/1) ... [2024-10-11 11:11:21,714 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:11:21,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:21" (1/1) ... [2024-10-11 11:11:21,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:21" (1/1) ... [2024-10-11 11:11:21,725 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:21" (1/1) ... [2024-10-11 11:11:21,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:21" (1/1) ... [2024-10-11 11:11:21,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:21" (1/1) ... [2024-10-11 11:11:21,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:21" (1/1) ... [2024-10-11 11:11:21,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:11:21,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:11:21,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:11:21,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:11:21,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:21" (1/1) ... [2024-10-11 11:11:21,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:11:21,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:11:21,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:11:21,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:11:21,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:11:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:11:21,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:11:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:11:21,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:11:21,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:11:21,915 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:11:21,917 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:11:22,374 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-11 11:11:22,375 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:11:22,403 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:11:22,404 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:11:22,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:11:22 BoogieIcfgContainer [2024-10-11 11:11:22,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:11:22,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:11:22,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:11:22,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:11:22,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:11:21" (1/3) ... [2024-10-11 11:11:22,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534a2a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:11:22, skipping insertion in model container [2024-10-11 11:11:22,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:21" (2/3) ... [2024-10-11 11:11:22,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534a2a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:11:22, skipping insertion in model container [2024-10-11 11:11:22,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:11:22" (3/3) ... [2024-10-11 11:11:22,412 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-86.i [2024-10-11 11:11:22,426 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:11:22,427 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:11:22,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:11:22,482 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;@2b0ee341, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:11:22,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:11:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:11:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 11:11:22,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:22,500 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:22,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:22,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:22,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1360301404, now seen corresponding path program 1 times [2024-10-11 11:11:22,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:11:22,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064094594] [2024-10-11 11:11:22,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:22,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:11:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:11:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:11:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:11:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:11:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:11:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:11:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:11:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:11:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:11:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:11:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:11:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:11:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:11:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:11:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:11:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:11:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:11:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:11:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:11:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:11:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:11:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:11:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:11:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:11:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:11:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 11:11:22,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:11:22,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064094594] [2024-10-11 11:11:22,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064094594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:11:22,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:11:22,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:11:22,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405731447] [2024-10-11 11:11:22,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:11:22,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:11:22,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:11:22,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:11:22,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:11:22,916 INFO L87 Difference]: Start difference. First operand has 117 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:11:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:11:22,974 INFO L93 Difference]: Finished difference Result 233 states and 386 transitions. [2024-10-11 11:11:22,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:11:22,978 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 177 [2024-10-11 11:11:22,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:11:22,989 INFO L225 Difference]: With dead ends: 233 [2024-10-11 11:11:22,989 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 11:11:22,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:11:22,997 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:11:22,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:11:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 11:11:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-11 11:11:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:11:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 176 transitions. [2024-10-11 11:11:23,112 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 176 transitions. Word has length 177 [2024-10-11 11:11:23,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:11:23,117 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 176 transitions. [2024-10-11 11:11:23,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:11:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 176 transitions. [2024-10-11 11:11:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 11:11:23,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:23,124 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:23,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:11:23,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:23,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:23,128 INFO L85 PathProgramCache]: Analyzing trace with hash -819279002, now seen corresponding path program 1 times [2024-10-11 11:11:23,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:11:23,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486371272] [2024-10-11 11:11:23,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:23,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:11:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:11:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:11:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:11:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:11:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:11:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:11:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:11:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:11:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:11:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:11:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:11:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:11:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:11:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:11:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:11:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:11:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:11:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:11:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:11:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:11:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:11:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:11:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:11:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:11:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:11:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 11:11:23,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:11:23,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486371272] [2024-10-11 11:11:23,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486371272] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:11:23,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838205514] [2024-10-11 11:11:23,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:23,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:11:23,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:11:23,888 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:11:23,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:11:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:24,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 11:11:24,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:11:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 468 proven. 54 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-10-11 11:11:24,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:11:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 11:11:24,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838205514] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:11:24,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:11:24,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-11 11:11:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047633846] [2024-10-11 11:11:24,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:11:24,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 11:11:24,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:11:24,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 11:11:24,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-11 11:11:24,795 INFO L87 Difference]: Start difference. First operand 115 states and 176 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-11 11:11:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:11:25,482 INFO L93 Difference]: Finished difference Result 487 states and 726 transitions. [2024-10-11 11:11:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 11:11:25,483 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 177 [2024-10-11 11:11:25,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:11:25,487 INFO L225 Difference]: With dead ends: 487 [2024-10-11 11:11:25,487 INFO L226 Difference]: Without dead ends: 373 [2024-10-11 11:11:25,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 398 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2024-10-11 11:11:25,489 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 598 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:11:25,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1342 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 11:11:25,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-11 11:11:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 254. [2024-10-11 11:11:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 219 states have (on average 1.4840182648401827) internal successors, (325), 220 states have internal predecessors, (325), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 11:11:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 387 transitions. [2024-10-11 11:11:25,511 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 387 transitions. Word has length 177 [2024-10-11 11:11:25,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:11:25,512 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 387 transitions. [2024-10-11 11:11:25,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-11 11:11:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 387 transitions. [2024-10-11 11:11:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 11:11:25,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:25,515 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:25,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 11:11:25,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:11:25,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:25,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:25,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1692671928, now seen corresponding path program 1 times [2024-10-11 11:11:25,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:11:25,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236743547] [2024-10-11 11:11:25,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:25,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:11:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:11:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:11:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:11:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:11:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:11:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:11:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:11:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:11:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:11:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:11:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:11:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:11:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:11:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:11:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:11:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:11:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:11:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:11:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:11:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:11:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:11:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:11:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:11:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:11:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:11:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 11:11:26,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:11:26,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236743547] [2024-10-11 11:11:26,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236743547] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:11:26,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120522113] [2024-10-11 11:11:26,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:26,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:11:26,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:11:26,816 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:11:26,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:11:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:26,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 11:11:26,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:11:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 676 proven. 42 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-10-11 11:11:28,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:11:29,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120522113] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:11:29,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:11:29,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2024-10-11 11:11:29,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607962014] [2024-10-11 11:11:29,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:11:29,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 11:11:29,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:11:29,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 11:11:29,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1611, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 11:11:29,471 INFO L87 Difference]: Start difference. First operand 254 states and 387 transitions. Second operand has 31 states, 30 states have (on average 3.3) internal successors, (99), 31 states have internal predecessors, (99), 6 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 5 states have call predecessors, (50), 6 states have call successors, (50) [2024-10-11 11:11:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:11:33,856 INFO L93 Difference]: Finished difference Result 2117 states and 3131 transitions. [2024-10-11 11:11:33,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-10-11 11:11:33,857 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.3) internal successors, (99), 31 states have internal predecessors, (99), 6 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 5 states have call predecessors, (50), 6 states have call successors, (50) Word has length 178 [2024-10-11 11:11:33,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:11:33,868 INFO L225 Difference]: With dead ends: 2117 [2024-10-11 11:11:33,869 INFO L226 Difference]: Without dead ends: 1864 [2024-10-11 11:11:33,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1888 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1364, Invalid=6646, Unknown=0, NotChecked=0, Total=8010 [2024-10-11 11:11:33,876 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 4287 mSDsluCounter, 1893 mSDsCounter, 0 mSdLazyCounter, 3175 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4294 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 3476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 3175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:11:33,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4294 Valid, 2006 Invalid, 3476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 3175 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 11:11:33,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2024-10-11 11:11:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1088. [2024-10-11 11:11:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 962 states have (on average 1.4241164241164241) internal successors, (1370), 970 states have internal predecessors, (1370), 102 states have call successors, (102), 23 states have call predecessors, (102), 23 states have return successors, (102), 94 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-11 11:11:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1574 transitions. [2024-10-11 11:11:33,964 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1574 transitions. Word has length 178 [2024-10-11 11:11:33,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:11:33,965 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1574 transitions. [2024-10-11 11:11:33,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.3) internal successors, (99), 31 states have internal predecessors, (99), 6 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 5 states have call predecessors, (50), 6 states have call successors, (50) [2024-10-11 11:11:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1574 transitions. [2024-10-11 11:11:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 11:11:33,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:33,969 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:33,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 11:11:34,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:11:34,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:34,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:34,177 INFO L85 PathProgramCache]: Analyzing trace with hash 517278897, now seen corresponding path program 1 times [2024-10-11 11:11:34,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:11:34,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296356945] [2024-10-11 11:11:34,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:34,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:11:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:11:34,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:11:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:11:34,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:11:34,323 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:11:34,323 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:11:34,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:11:34,327 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 11:11:34,418 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:11:34,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:11:34 BoogieIcfgContainer [2024-10-11 11:11:34,422 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:11:34,423 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:11:34,424 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:11:34,424 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:11:34,424 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:11:22" (3/4) ... [2024-10-11 11:11:34,426 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:11:34,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:11:34,428 INFO L158 Benchmark]: Toolchain (without parser) took 13253.42ms. Allocated memory was 146.8MB in the beginning and 346.0MB in the end (delta: 199.2MB). Free memory was 76.2MB in the beginning and 154.8MB in the end (delta: -78.6MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. [2024-10-11 11:11:34,429 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:11:34,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.67ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 76.0MB in the beginning and 178.9MB in the end (delta: -102.8MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-10-11 11:11:34,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.58ms. Allocated memory is still 211.8MB. Free memory was 178.9MB in the beginning and 174.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:11:34,430 INFO L158 Benchmark]: Boogie Preprocessor took 59.62ms. Allocated memory is still 211.8MB. Free memory was 174.7MB in the beginning and 170.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:11:34,431 INFO L158 Benchmark]: RCFGBuilder took 665.27ms. Allocated memory is still 211.8MB. Free memory was 170.5MB in the beginning and 136.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 11:11:34,431 INFO L158 Benchmark]: TraceAbstraction took 12016.87ms. Allocated memory was 211.8MB in the beginning and 346.0MB in the end (delta: 134.2MB). Free memory was 135.9MB in the beginning and 154.8MB in the end (delta: -19.0MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. [2024-10-11 11:11:34,431 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 346.0MB. Free memory is still 154.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:11:34,432 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.14ms. Allocated memory is still 146.8MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.67ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 76.0MB in the beginning and 178.9MB in the end (delta: -102.8MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.58ms. Allocated memory is still 211.8MB. Free memory was 178.9MB in the beginning and 174.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.62ms. Allocated memory is still 211.8MB. Free memory was 174.7MB in the beginning and 170.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 665.27ms. Allocated memory is still 211.8MB. Free memory was 170.5MB in the beginning and 136.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12016.87ms. Allocated memory was 211.8MB in the beginning and 346.0MB in the end (delta: 134.2MB). Free memory was 135.9MB in the beginning and 154.8MB in the end (delta: -19.0MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 346.0MB. Free memory is still 154.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someUnaryDOUBLEoperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryArithmeticFLOAToperation at line 74. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 0; [L23] signed char var_1_6 = 32; [L24] signed char var_1_7 = 32; [L25] signed char var_1_8 = 1; [L26] signed char var_1_9 = 32; [L27] signed char var_1_10 = 5; [L28] signed char var_1_11 = 2; [L29] signed char var_1_12 = -100; [L30] unsigned char var_1_13 = 0; [L31] unsigned char var_1_14 = 0; [L32] signed short int var_1_15 = 256; [L33] float var_1_16 = 15.918; [L34] float var_1_17 = 0.6; [L35] float var_1_18 = 100000000.75; [L36] float var_1_19 = 16.5; [L37] float var_1_20 = 8.75; [L38] unsigned short int var_1_22 = 10; [L39] float var_1_23 = -0.6; [L40] float var_1_24 = 25.75; [L41] float var_1_25 = 127.75; [L42] signed short int var_1_26 = -5; [L43] unsigned char var_1_27 = 1; [L44] unsigned char var_1_28 = 1; [L45] unsigned char var_1_29 = 1; [L46] signed short int var_1_30 = -8; [L47] signed long int var_1_31 = -8; [L48] unsigned char var_1_32 = 0; [L49] float last_1_var_1_16 = 15.918; [L50] unsigned char last_1_var_1_27 = 1; [L51] signed short int last_1_var_1_30 = -8; [L192] isInitial = 1 [L193] FCALL initially() [L194] int k_loop; [L195] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=32, var_1_7=32, var_1_8=1, var_1_9=32] [L195] COND TRUE k_loop < 1 [L196] CALL updateLastVariables() [L183] last_1_var_1_16 = var_1_16 [L184] last_1_var_1_27 = var_1_27 [L185] last_1_var_1_30 = var_1_30 [L196] RET updateLastVariables() [L197] CALL updateVariables() [L141] var_1_6 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=32, var_1_8=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=32, var_1_8=1, var_1_9=32] [L142] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=32, var_1_8=1, var_1_9=32] [L143] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=32, var_1_8=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=32, var_1_8=1, var_1_9=32] [L143] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=32, var_1_8=1, var_1_9=32] [L144] var_1_7 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=32] [L145] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=32] [L146] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=32] [L146] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=32] [L147] var_1_8 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_8 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=32] [L148] RET assume_abort_if_not(var_1_8 >= -63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=32] [L149] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=32] [L149] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=32] [L150] var_1_9 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=5, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L153] var_1_10 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L154] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L155] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=2, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L156] var_1_11 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=-100, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L159] var_1_12 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L160] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L161] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L162] var_1_14 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L164] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L164] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_17=3/5, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L165] var_1_17 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L166] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_18=400000003/4, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L167] var_1_18 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L168] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_19=33/2, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L169] var_1_19 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L170] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_24=103/4, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L171] var_1_24 = __VERIFIER_nondet_float() [L172] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L172] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_25=511/4, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L173] var_1_25 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_25 >= 0.0F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L174] RET assume_abort_if_not((var_1_25 >= 0.0F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L175] var_1_28 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L176] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L177] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L178] var_1_29 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L179] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L180] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L180] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L197] RET updateVariables() [L198] CALL step() [L55] EXPR var_1_7 << var_1_6 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L55] COND FALSE !(10u <= (var_1_7 << var_1_6)) [L62] EXPR -100000 >> var_1_8 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=256, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L62] signed long int stepLocal_0 = -100000 >> var_1_8; [L63] COND TRUE stepLocal_0 < var_1_9 [L64] var_1_15 = ((4 - var_1_11) + (-1 + last_1_var_1_30)) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L72] EXPR var_1_6 >> var_1_15 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L72] signed long int stepLocal_2 = var_1_6 >> var_1_15; [L73] COND TRUE stepLocal_2 >= var_1_8 [L74] var_1_23 = (var_1_24 - var_1_25) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=10, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L76] COND FALSE !(\read(var_1_13)) [L79] var_1_22 = ((var_1_7 + 8) + var_1_9) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=-8, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L81] var_1_31 = var_1_8 [L82] var_1_32 = 0 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L83] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L88] signed char stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_3=0, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L89] EXPR var_1_10 >> var_1_12 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_3=0, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=-5, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L89] COND TRUE stepLocal_3 < (var_1_10 >> var_1_12) [L90] var_1_26 = (var_1_9 + var_1_7) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L98] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_1=0, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=7959/500, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L99] COND FALSE !(((8 * var_1_15) > var_1_6) || stepLocal_1) [L104] var_1_16 = var_1_19 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L106] signed char stepLocal_5 = var_1_9; VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, stepLocal_5=0, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L107] COND FALSE !(stepLocal_5 < var_1_15) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L110] COND FALSE !((var_1_16 / 1.5) < 8.725) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=0, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L116] COND FALSE !(! (var_1_32 || (var_1_16 > var_1_23))) [L127] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=63, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L129] EXPR var_1_26 & var_1_11 VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=63, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L129] signed long int stepLocal_4 = var_1_26 & var_1_11; [L130] COND TRUE var_1_10 > stepLocal_4 [L131] var_1_27 = (var_1_28 && (! (! var_1_29))) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=63, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L198] RET step() [L199] CALL, EXPR property() [L188] EXPR ((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=63, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L188] EXPR (((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10)))) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=63, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L188] EXPR (((((((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10))))) && ((((8 * var_1_15) > var_1_6) || var_1_13) ? ((last_1_var_1_16 < var_1_20) ? (var_1_16 == ((float) ((((((var_1_17 + var_1_18) + 4.5f)) < (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19))))) ? (((var_1_17 + var_1_18) + 4.5f)) : (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19)))))))) : 1) : (var_1_16 == ((float) var_1_19)))) && (var_1_13 ? (var_1_32 ? (var_1_20 == ((float) (((((var_1_17 + var_1_18)) > (var_1_19)) ? ((var_1_17 + var_1_18)) : (var_1_19))))) : 1) : 1)) && (var_1_13 ? (var_1_22 == ((unsigned short int) ((((var_1_10) > (var_1_9)) ? (var_1_10) : (var_1_9))))) : (var_1_22 == ((unsigned short int) ((var_1_7 + 8) + var_1_9))))) && (((var_1_6 >> var_1_15) >= var_1_8) ? (var_1_23 == ((float) (var_1_24 - var_1_25))) : 1) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=63, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L188] EXPR ((((((((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10))))) && ((((8 * var_1_15) > var_1_6) || var_1_13) ? ((last_1_var_1_16 < var_1_20) ? (var_1_16 == ((float) ((((((var_1_17 + var_1_18) + 4.5f)) < (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19))))) ? (((var_1_17 + var_1_18) + 4.5f)) : (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19)))))))) : 1) : (var_1_16 == ((float) var_1_19)))) && (var_1_13 ? (var_1_32 ? (var_1_20 == ((float) (((((var_1_17 + var_1_18)) > (var_1_19)) ? ((var_1_17 + var_1_18)) : (var_1_19))))) : 1) : 1)) && (var_1_13 ? (var_1_22 == ((unsigned short int) ((((var_1_10) > (var_1_9)) ? (var_1_10) : (var_1_9))))) : (var_1_22 == ((unsigned short int) ((var_1_7 + 8) + var_1_9))))) && (((var_1_6 >> var_1_15) >= var_1_8) ? (var_1_23 == ((float) (var_1_24 - var_1_25))) : 1)) && ((var_1_11 < (var_1_10 >> var_1_12)) ? (var_1_26 == ((signed short int) (var_1_9 + var_1_7))) : ((var_1_20 != var_1_23) ? (var_1_26 == ((signed short int) ((((var_1_10) < (var_1_7)) ? (var_1_10) : (var_1_7))))) : (var_1_26 == ((signed short int) var_1_9)))) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=63, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L188] EXPR (((((((((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10))))) && ((((8 * var_1_15) > var_1_6) || var_1_13) ? ((last_1_var_1_16 < var_1_20) ? (var_1_16 == ((float) ((((((var_1_17 + var_1_18) + 4.5f)) < (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19))))) ? (((var_1_17 + var_1_18) + 4.5f)) : (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19)))))))) : 1) : (var_1_16 == ((float) var_1_19)))) && (var_1_13 ? (var_1_32 ? (var_1_20 == ((float) (((((var_1_17 + var_1_18)) > (var_1_19)) ? ((var_1_17 + var_1_18)) : (var_1_19))))) : 1) : 1)) && (var_1_13 ? (var_1_22 == ((unsigned short int) ((((var_1_10) > (var_1_9)) ? (var_1_10) : (var_1_9))))) : (var_1_22 == ((unsigned short int) ((var_1_7 + 8) + var_1_9))))) && (((var_1_6 >> var_1_15) >= var_1_8) ? (var_1_23 == ((float) (var_1_24 - var_1_25))) : 1)) && ((var_1_11 < (var_1_10 >> var_1_12)) ? (var_1_26 == ((signed short int) (var_1_9 + var_1_7))) : ((var_1_20 != var_1_23) ? (var_1_26 == ((signed short int) ((((var_1_10) < (var_1_7)) ? (var_1_10) : (var_1_7))))) : (var_1_26 == ((signed short int) var_1_9))))) && ((var_1_10 > (var_1_26 & var_1_11)) ? (var_1_27 == ((unsigned char) (var_1_28 && (! (! var_1_29))))) : ((! var_1_13) ? (var_1_27 == ((unsigned char) var_1_29)) : (var_1_27 == ((unsigned char) var_1_14)))) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=63, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L188-L189] return ((((((((((((! (var_1_32 || (var_1_16 > var_1_23))) ? (var_1_32 ? (var_1_13 ? (var_1_1 == ((signed char) (((((var_1_6 - var_1_7) + var_1_8) < 0 ) ? -((var_1_6 - var_1_7) + var_1_8) : ((var_1_6 - var_1_7) + var_1_8))))) : (var_1_1 == ((signed char) (((((var_1_7 - var_1_6)) < (((var_1_9 + var_1_10) - var_1_11))) ? ((var_1_7 - var_1_6)) : (((var_1_9 + var_1_10) - var_1_11))))))) : (var_1_1 == ((signed char) var_1_12))) : (var_1_1 == ((signed char) var_1_10))) && ((10u <= (var_1_7 << var_1_6)) ? (last_1_var_1_27 ? (var_1_13 == ((unsigned char) (last_1_var_1_27 && var_1_14))) : (var_1_13 == ((unsigned char) (! var_1_14)))) : 1)) && (((-100000 >> var_1_8) < var_1_9) ? (var_1_15 == ((signed short int) ((4 - var_1_11) + (-1 + last_1_var_1_30)))) : (last_1_var_1_27 ? (var_1_15 == ((signed short int) var_1_6)) : (var_1_15 == ((signed short int) var_1_10))))) && ((((8 * var_1_15) > var_1_6) || var_1_13) ? ((last_1_var_1_16 < var_1_20) ? (var_1_16 == ((float) ((((((var_1_17 + var_1_18) + 4.5f)) < (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19))))) ? (((var_1_17 + var_1_18) + 4.5f)) : (((((256.25f) < (var_1_19)) ? (256.25f) : (var_1_19)))))))) : 1) : (var_1_16 == ((float) var_1_19)))) && (var_1_13 ? (var_1_32 ? (var_1_20 == ((float) (((((var_1_17 + var_1_18)) > (var_1_19)) ? ((var_1_17 + var_1_18)) : (var_1_19))))) : 1) : 1)) && (var_1_13 ? (var_1_22 == ((unsigned short int) ((((var_1_10) > (var_1_9)) ? (var_1_10) : (var_1_9))))) : (var_1_22 == ((unsigned short int) ((var_1_7 + 8) + var_1_9))))) && (((var_1_6 >> var_1_15) >= var_1_8) ? (var_1_23 == ((float) (var_1_24 - var_1_25))) : 1)) && ((var_1_11 < (var_1_10 >> var_1_12)) ? (var_1_26 == ((signed short int) (var_1_9 + var_1_7))) : ((var_1_20 != var_1_23) ? (var_1_26 == ((signed short int) ((((var_1_10) < (var_1_7)) ? (var_1_10) : (var_1_7))))) : (var_1_26 == ((signed short int) var_1_9))))) && ((var_1_10 > (var_1_26 & var_1_11)) ? (var_1_27 == ((unsigned char) (var_1_28 && (! (! var_1_29))))) : ((! var_1_13) ? (var_1_27 == ((unsigned char) var_1_29)) : (var_1_27 == ((unsigned char) var_1_14))))) && ((var_1_9 < var_1_15) ? (var_1_30 == ((signed short int) (var_1_10 - ((((var_1_9) > (var_1_11)) ? (var_1_9) : (var_1_11)))))) : (((var_1_16 / 1.5) < 8.725) ? ((var_1_20 != (((((- var_1_20)) < (var_1_16)) ? ((- var_1_20)) : (var_1_16)))) ? (var_1_30 == ((signed short int) (var_1_8 + 128))) : 1) : 1))) && (var_1_31 == ((signed long int) var_1_8))) && (var_1_32 == ((unsigned char) 0)) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=63, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=7959/500, last_1_var_1_27=1, last_1_var_1_30=-8, var_1_10=63, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-5, var_1_16=100000005, var_1_19=100000005, var_1_1=63, var_1_20=35/4, var_1_22=8, var_1_26=0, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=-8, var_1_31=0, var_1_32=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4904 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4885 mSDsluCounter, 3521 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3053 mSDsCounter, 347 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3931 IncrementalHoareTripleChecker+Invalid, 4278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 347 mSolverCounterUnsat, 468 mSDtfsCounter, 3931 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 916 GetRequests, 800 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1088occurred in iteration=3, InterpolantAutomatonStates: 78, 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, 3 MinimizatonAttempts, 895 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1065 NumberOfCodeBlocks, 1065 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1058 ConstructedInterpolants, 0 QuantifiedInterpolants, 5240 SizeOfPredicates, 12 NumberOfNonLiveVariables, 829 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 6954/7200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:11:34,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-86.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ef7d6f35f9da5e5ec239077d04f7e947dbd6ee5ea9a37dd2f0c1d8f80d29a4c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:11:36,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:11:36,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:11:36,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:11:36,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:11:36,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:11:36,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:11:36,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:11:36,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:11:36,874 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:11:36,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:11:36,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:11:36,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:11:36,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:11:36,875 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:11:36,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:11:36,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:11:36,876 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:11:36,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:11:36,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:11:36,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:11:36,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:11:36,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:11:36,884 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:11:36,885 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:11:36,885 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:11:36,885 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:11:36,885 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:11:36,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:11:36,885 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:11:36,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:11:36,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:11:36,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:11:36,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:11:36,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:11:36,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:11:36,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:11:36,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:11:36,887 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:11:36,887 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:11:36,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:11:36,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:11:36,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:11:36,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:11:36,888 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:11:36,889 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ef7d6f35f9da5e5ec239077d04f7e947dbd6ee5ea9a37dd2f0c1d8f80d29a4c [2024-10-11 11:11:37,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:11:37,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:11:37,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:11:37,207 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:11:37,213 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:11:37,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-86.i [2024-10-11 11:11:38,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:11:39,007 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:11:39,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-86.i [2024-10-11 11:11:39,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bbf9bf93f/b22d08b540c5487aaa905238c81ccdae/FLAG419323443 [2024-10-11 11:11:39,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bbf9bf93f/b22d08b540c5487aaa905238c81ccdae [2024-10-11 11:11:39,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:11:39,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:11:39,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:11:39,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:11:39,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:11:39,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:11:39" (1/1) ... [2024-10-11 11:11:39,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60abe7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:39, skipping insertion in model container [2024-10-11 11:11:39,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:11:39" (1/1) ... [2024-10-11 11:11:39,083 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:11:39,243 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-86.i[916,929] [2024-10-11 11:11:39,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:11:39,361 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:11:39,373 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-86.i[916,929] [2024-10-11 11:11:39,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:11:39,452 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:11:39,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:39 WrapperNode [2024-10-11 11:11:39,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:11:39,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:11:39,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:11:39,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:11:39,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:39" (1/1) ... [2024-10-11 11:11:39,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:39" (1/1) ... [2024-10-11 11:11:39,503 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2024-10-11 11:11:39,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:11:39,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:11:39,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:11:39,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:11:39,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:39" (1/1) ... [2024-10-11 11:11:39,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:39" (1/1) ... [2024-10-11 11:11:39,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:39" (1/1) ... [2024-10-11 11:11:39,532 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:11:39,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:39" (1/1) ... [2024-10-11 11:11:39,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:39" (1/1) ... [2024-10-11 11:11:39,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:39" (1/1) ... [2024-10-11 11:11:39,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:39" (1/1) ... [2024-10-11 11:11:39,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:39" (1/1) ... [2024-10-11 11:11:39,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:39" (1/1) ... [2024-10-11 11:11:39,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:11:39,554 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:11:39,554 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:11:39,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:11:39,555 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:39" (1/1) ... [2024-10-11 11:11:39,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:11:39,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:11:39,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:11:39,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:11:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:11:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:11:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:11:39,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:11:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:11:39,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:11:39,704 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:11:39,707 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:11:51,450 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 11:11:51,450 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:11:51,551 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:11:51,557 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:11:51,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:11:51 BoogieIcfgContainer [2024-10-11 11:11:51,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:11:51,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:11:51,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:11:51,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:11:51,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:11:39" (1/3) ... [2024-10-11 11:11:51,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49877d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:11:51, skipping insertion in model container [2024-10-11 11:11:51,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:11:39" (2/3) ... [2024-10-11 11:11:51,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49877d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:11:51, skipping insertion in model container [2024-10-11 11:11:51,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:11:51" (3/3) ... [2024-10-11 11:11:51,572 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-86.i [2024-10-11 11:11:51,604 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:11:51,604 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:11:51,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:11:51,728 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;@70aaa07c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:11:51,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:11:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:11:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 11:11:51,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:51,762 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:51,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:51,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:51,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1658189412, now seen corresponding path program 1 times [2024-10-11 11:11:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:11:51,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691709840] [2024-10-11 11:11:51,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:51,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:11:51,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:11:51,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:11:51,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:11:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:52,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:11:52,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:11:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-10-11 11:11:52,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:11:52,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:11:52,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691709840] [2024-10-11 11:11:52,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691709840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:11:52,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:11:52,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:11:52,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37143598] [2024-10-11 11:11:52,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:11:52,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:11:52,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:11:52,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:11:52,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:11:52,270 INFO L87 Difference]: Start difference. First operand has 80 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:11:56,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:11:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:11:56,559 INFO L93 Difference]: Finished difference Result 159 states and 278 transitions. [2024-10-11 11:11:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:11:56,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2024-10-11 11:11:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:11:56,568 INFO L225 Difference]: With dead ends: 159 [2024-10-11 11:11:56,568 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 11:11:56,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:11:56,572 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:11:56,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 11:11:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 11:11:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 11:11:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:11:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 122 transitions. [2024-10-11 11:11:56,621 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 122 transitions. Word has length 162 [2024-10-11 11:11:56,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:11:56,622 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 122 transitions. [2024-10-11 11:11:56,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 11:11:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 122 transitions. [2024-10-11 11:11:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 11:11:56,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:56,625 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:56,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 11:11:56,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:11:56,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:56,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:56,828 INFO L85 PathProgramCache]: Analyzing trace with hash -118446694, now seen corresponding path program 1 times [2024-10-11 11:11:56,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:11:56,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457808759] [2024-10-11 11:11:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:56,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:11:56,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:11:56,832 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:11:56,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:11:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:57,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:11:57,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:11:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 11:11:59,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:11:59,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:11:59,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457808759] [2024-10-11 11:11:59,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457808759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:11:59,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:11:59,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:11:59,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258151614] [2024-10-11 11:11:59,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:11:59,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:11:59,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:11:59,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:11:59,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:11:59,446 INFO L87 Difference]: Start difference. First operand 78 states and 122 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 11:12:03,707 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-11 11:12:07,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:12:11,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:12:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:12:11,173 INFO L93 Difference]: Finished difference Result 231 states and 362 transitions. [2024-10-11 11:12:11,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:12:11,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 162 [2024-10-11 11:12:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:12:11,178 INFO L225 Difference]: With dead ends: 231 [2024-10-11 11:12:11,178 INFO L226 Difference]: Without dead ends: 154 [2024-10-11 11:12:11,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:12:11,183 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 39 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-10-11 11:12:11,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 220 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 11.7s Time] [2024-10-11 11:12:11,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-11 11:12:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2024-10-11 11:12:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 11:12:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 234 transitions. [2024-10-11 11:12:11,218 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 234 transitions. Word has length 162 [2024-10-11 11:12:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:12:11,219 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 234 transitions. [2024-10-11 11:12:11,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 11:12:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 234 transitions. [2024-10-11 11:12:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 11:12:11,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:12:11,221 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:12:11,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 11:12:11,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:12:11,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:12:11,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:12:11,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1398310372, now seen corresponding path program 1 times [2024-10-11 11:12:11,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:12:11,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695588117] [2024-10-11 11:12:11,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:12:11,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:12:11,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:12:11,426 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:12:11,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 11:12:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:12:11,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 11:12:11,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:12:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 598 proven. 171 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2024-10-11 11:12:23,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:12:25,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:12:25,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695588117] [2024-10-11 11:12:25,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695588117] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:12:25,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [406320359] [2024-10-11 11:12:25,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:12:25,739 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 11:12:25,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 11:12:25,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 11:12:25,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-11 11:12:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:12:27,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 11:12:27,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:12:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 512 proven. 303 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-10-11 11:12:51,513 INFO L311 TraceCheckSpWp]: Computing backward predicates...