./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de3f97de174f82d2dd03abf9cece844345a8c6a06eac52f7ed60428cd6c2c344 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:30:05,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:30:05,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:30:05,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:30:05,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:30:05,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:30:05,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:30:05,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:30:05,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:30:05,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:30:05,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:30:05,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:30:05,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:30:05,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:30:05,732 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:30:05,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:30:05,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:30:05,736 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:30:05,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:30:05,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:30:05,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:30:05,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:30:05,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:30:05,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:30:05,739 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:30:05,739 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:30:05,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:30:05,740 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:30:05,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:30:05,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:30:05,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:30:05,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:30:05,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:30:05,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:30:05,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:30:05,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:30:05,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:30:05,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:30:05,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:30:05,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:30:05,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:30:05,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:30:05,753 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de3f97de174f82d2dd03abf9cece844345a8c6a06eac52f7ed60428cd6c2c344 [2024-10-14 11:30:06,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:30:06,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:30:06,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:30:06,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:30:06,043 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:30:06,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i [2024-10-14 11:30:07,488 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:30:07,711 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:30:07,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i [2024-10-14 11:30:07,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94070ed4/55ef66f74109434e8bbcae062311fc6a/FLAG44e2271d8 [2024-10-14 11:30:07,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94070ed4/55ef66f74109434e8bbcae062311fc6a [2024-10-14 11:30:07,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:30:07,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:30:07,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:30:07,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:30:07,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:30:07,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:30:07" (1/1) ... [2024-10-14 11:30:07,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1139e720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:07, skipping insertion in model container [2024-10-14 11:30:07,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:30:07" (1/1) ... [2024-10-14 11:30:07,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:30:07,935 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i[916,929] [2024-10-14 11:30:08,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:30:08,066 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:30:08,079 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i[916,929] [2024-10-14 11:30:08,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:30:08,156 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:30:08,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:08 WrapperNode [2024-10-14 11:30:08,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:30:08,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:30:08,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:30:08,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:30:08,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:08" (1/1) ... [2024-10-14 11:30:08,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:08" (1/1) ... [2024-10-14 11:30:08,217 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 291 [2024-10-14 11:30:08,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:30:08,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:30:08,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:30:08,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:30:08,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:08" (1/1) ... [2024-10-14 11:30:08,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:08" (1/1) ... [2024-10-14 11:30:08,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:08" (1/1) ... [2024-10-14 11:30:08,258 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:30:08,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:08" (1/1) ... [2024-10-14 11:30:08,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:08" (1/1) ... [2024-10-14 11:30:08,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:08" (1/1) ... [2024-10-14 11:30:08,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:08" (1/1) ... [2024-10-14 11:30:08,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:08" (1/1) ... [2024-10-14 11:30:08,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:08" (1/1) ... [2024-10-14 11:30:08,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:30:08,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:30:08,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:30:08,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:30:08,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:08" (1/1) ... [2024-10-14 11:30:08,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:30:08,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:30:08,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:30:08,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:30:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:30:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:30:08,377 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:30:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:30:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:30:08,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:30:08,477 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:30:08,479 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:30:08,970 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-14 11:30:08,970 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:30:09,011 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:30:09,012 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:30:09,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:30:09 BoogieIcfgContainer [2024-10-14 11:30:09,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:30:09,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:30:09,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:30:09,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:30:09,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:30:07" (1/3) ... [2024-10-14 11:30:09,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddabea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:30:09, skipping insertion in model container [2024-10-14 11:30:09,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:08" (2/3) ... [2024-10-14 11:30:09,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddabea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:30:09, skipping insertion in model container [2024-10-14 11:30:09,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:30:09" (3/3) ... [2024-10-14 11:30:09,022 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-86.i [2024-10-14 11:30:09,039 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:30:09,039 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:30:09,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:30:09,107 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;@75d5f6ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:30:09,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:30:09,111 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-14 11:30:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-14 11:30:09,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:30:09,130 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-14 11:30:09,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:30:09,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:30:09,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1403055823, now seen corresponding path program 1 times [2024-10-14 11:30:09,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:30:09,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368454657] [2024-10-14 11:30:09,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:30:09,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:30:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:30:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:30:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:30:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:30:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:30:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:30:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:30:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:30:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:30:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:30:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:30:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:30:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:30:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:30:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:30:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:30:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:30:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:30:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:30:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:30:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:30:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:30:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:30:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:30:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:30:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:09,652 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-14 11:30:09,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:30:09,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368454657] [2024-10-14 11:30:09,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368454657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:30:09,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:30:09,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:30:09,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562550202] [2024-10-14 11:30:09,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:30:09,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:30:09,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:30:09,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:30:09,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:30:09,693 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-14 11:30:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:30:09,753 INFO L93 Difference]: Finished difference Result 231 states and 385 transitions. [2024-10-14 11:30:09,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:30:09,756 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-14 11:30:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:30:09,765 INFO L225 Difference]: With dead ends: 231 [2024-10-14 11:30:09,765 INFO L226 Difference]: Without dead ends: 115 [2024-10-14 11:30:09,771 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-14 11:30:09,776 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:30:09,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:30:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-14 11:30:09,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-14 11:30:09,828 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-14 11:30:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 176 transitions. [2024-10-14 11:30:09,834 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 176 transitions. Word has length 177 [2024-10-14 11:30:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:30:09,834 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 176 transitions. [2024-10-14 11:30:09,835 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-14 11:30:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 176 transitions. [2024-10-14 11:30:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-14 11:30:09,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:30:09,840 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-14 11:30:09,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:30:09,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:30:09,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:30:09,842 INFO L85 PathProgramCache]: Analyzing trace with hash 712331067, now seen corresponding path program 1 times [2024-10-14 11:30:09,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:30:09,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520194077] [2024-10-14 11:30:09,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:30:09,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:30:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:30:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:30:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:30:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:30:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:30:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:30:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:30:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:30:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:30:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:30:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:30:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:30:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:30:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:30:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:30:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:30:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:30:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:30:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:30:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:30:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:30:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:30:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:30:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:30:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:30:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 45 proven. 93 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2024-10-14 11:30:11,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:30:11,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520194077] [2024-10-14 11:30:11,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520194077] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:30:11,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481173526] [2024-10-14 11:30:11,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:30:11,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:30:11,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:30:11,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:30:11,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 11:30:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:11,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 11:30:11,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:30:12,336 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-14 11:30:12,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:30:12,697 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-14 11:30:12,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481173526] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:30:12,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 11:30:12,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 8] total 24 [2024-10-14 11:30:12,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155122065] [2024-10-14 11:30:12,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 11:30:12,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 11:30:12,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:30:12,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 11:30:12,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-10-14 11:30:12,707 INFO L87 Difference]: Start difference. First operand 115 states and 176 transitions. Second operand has 24 states, 23 states have (on average 4.782608695652174) internal successors, (110), 23 states have internal predecessors, (110), 7 states have call successors, (68), 2 states have call predecessors, (68), 4 states have return successors, (69), 6 states have call predecessors, (69), 7 states have call successors, (69) [2024-10-14 11:30:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:30:18,016 INFO L93 Difference]: Finished difference Result 1506 states and 2209 transitions. [2024-10-14 11:30:18,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-14 11:30:18,016 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.782608695652174) internal successors, (110), 23 states have internal predecessors, (110), 7 states have call successors, (68), 2 states have call predecessors, (68), 4 states have return successors, (69), 6 states have call predecessors, (69), 7 states have call successors, (69) Word has length 177 [2024-10-14 11:30:18,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:30:18,045 INFO L225 Difference]: With dead ends: 1506 [2024-10-14 11:30:18,045 INFO L226 Difference]: Without dead ends: 1392 [2024-10-14 11:30:18,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 401 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2822 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1626, Invalid=7304, Unknown=0, NotChecked=0, Total=8930 [2024-10-14 11:30:18,051 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 3517 mSDsluCounter, 2933 mSDsCounter, 0 mSdLazyCounter, 3349 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3535 SdHoareTripleChecker+Valid, 3075 SdHoareTripleChecker+Invalid, 3761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 3349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 11:30:18,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3535 Valid, 3075 Invalid, 3761 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [412 Valid, 3349 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 11:30:18,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2024-10-14 11:30:18,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 480. [2024-10-14 11:30:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 409 states have (on average 1.471882640586797) internal successors, (602), 411 states have internal predecessors, (602), 62 states have call successors, (62), 8 states have call predecessors, (62), 8 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-14 11:30:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 726 transitions. [2024-10-14 11:30:18,136 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 726 transitions. Word has length 177 [2024-10-14 11:30:18,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:30:18,141 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 726 transitions. [2024-10-14 11:30:18,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.782608695652174) internal successors, (110), 23 states have internal predecessors, (110), 7 states have call successors, (68), 2 states have call predecessors, (68), 4 states have return successors, (69), 6 states have call predecessors, (69), 7 states have call successors, (69) [2024-10-14 11:30:18,142 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 726 transitions. [2024-10-14 11:30:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-14 11:30:18,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:30:18,146 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-14 11:30:18,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 11:30:18,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:30:18,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:30:18,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:30:18,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1928001472, now seen corresponding path program 1 times [2024-10-14 11:30:18,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:30:18,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962988802] [2024-10-14 11:30:18,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:30:18,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:30:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:30:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:30:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:30:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:30:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:30:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:30:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:30:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:30:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:30:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:30:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:30:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:30:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:30:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:30:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:30:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:30:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:30:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:30:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:23,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:30:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:24,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:30:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:24,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:30:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:30:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:24,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:30:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:24,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:30:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:24,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:30:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:24,263 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-14 11:30:24,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:30:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962988802] [2024-10-14 11:30:24,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962988802] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:30:24,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015441941] [2024-10-14 11:30:24,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:30:24,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:30:24,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:30:24,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:30:24,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 11:30:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:30:24,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-14 11:30:24,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:30:26,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 599 proven. 84 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2024-10-14 11:30:26,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:30:32,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015441941] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:30:32,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 11:30:32,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 39 [2024-10-14 11:30:32,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578831530] [2024-10-14 11:30:32,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 11:30:32,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-14 11:30:32,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:30:32,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-14 11:30:32,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2372, Unknown=1, NotChecked=0, Total=2550 [2024-10-14 11:30:32,280 INFO L87 Difference]: Start difference. First operand 480 states and 726 transitions. Second operand has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 7 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 7 states have call successors, (50) [2024-10-14 11:30:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:30:47,002 INFO L93 Difference]: Finished difference Result 3203 states and 4743 transitions. [2024-10-14 11:30:47,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-10-14 11:30:47,003 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 7 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 7 states have call successors, (50) Word has length 178 [2024-10-14 11:30:47,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:30:47,023 INFO L225 Difference]: With dead ends: 3203 [2024-10-14 11:30:47,024 INFO L226 Difference]: Without dead ends: 2724 [2024-10-14 11:30:47,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6129 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=2858, Invalid=18603, Unknown=1, NotChecked=0, Total=21462 [2024-10-14 11:30:47,034 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 6543 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 5739 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6547 SdHoareTripleChecker+Valid, 2852 SdHoareTripleChecker+Invalid, 6328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 5739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-14 11:30:47,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6547 Valid, 2852 Invalid, 6328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 5739 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-14 11:30:47,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2024-10-14 11:30:47,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 1157. [2024-10-14 11:30:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1019 states have (on average 1.4308145240431795) internal successors, (1458), 1025 states have internal predecessors, (1458), 109 states have call successors, (109), 28 states have call predecessors, (109), 28 states have return successors, (109), 103 states have call predecessors, (109), 109 states have call successors, (109) [2024-10-14 11:30:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1676 transitions. [2024-10-14 11:30:47,155 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1676 transitions. Word has length 178 [2024-10-14 11:30:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:30:47,158 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1676 transitions. [2024-10-14 11:30:47,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 7 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 7 states have call successors, (50) [2024-10-14 11:30:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1676 transitions. [2024-10-14 11:30:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-14 11:30:47,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:30:47,164 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-14 11:30:47,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 11:30:47,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-14 11:30:47,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:30:47,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:30:47,370 INFO L85 PathProgramCache]: Analyzing trace with hash 752608441, now seen corresponding path program 1 times [2024-10-14 11:30:47,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:30:47,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728352352] [2024-10-14 11:30:47,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:30:47,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:30:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:30:47,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:30:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:30:47,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:30:47,619 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:30:47,621 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:30:47,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:30:47,629 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 11:30:47,771 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:30:47,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:30:47 BoogieIcfgContainer [2024-10-14 11:30:47,777 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:30:47,778 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:30:47,778 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:30:47,778 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:30:47,779 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:30:09" (3/4) ... [2024-10-14 11:30:47,781 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:30:47,782 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:30:47,783 INFO L158 Benchmark]: Toolchain (without parser) took 40039.25ms. Allocated memory was 178.3MB in the beginning and 490.7MB in the end (delta: 312.5MB). Free memory was 122.3MB in the beginning and 188.6MB in the end (delta: -66.4MB). Peak memory consumption was 247.9MB. Max. memory is 16.1GB. [2024-10-14 11:30:47,783 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 178.3MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:30:47,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.39ms. Allocated memory is still 178.3MB. Free memory was 121.9MB in the beginning and 104.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 11:30:47,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.58ms. Allocated memory is still 178.3MB. Free memory was 104.6MB in the beginning and 100.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:30:47,783 INFO L158 Benchmark]: Boogie Preprocessor took 67.08ms. Allocated memory is still 178.3MB. Free memory was 100.9MB in the beginning and 96.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:30:47,784 INFO L158 Benchmark]: RCFGBuilder took 726.40ms. Allocated memory is still 178.3MB. Free memory was 96.3MB in the beginning and 63.6MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 11:30:47,784 INFO L158 Benchmark]: TraceAbstraction took 38762.27ms. Allocated memory was 178.3MB in the beginning and 490.7MB in the end (delta: 312.5MB). Free memory was 63.2MB in the beginning and 188.6MB in the end (delta: -125.5MB). Peak memory consumption was 189.2MB. Max. memory is 16.1GB. [2024-10-14 11:30:47,784 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 490.7MB. Free memory is still 188.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:30:47,785 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.19ms. Allocated memory is still 178.3MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.39ms. Allocated memory is still 178.3MB. Free memory was 121.9MB in the beginning and 104.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.58ms. Allocated memory is still 178.3MB. Free memory was 104.6MB in the beginning and 100.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.08ms. Allocated memory is still 178.3MB. Free memory was 100.9MB in the beginning and 96.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 726.40ms. Allocated memory is still 178.3MB. Free memory was 96.3MB in the beginning and 63.6MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 38762.27ms. Allocated memory was 178.3MB in the beginning and 490.7MB in the end (delta: 312.5MB). Free memory was 63.2MB in the beginning and 188.6MB in the end (delta: -125.5MB). Peak memory consumption was 189.2MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 490.7MB. Free memory is still 188.6MB. 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] COND TRUE 1 [L195] 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 [L195] RET updateLastVariables() [L196] 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] [L196] RET updateVariables() [L197] 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] [L197] RET step() [L198] 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)) ; [L198] RET, EXPR property() [L198] 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: 38.5s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10082 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10060 mSDsluCounter, 6100 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5681 mSDsCounter, 1001 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9091 IncrementalHoareTripleChecker+Invalid, 10092 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1001 mSolverCounterUnsat, 419 mSDtfsCounter, 9091 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1053 GetRequests, 813 SyntacticMatches, 2 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8951 ImplicationChecksByTransitivity, 18.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1157occurred in iteration=3, InterpolantAutomatonStates: 183, 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, 2479 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 1065 NumberOfCodeBlocks, 1065 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1058 ConstructedInterpolants, 0 QuantifiedInterpolants, 11349 SizeOfPredicates, 12 NumberOfNonLiveVariables, 823 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 6873/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-14 11:30:47,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de3f97de174f82d2dd03abf9cece844345a8c6a06eac52f7ed60428cd6c2c344 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:30:50,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:30:50,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:30:50,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:30:50,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:30:50,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:30:50,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:30:50,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:30:50,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:30:50,216 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:30:50,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:30:50,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:30:50,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:30:50,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:30:50,221 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:30:50,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:30:50,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:30:50,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:30:50,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:30:50,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:30:50,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:30:50,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:30:50,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:30:50,225 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:30:50,225 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:30:50,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:30:50,225 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:30:50,226 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:30:50,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:30:50,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:30:50,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:30:50,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:30:50,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:30:50,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:30:50,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:30:50,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:30:50,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:30:50,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:30:50,229 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:30:50,229 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:30:50,230 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:30:50,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:30:50,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:30:50,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:30:50,231 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:30:50,231 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de3f97de174f82d2dd03abf9cece844345a8c6a06eac52f7ed60428cd6c2c344 [2024-10-14 11:30:50,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:30:50,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:30:50,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:30:50,611 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:30:50,612 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:30:50,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i [2024-10-14 11:30:52,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:30:52,455 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:30:52,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i [2024-10-14 11:30:52,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66633fb25/4a3e54f00ff04a4e9e31f3e1552765c3/FLAG936034541 [2024-10-14 11:30:52,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66633fb25/4a3e54f00ff04a4e9e31f3e1552765c3 [2024-10-14 11:30:52,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:30:52,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:30:52,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:30:52,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:30:52,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:30:52,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:30:52" (1/1) ... [2024-10-14 11:30:52,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d46553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:52, skipping insertion in model container [2024-10-14 11:30:52,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:30:52" (1/1) ... [2024-10-14 11:30:52,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:30:52,717 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i[916,929] [2024-10-14 11:30:52,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:30:52,871 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:30:52,885 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-86.i[916,929] [2024-10-14 11:30:52,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:30:52,951 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:30:52,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:52 WrapperNode [2024-10-14 11:30:52,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:30:52,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:30:52,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:30:52,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:30:52,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:52" (1/1) ... [2024-10-14 11:30:52,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:52" (1/1) ... [2024-10-14 11:30:53,016 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-10-14 11:30:53,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:30:53,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:30:53,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:30:53,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:30:53,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:52" (1/1) ... [2024-10-14 11:30:53,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:52" (1/1) ... [2024-10-14 11:30:53,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:52" (1/1) ... [2024-10-14 11:30:53,059 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:30:53,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:52" (1/1) ... [2024-10-14 11:30:53,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:52" (1/1) ... [2024-10-14 11:30:53,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:52" (1/1) ... [2024-10-14 11:30:53,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:52" (1/1) ... [2024-10-14 11:30:53,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:52" (1/1) ... [2024-10-14 11:30:53,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:52" (1/1) ... [2024-10-14 11:30:53,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:30:53,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:30:53,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:30:53,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:30:53,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:52" (1/1) ... [2024-10-14 11:30:53,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:30:53,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:30:53,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:30:53,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:30:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:30:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:30:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:30:53,205 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:30:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:30:53,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:30:53,287 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:30:53,289 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:31:05,507 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-14 11:31:05,507 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:31:05,586 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:31:05,586 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:31:05,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:31:05 BoogieIcfgContainer [2024-10-14 11:31:05,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:31:05,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:31:05,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:31:05,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:31:05,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:30:52" (1/3) ... [2024-10-14 11:31:05,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d75f563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:31:05, skipping insertion in model container [2024-10-14 11:31:05,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:30:52" (2/3) ... [2024-10-14 11:31:05,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d75f563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:31:05, skipping insertion in model container [2024-10-14 11:31:05,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:31:05" (3/3) ... [2024-10-14 11:31:05,602 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-86.i [2024-10-14 11:31:05,620 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:31:05,621 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:31:05,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:31:05,697 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;@4ecf1bf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:31:05,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:31:05,702 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-14 11:31:05,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 11:31:05,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:31:05,720 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-14 11:31:05,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:31:05,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:31:05,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1815215531, now seen corresponding path program 1 times [2024-10-14 11:31:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:31:05,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756560778] [2024-10-14 11:31:05,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:31:05,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:31:05,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:31:05,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:31:05,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 11:31:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:31:06,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:31:06,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:31:06,311 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-14 11:31:06,311 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:31:06,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:31:06,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756560778] [2024-10-14 11:31:06,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756560778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:31:06,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:31:06,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:31:06,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708268679] [2024-10-14 11:31:06,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:31:06,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:31:06,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:31:06,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:31:06,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:31:06,345 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-14 11:31:10,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:31:10,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:31:10,614 INFO L93 Difference]: Finished difference Result 157 states and 277 transitions. [2024-10-14 11:31:10,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:31:10,666 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-14 11:31:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:31:10,672 INFO L225 Difference]: With dead ends: 157 [2024-10-14 11:31:10,672 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 11:31:10,676 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-14 11:31:10,679 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:31:10,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 11:31:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 11:31:10,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 11:31:10,734 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-14 11:31:10,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 122 transitions. [2024-10-14 11:31:10,738 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 122 transitions. Word has length 162 [2024-10-14 11:31:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:31:10,739 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 122 transitions. [2024-10-14 11:31:10,739 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-14 11:31:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 122 transitions. [2024-10-14 11:31:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 11:31:10,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:31:10,744 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-14 11:31:10,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 11:31:10,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:31:10,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:31:10,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:31:10,946 INFO L85 PathProgramCache]: Analyzing trace with hash 38579425, now seen corresponding path program 1 times [2024-10-14 11:31:10,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:31:10,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818767294] [2024-10-14 11:31:10,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:31:10,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:31:10,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:31:10,950 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:31:10,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 11:31:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:31:11,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 11:31:11,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:31:13,922 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-14 11:31:13,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:31:13,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:31:13,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818767294] [2024-10-14 11:31:13,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818767294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:31:13,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:31:13,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:31:13,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883601368] [2024-10-14 11:31:13,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:31:13,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:31:13,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:31:13,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:31:13,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:31:13,933 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-14 11:31:18,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:31:22,498 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-14 11:31:25,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:31:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:31:25,916 INFO L93 Difference]: Finished difference Result 231 states and 362 transitions. [2024-10-14 11:31:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:31:25,917 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-14 11:31:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:31:25,922 INFO L225 Difference]: With dead ends: 231 [2024-10-14 11:31:25,922 INFO L226 Difference]: Without dead ends: 154 [2024-10-14 11:31:25,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:31:25,925 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 39 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:31:25,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 222 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 12.0s Time] [2024-10-14 11:31:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-14 11:31:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2024-10-14 11:31:25,961 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-14 11:31:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 234 transitions. [2024-10-14 11:31:25,964 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 234 transitions. Word has length 162 [2024-10-14 11:31:25,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:31:25,965 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 234 transitions. [2024-10-14 11:31:25,965 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-14 11:31:25,966 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 234 transitions. [2024-10-14 11:31:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 11:31:25,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:31:25,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] [2024-10-14 11:31:25,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0