./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ea896f7bc04be31a5c6c97a4f6cc7d6fac7c26e247bcad19aec81c3c1b0a6a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:03:07,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:03:07,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:03:07,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:03:07,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:03:08,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:03:08,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:03:08,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:03:08,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:03:08,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:03:08,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:03:08,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:03:08,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:03:08,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:03:08,018 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:03:08,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:03:08,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:03:08,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:03:08,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:03:08,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:03:08,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:03:08,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:03:08,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:03:08,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:03:08,023 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:03:08,023 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:03:08,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:03:08,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:03:08,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:03:08,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:03:08,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:03:08,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:03:08,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:03:08,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:03:08,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:03:08,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:03:08,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:03:08,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:03:08,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:03:08,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:03:08,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:03:08,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:03:08,028 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ea896f7bc04be31a5c6c97a4f6cc7d6fac7c26e247bcad19aec81c3c1b0a6a7 [2024-10-11 11:03:08,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:03:08,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:03:08,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:03:08,249 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:03:08,250 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:03:08,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i [2024-10-11 11:03:09,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:03:09,679 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:03:09,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i [2024-10-11 11:03:09,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/72dc67168/9c32ffbf89b94b5aa86dd9811ecadd0f/FLAGae159fd2b [2024-10-11 11:03:09,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/72dc67168/9c32ffbf89b94b5aa86dd9811ecadd0f [2024-10-11 11:03:09,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:03:09,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:03:09,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:03:09,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:03:09,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:03:09,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:03:09" (1/1) ... [2024-10-11 11:03:09,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2836d38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:09, skipping insertion in model container [2024-10-11 11:03:09,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:03:09" (1/1) ... [2024-10-11 11:03:09,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:03:09,894 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i[915,928] [2024-10-11 11:03:10,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:03:10,016 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:03:10,024 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i[915,928] [2024-10-11 11:03:10,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:03:10,087 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:03:10,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:10 WrapperNode [2024-10-11 11:03:10,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:03:10,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:03:10,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:03:10,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:03:10,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:10" (1/1) ... [2024-10-11 11:03:10,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:10" (1/1) ... [2024-10-11 11:03:10,149 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 259 [2024-10-11 11:03:10,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:03:10,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:03:10,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:03:10,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:03:10,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:10" (1/1) ... [2024-10-11 11:03:10,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:10" (1/1) ... [2024-10-11 11:03:10,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:10" (1/1) ... [2024-10-11 11:03:10,188 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:03:10,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:10" (1/1) ... [2024-10-11 11:03:10,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:10" (1/1) ... [2024-10-11 11:03:10,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:10" (1/1) ... [2024-10-11 11:03:10,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:10" (1/1) ... [2024-10-11 11:03:10,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:10" (1/1) ... [2024-10-11 11:03:10,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:10" (1/1) ... [2024-10-11 11:03:10,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:03:10,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:03:10,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:03:10,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:03:10,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:10" (1/1) ... [2024-10-11 11:03:10,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:03:10,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:03:10,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:03:10,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:03:10,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:03:10,289 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:03:10,290 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:03:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:03:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:03:10,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:03:10,364 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:03:10,365 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:03:10,730 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-11 11:03:10,731 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:03:10,771 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:03:10,771 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:03:10,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:03:10 BoogieIcfgContainer [2024-10-11 11:03:10,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:03:10,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:03:10,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:03:10,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:03:10,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:03:09" (1/3) ... [2024-10-11 11:03:10,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c693b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:03:10, skipping insertion in model container [2024-10-11 11:03:10,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:10" (2/3) ... [2024-10-11 11:03:10,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c693b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:03:10, skipping insertion in model container [2024-10-11 11:03:10,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:03:10" (3/3) ... [2024-10-11 11:03:10,779 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-2.i [2024-10-11 11:03:10,792 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:03:10,793 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:03:10,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:03:10,851 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;@65b9f909, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:03:10,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:03:10,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 11:03:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 11:03:10,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:03:10,875 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:03:10,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:03:10,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:03:10,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1917984191, now seen corresponding path program 1 times [2024-10-11 11:03:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:03:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547891196] [2024-10-11 11:03:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:03:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:03:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:03:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:03:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:03:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:03:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:03:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:03:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:03:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:03:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:03:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:03:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:03:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:03:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:03:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:03:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:03:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:03:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:03:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:03:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:03:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:03:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:03:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:03:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:03:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:03:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:03:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:03:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:03:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 11:03:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 11:03:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:03:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:03:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:03:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:03:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 11:03:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:03:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 11:03:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 11:03:11,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:03:11,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547891196] [2024-10-11 11:03:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547891196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:03:11,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:03:11,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:03:11,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948071375] [2024-10-11 11:03:11,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:03:11,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:03:11,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:03:11,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:03:11,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:03:11,388 INFO L87 Difference]: Start difference. First operand has 103 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 11:03:11,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:03:11,445 INFO L93 Difference]: Finished difference Result 205 states and 365 transitions. [2024-10-11 11:03:11,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:03:11,447 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 224 [2024-10-11 11:03:11,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:03:11,453 INFO L225 Difference]: With dead ends: 205 [2024-10-11 11:03:11,454 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 11:03:11,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:03:11,460 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:03:11,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:03:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 11:03:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 11:03:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 11:03:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 160 transitions. [2024-10-11 11:03:11,520 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 160 transitions. Word has length 224 [2024-10-11 11:03:11,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:03:11,521 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 160 transitions. [2024-10-11 11:03:11,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 11:03:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 160 transitions. [2024-10-11 11:03:11,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 11:03:11,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:03:11,525 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:03:11,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:03:11,526 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:03:11,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:03:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1405302781, now seen corresponding path program 1 times [2024-10-11 11:03:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:03:11,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537753801] [2024-10-11 11:03:11,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:03:11,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:03:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:03:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:03:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:03:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:03:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:03:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:03:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:03:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:03:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:03:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:03:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:03:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:03:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:03:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:03:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:03:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:03:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:03:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:03:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:03:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:03:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:03:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:03:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:03:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:03:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:03:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:03:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:03:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 11:03:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 11:03:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:03:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:03:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:03:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:03:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 11:03:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:03:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 11:03:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 11:03:11,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:03:11,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537753801] [2024-10-11 11:03:11,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537753801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:03:11,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:03:11,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:03:11,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139177870] [2024-10-11 11:03:11,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:03:11,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:03:11,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:03:11,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:03:11,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:03:11,836 INFO L87 Difference]: Start difference. First operand 101 states and 160 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 11:03:11,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:03:11,884 INFO L93 Difference]: Finished difference Result 230 states and 363 transitions. [2024-10-11 11:03:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:03:11,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 224 [2024-10-11 11:03:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:03:11,890 INFO L225 Difference]: With dead ends: 230 [2024-10-11 11:03:11,890 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 11:03:11,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:03:11,892 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 36 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:03:11,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 304 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:03:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 11:03:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2024-10-11 11:03:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 11:03:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 170 transitions. [2024-10-11 11:03:11,909 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 170 transitions. Word has length 224 [2024-10-11 11:03:11,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:03:11,910 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 170 transitions. [2024-10-11 11:03:11,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 11:03:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 170 transitions. [2024-10-11 11:03:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-11 11:03:11,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:03:11,917 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:03:11,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:03:11,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:03:11,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:03:11,917 INFO L85 PathProgramCache]: Analyzing trace with hash 571971239, now seen corresponding path program 1 times [2024-10-11 11:03:11,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:03:11,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583693901] [2024-10-11 11:03:11,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:03:11,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:03:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:03:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:03:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:03:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:03:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:03:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:03:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:03:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:03:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:03:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:03:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:03:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:03:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:03:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:03:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:03:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:03:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:03:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:03:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:03:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:03:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:03:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:03:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:03:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:03:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:03:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:03:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:03:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 11:03:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 11:03:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:03:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:03:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:03:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:03:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 11:03:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:03:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 11:03:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 11:03:12,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:03:12,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583693901] [2024-10-11 11:03:12,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583693901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:03:12,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:03:12,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:03:12,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677514900] [2024-10-11 11:03:12,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:03:12,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:03:12,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:03:12,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:03:12,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:03:12,094 INFO L87 Difference]: Start difference. First operand 108 states and 170 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 11:03:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:03:12,129 INFO L93 Difference]: Finished difference Result 265 states and 411 transitions. [2024-10-11 11:03:12,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:03:12,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 225 [2024-10-11 11:03:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:03:12,132 INFO L225 Difference]: With dead ends: 265 [2024-10-11 11:03:12,132 INFO L226 Difference]: Without dead ends: 158 [2024-10-11 11:03:12,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:03:12,133 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 56 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:03:12,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 302 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:03:12,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-11 11:03:12,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2024-10-11 11:03:12,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 110 states have internal predecessors, (153), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 11:03:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 239 transitions. [2024-10-11 11:03:12,172 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 239 transitions. Word has length 225 [2024-10-11 11:03:12,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:03:12,173 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 239 transitions. [2024-10-11 11:03:12,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 11:03:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2024-10-11 11:03:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-11 11:03:12,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:03:12,176 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:03:12,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:03:12,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:03:12,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:03:12,177 INFO L85 PathProgramCache]: Analyzing trace with hash 178944229, now seen corresponding path program 1 times [2024-10-11 11:03:12,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:03:12,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671292063] [2024-10-11 11:03:12,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:03:12,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:03:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:03:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:03:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:03:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:03:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:03:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:03:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:03:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:03:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:03:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:03:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:03:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:03:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:03:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:03:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:03:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:03:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:03:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:03:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:03:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:03:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:03:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:03:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:03:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:03:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:03:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:03:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:03:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 11:03:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 11:03:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:03:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:03:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:03:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 11:03:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 11:03:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 11:03:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 11:03:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 27 proven. 78 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 11:03:14,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:03:14,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671292063] [2024-10-11 11:03:14,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671292063] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:03:14,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839456437] [2024-10-11 11:03:14,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:03:14,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:03:14,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:03:14,574 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:03:14,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:03:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:14,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 11:03:14,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:03:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1647 proven. 105 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2024-10-11 11:03:16,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:03:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 99 proven. 108 refuted. 0 times theorem prover too weak. 2313 trivial. 0 not checked. [2024-10-11 11:03:17,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839456437] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:03:17,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:03:17,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 36 [2024-10-11 11:03:17,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544121083] [2024-10-11 11:03:17,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:03:17,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 11:03:17,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:03:17,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 11:03:17,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 11:03:17,709 INFO L87 Difference]: Start difference. First operand 155 states and 239 transitions. Second operand has 36 states, 36 states have (on average 4.0) internal successors, (144), 35 states have internal predecessors, (144), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (108), 9 states have call predecessors, (108), 9 states have call successors, (108) [2024-10-11 11:03:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:03:29,173 INFO L93 Difference]: Finished difference Result 1556 states and 2207 transitions. [2024-10-11 11:03:29,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2024-10-11 11:03:29,174 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.0) internal successors, (144), 35 states have internal predecessors, (144), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (108), 9 states have call predecessors, (108), 9 states have call successors, (108) Word has length 225 [2024-10-11 11:03:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:03:29,189 INFO L225 Difference]: With dead ends: 1556 [2024-10-11 11:03:29,190 INFO L226 Difference]: Without dead ends: 1402 [2024-10-11 11:03:29,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7273 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=4498, Invalid=17852, Unknown=0, NotChecked=0, Total=22350 [2024-10-11 11:03:29,197 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 1993 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 3457 mSolverCounterSat, 1211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 4668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1211 IncrementalHoareTripleChecker+Valid, 3457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 11:03:29,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2026 Valid, 1456 Invalid, 4668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1211 Valid, 3457 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 11:03:29,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2024-10-11 11:03:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 439. [2024-10-11 11:03:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 322 states have (on average 1.3819875776397517) internal successors, (445), 326 states have internal predecessors, (445), 104 states have call successors, (104), 12 states have call predecessors, (104), 12 states have return successors, (104), 100 states have call predecessors, (104), 104 states have call successors, (104) [2024-10-11 11:03:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 653 transitions. [2024-10-11 11:03:29,275 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 653 transitions. Word has length 225 [2024-10-11 11:03:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:03:29,276 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 653 transitions. [2024-10-11 11:03:29,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.0) internal successors, (144), 35 states have internal predecessors, (144), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (108), 9 states have call predecessors, (108), 9 states have call successors, (108) [2024-10-11 11:03:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 653 transitions. [2024-10-11 11:03:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-11 11:03:29,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:03:29,278 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:03:29,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:03:29,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:03:29,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:03:29,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:03:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash 236202531, now seen corresponding path program 1 times [2024-10-11 11:03:29,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:03:29,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804628222] [2024-10-11 11:03:29,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:03:29,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:03:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:03:29,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860640602] [2024-10-11 11:03:29,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:03:29,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:03:29,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:03:29,630 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:03:29,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:03:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:03:29,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:03:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:03:29,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:03:29,956 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:03:29,957 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:03:29,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 11:03:30,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:03:30,162 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 11:03:30,289 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:03:30,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:03:30 BoogieIcfgContainer [2024-10-11 11:03:30,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:03:30,293 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:03:30,294 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:03:30,294 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:03:30,294 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:03:10" (3/4) ... [2024-10-11 11:03:30,295 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:03:30,296 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:03:30,297 INFO L158 Benchmark]: Toolchain (without parser) took 20586.97ms. Allocated memory was 159.4MB in the beginning and 358.6MB in the end (delta: 199.2MB). Free memory was 94.0MB in the beginning and 275.7MB in the end (delta: -181.7MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-10-11 11:03:30,297 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:03:30,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.77ms. Allocated memory is still 159.4MB. Free memory was 93.9MB in the beginning and 126.7MB in the end (delta: -32.8MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-11 11:03:30,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.91ms. Allocated memory is still 159.4MB. Free memory was 126.7MB in the beginning and 122.3MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:03:30,298 INFO L158 Benchmark]: Boogie Preprocessor took 65.26ms. Allocated memory is still 159.4MB. Free memory was 122.3MB in the beginning and 114.7MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 11:03:30,298 INFO L158 Benchmark]: RCFGBuilder took 555.84ms. Allocated memory is still 159.4MB. Free memory was 114.7MB in the beginning and 77.6MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 11:03:30,298 INFO L158 Benchmark]: TraceAbstraction took 19519.82ms. Allocated memory was 159.4MB in the beginning and 358.6MB in the end (delta: 199.2MB). Free memory was 77.0MB in the beginning and 275.7MB in the end (delta: -198.7MB). Peak memory consumption was 165.4MB. Max. memory is 16.1GB. [2024-10-11 11:03:30,298 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 358.6MB. Free memory is still 275.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:03:30,299 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.77ms. Allocated memory is still 159.4MB. Free memory was 93.9MB in the beginning and 126.7MB in the end (delta: -32.8MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.91ms. Allocated memory is still 159.4MB. Free memory was 126.7MB in the beginning and 122.3MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.26ms. Allocated memory is still 159.4MB. Free memory was 122.3MB in the beginning and 114.7MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 555.84ms. Allocated memory is still 159.4MB. Free memory was 114.7MB in the beginning and 77.6MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19519.82ms. Allocated memory was 159.4MB in the beginning and 358.6MB in the end (delta: 199.2MB). Free memory was 77.0MB in the beginning and 275.7MB in the end (delta: -198.7MB). Peak memory consumption was 165.4MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 358.6MB. Free memory is still 275.7MB. 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 203, overapproximation of someUnaryDOUBLEoperation at line 22, overapproximation of someBinaryArithmeticDOUBLEoperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 203. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = -0.5; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 64.84; [L25] double var_1_4 = 2.2; [L26] double var_1_5 = 31.875; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 0; [L29] signed char var_1_8 = -10; [L30] signed char var_1_10 = 2; [L31] signed char var_1_11 = 32; [L32] float var_1_12 = 2.5; [L33] signed short int var_1_13 = -64; [L34] signed short int var_1_14 = 8; [L35] float var_1_15 = 7.5; [L36] double var_1_16 = 2.85; [L37] signed char var_1_18 = 64; [L38] signed char var_1_20 = 1; [L39] unsigned char var_1_21 = 5; [L40] unsigned char var_1_22 = 10; [L41] unsigned char var_1_23 = 64; [L42] unsigned char var_1_24 = 2; [L43] float var_1_25 = 63.4; [L44] signed char var_1_26 = 4; [L45] signed char var_1_27 = 32; [L46] unsigned short int var_1_28 = 10; [L47] signed char var_1_29 = -1; [L48] signed char var_1_30 = -4; [L49] signed char var_1_31 = 2; [L50] signed char var_1_32 = -25; [L51] signed char var_1_33 = 1; [L52] signed char var_1_34 = 0; [L53] unsigned long int var_1_35 = 8; [L54] float var_1_36 = 127.7; [L55] float var_1_37 = 0.2; [L56] signed char last_1_var_1_18 = 64; [L57] unsigned char last_1_var_1_21 = 5; [L207] isInitial = 1 [L208] FCALL initially() [L209] int k_loop; [L210] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_3=1621/25, var_1_4=11/5, var_1_5=255/8, var_1_6=0, var_1_7=0, var_1_8=-10] [L210] COND TRUE k_loop < 1 [L211] CALL updateLastVariables() [L199] last_1_var_1_18 = var_1_18 [L200] last_1_var_1_21 = var_1_21 [L211] RET updateLastVariables() [L212] CALL updateVariables() [L141] var_1_2 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_3=1621/25, var_1_4=11/5, var_1_5=255/8, var_1_6=0, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_3=1621/25, var_1_4=11/5, var_1_5=255/8, var_1_6=0, var_1_7=0, var_1_8=-10] [L142] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_3=1621/25, var_1_4=11/5, var_1_5=255/8, var_1_6=0, var_1_7=0, var_1_8=-10] [L143] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_3=1621/25, var_1_4=11/5, var_1_5=255/8, var_1_6=0, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_3=1621/25, var_1_4=11/5, var_1_5=255/8, var_1_6=0, var_1_7=0, var_1_8=-10] [L143] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_3=1621/25, var_1_4=11/5, var_1_5=255/8, var_1_6=0, var_1_7=0, var_1_8=-10] [L144] var_1_3 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_4=11/5, var_1_5=255/8, var_1_6=0, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_4=11/5, var_1_5=255/8, var_1_6=0, var_1_7=0, var_1_8=-10] [L145] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_4=11/5, var_1_5=255/8, var_1_6=0, var_1_7=0, var_1_8=-10] [L146] var_1_4 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_5=255/8, var_1_6=0, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_5=255/8, var_1_6=0, var_1_7=0, var_1_8=-10] [L147] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_5=255/8, var_1_6=0, var_1_7=0, var_1_8=-10] [L148] var_1_5 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=0, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=0, var_1_7=0, var_1_8=-10] [L149] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=0, var_1_7=0, var_1_8=-10] [L150] var_1_6 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_7=0, var_1_8=-10] [L151] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_7=0, var_1_8=-10] [L152] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L152] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L153] var_1_7 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_8=-10] [L154] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_8=-10] [L155] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L155] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=2, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L156] var_1_10 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L157] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L158] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L158] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=32, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L159] var_1_11 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L160] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L161] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L161] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_15=15/2, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L162] var_1_15 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L163] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L164] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L164] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_16=57/20, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L165] var_1_16 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L166] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=1, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L167] var_1_20 = __VERIFIER_nondet_char() [L168] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L168] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L169] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L169] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=10, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L170] var_1_22 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L171] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L172] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L172] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=64, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L173] var_1_23 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L174] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L175] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L175] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=2, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L176] var_1_24 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L177] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L178] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L178] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=32, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L179] var_1_27 = __VERIFIER_nondet_char() [L180] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L180] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L181] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L181] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-4, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L182] var_1_30 = __VERIFIER_nondet_char() [L183] CALL assume_abort_if_not(var_1_30 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L183] RET assume_abort_if_not(var_1_30 >= -31) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L184] CALL assume_abort_if_not(var_1_30 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L184] RET assume_abort_if_not(var_1_30 <= 32) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=2, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L185] var_1_31 = __VERIFIER_nondet_char() [L186] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L186] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L187] CALL assume_abort_if_not(var_1_31 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L187] RET assume_abort_if_not(var_1_31 <= 31) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-25, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L188] var_1_32 = __VERIFIER_nondet_char() [L189] CALL assume_abort_if_not(var_1_32 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L189] RET assume_abort_if_not(var_1_32 >= -31) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L190] CALL assume_abort_if_not(var_1_32 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L190] RET assume_abort_if_not(var_1_32 <= 32) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=1, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L191] var_1_33 = __VERIFIER_nondet_char() [L192] CALL assume_abort_if_not(var_1_33 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L192] RET assume_abort_if_not(var_1_33 >= -31) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L193] CALL assume_abort_if_not(var_1_33 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L193] RET assume_abort_if_not(var_1_33 <= 31) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=0, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L194] var_1_34 = __VERIFIER_nondet_char() [L195] CALL assume_abort_if_not(var_1_34 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L195] RET assume_abort_if_not(var_1_34 >= -31) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L196] CALL assume_abort_if_not(var_1_34 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L196] RET assume_abort_if_not(var_1_34 <= 31) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=8, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L212] RET updateVariables() [L213] CALL step() [L61] COND TRUE (var_1_3 / var_1_15) >= (var_1_4 - var_1_16) [L62] var_1_14 = var_1_11 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=-11, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L66] signed short int stepLocal_7 = var_1_14; [L67] signed char stepLocal_6 = var_1_27; [L68] unsigned char stepLocal_5 = var_1_23; [L69] signed char stepLocal_4 = var_1_11; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_4=-11, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=-11, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L70] COND FALSE !(stepLocal_4 >= (var_1_27 - var_1_23)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=-11, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=-1, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L81] COND TRUE ! (var_1_24 <= var_1_27) [L82] var_1_29 = var_1_20 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=-11, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L91] unsigned char stepLocal_0 = var_1_7; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_0=0, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=-11, var_1_18=64, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_6=1, var_1_7=0, var_1_8=-10] [L92] COND TRUE \read(var_1_2) [L93] var_1_1 = (((((var_1_3 - var_1_4)) < (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_0=0, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=-11, var_1_18=64, var_1_1=2, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] [L99] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_0=0, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=-11, var_1_18=64, var_1_1=2, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] [L102] signed char stepLocal_2 = var_1_10; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_0=0, stepLocal_2=5, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=-11, var_1_18=64, var_1_1=2, var_1_20=63, var_1_21=5, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] [L103] COND TRUE stepLocal_2 <= last_1_var_1_21 [L104] var_1_21 = (((((var_1_22 + var_1_23)) < (var_1_24)) ? ((var_1_22 + var_1_23)) : (var_1_24))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_0=0, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=-11, var_1_18=64, var_1_1=2, var_1_20=63, var_1_21=62, var_1_22=127, var_1_23=10, var_1_24=62, var_1_25=317/5, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] [L108] var_1_25 = (((((9.999999999999975E13f) > (var_1_4)) ? (9.999999999999975E13f) : (var_1_4))) - var_1_3) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_0=0, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=-11, var_1_18=64, var_1_1=2, var_1_20=63, var_1_21=62, var_1_22=127, var_1_23=10, var_1_24=62, var_1_26=4, var_1_27=0, var_1_28=10, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] [L109] COND TRUE (- 4.75) < (- var_1_15) [L110] var_1_26 = ((((var_1_11) > ((var_1_10 - 16))) ? (var_1_11) : ((var_1_10 - 16)))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_0=0, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=-11, var_1_18=64, var_1_1=2, var_1_20=63, var_1_21=62, var_1_22=127, var_1_23=10, var_1_24=62, var_1_26=-11, var_1_27=0, var_1_28=10, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=1277/10, var_1_37=1/5, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] [L114] var_1_36 = var_1_3 [L115] var_1_37 = var_1_4 [L116] unsigned char stepLocal_1 = var_1_36 >= var_1_36; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_0=0, stepLocal_1=1, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=-11, var_1_18=64, var_1_1=2, var_1_20=63, var_1_21=62, var_1_22=127, var_1_23=10, var_1_24=62, var_1_26=-11, var_1_27=0, var_1_28=10, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=3, var_1_37=4, var_1_3=3, var_1_4=4, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] [L117] COND TRUE stepLocal_1 || var_1_2 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_0=0, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=-11, var_1_18=64, var_1_1=2, var_1_20=63, var_1_21=62, var_1_22=127, var_1_23=10, var_1_24=62, var_1_26=-11, var_1_27=0, var_1_28=10, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=3, var_1_37=4, var_1_3=3, var_1_4=4, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] [L118] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_0=0, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=-64, var_1_14=-11, var_1_18=64, var_1_1=2, var_1_20=63, var_1_21=62, var_1_22=127, var_1_23=10, var_1_24=62, var_1_26=-11, var_1_27=0, var_1_28=10, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=3, var_1_37=4, var_1_3=3, var_1_4=4, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] [L124] var_1_13 = ((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))) [L125] unsigned char stepLocal_3 = var_1_21; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_0=0, stepLocal_3=62, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=11, var_1_14=-11, var_1_18=64, var_1_1=2, var_1_20=63, var_1_21=62, var_1_22=127, var_1_23=10, var_1_24=62, var_1_26=-11, var_1_27=0, var_1_28=10, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=3, var_1_37=4, var_1_3=3, var_1_4=4, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] [L126] COND FALSE !(var_1_29 <= stepLocal_3) [L131] var_1_28 = var_1_27 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_0=0, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=11, var_1_14=-11, var_1_18=64, var_1_1=2, var_1_20=63, var_1_21=62, var_1_22=127, var_1_23=10, var_1_24=62, var_1_26=-11, var_1_27=0, var_1_28=0, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=3, var_1_37=4, var_1_3=3, var_1_4=4, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] [L133] EXPR var_1_28 ^ ((((var_1_26) > (var_1_8)) ? (var_1_26) : (var_1_8))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_0=0, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=11, var_1_14=-11, var_1_18=64, var_1_1=2, var_1_20=63, var_1_21=62, var_1_22=127, var_1_23=10, var_1_24=62, var_1_26=-11, var_1_27=0, var_1_28=0, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=3, var_1_37=4, var_1_3=3, var_1_4=4, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] [L133] COND FALSE !((var_1_28 ^ ((((var_1_26) > (var_1_8)) ? (var_1_26) : (var_1_8)))) > var_1_10) [L136] var_1_18 = var_1_11 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, stepLocal_0=0, stepLocal_5=10, stepLocal_6=0, stepLocal_7=-11, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=11, var_1_14=-11, var_1_18=-11, var_1_1=2, var_1_20=63, var_1_21=62, var_1_22=127, var_1_23=10, var_1_24=62, var_1_26=-11, var_1_27=0, var_1_28=0, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=8, var_1_36=3, var_1_37=4, var_1_3=3, var_1_4=4, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] [L138] var_1_35 = var_1_18 [L213] RET step() [L214] CALL, EXPR property() [L203] EXPR (((((var_1_2 ? (var_1_1 == ((double) (((((var_1_3 - var_1_4)) < (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((double) var_1_4)) : 1)) && (((var_1_36 >= var_1_36) || var_1_2) ? (var_1_7 ? (var_1_8 == ((signed char) (var_1_10 - ((((25) < 0 ) ? -(25) : (25)))))) : 1) : (var_1_8 == ((signed char) (-2 + var_1_11))))) && (var_1_7 ? (var_1_12 == ((float) var_1_5)) : 1)) && (var_1_13 == ((signed short int) ((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26)))))) && (((var_1_3 / var_1_15) >= (var_1_4 - var_1_16)) ? (var_1_14 == ((signed short int) var_1_11)) : (var_1_14 == ((signed short int) ((((((((var_1_11) < ((var_1_10 + last_1_var_1_18))) ? (var_1_11) : ((var_1_10 + last_1_var_1_18))))) > (last_1_var_1_21)) ? (((((var_1_11) < ((var_1_10 + last_1_var_1_18))) ? (var_1_11) : ((var_1_10 + last_1_var_1_18))))) : (last_1_var_1_21))))))) && (((var_1_28 ^ ((((var_1_26) > (var_1_8)) ? (var_1_26) : (var_1_8)))) > var_1_10) ? (var_1_18 == ((signed char) (var_1_11 + var_1_20))) : (var_1_18 == ((signed char) var_1_11))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=11, var_1_14=-11, var_1_18=-11, var_1_1=2, var_1_20=63, var_1_21=62, var_1_22=127, var_1_23=10, var_1_24=62, var_1_26=-11, var_1_27=0, var_1_28=0, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=-11, var_1_36=3, var_1_37=4, var_1_3=3, var_1_4=4, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] [L203-L204] return (((((((((((((var_1_2 ? (var_1_1 == ((double) (((((var_1_3 - var_1_4)) < (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((double) var_1_4)) : 1)) && (((var_1_36 >= var_1_36) || var_1_2) ? (var_1_7 ? (var_1_8 == ((signed char) (var_1_10 - ((((25) < 0 ) ? -(25) : (25)))))) : 1) : (var_1_8 == ((signed char) (-2 + var_1_11))))) && (var_1_7 ? (var_1_12 == ((float) var_1_5)) : 1)) && (var_1_13 == ((signed short int) ((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26)))))) && (((var_1_3 / var_1_15) >= (var_1_4 - var_1_16)) ? (var_1_14 == ((signed short int) var_1_11)) : (var_1_14 == ((signed short int) ((((((((var_1_11) < ((var_1_10 + last_1_var_1_18))) ? (var_1_11) : ((var_1_10 + last_1_var_1_18))))) > (last_1_var_1_21)) ? (((((var_1_11) < ((var_1_10 + last_1_var_1_18))) ? (var_1_11) : ((var_1_10 + last_1_var_1_18))))) : (last_1_var_1_21))))))) && (((var_1_28 ^ ((((var_1_26) > (var_1_8)) ? (var_1_26) : (var_1_8)))) > var_1_10) ? (var_1_18 == ((signed char) (var_1_11 + var_1_20))) : (var_1_18 == ((signed char) var_1_11)))) && ((var_1_10 <= last_1_var_1_21) ? (var_1_21 == ((unsigned char) (((((var_1_22 + var_1_23)) < (var_1_24)) ? ((var_1_22 + var_1_23)) : (var_1_24))))) : (var_1_21 == ((unsigned char) 128)))) && (var_1_25 == ((float) (((((9.999999999999975E13f) > (var_1_4)) ? (9.999999999999975E13f) : (var_1_4))) - var_1_3)))) && (((- 4.75) < (- var_1_15)) ? (var_1_26 == ((signed char) ((((var_1_11) > ((var_1_10 - 16))) ? (var_1_11) : ((var_1_10 - 16)))))) : (var_1_26 == ((signed char) (var_1_10 - (5 + var_1_27)))))) && ((var_1_29 <= var_1_21) ? (((var_1_1 + var_1_1) != var_1_36) ? (var_1_28 == ((unsigned short int) ((var_1_23 + var_1_27) + (((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) + var_1_26)))) : 1) : (var_1_28 == ((unsigned short int) var_1_27)))) && ((var_1_11 >= (var_1_27 - var_1_23)) ? ((var_1_20 <= var_1_27) ? ((! (var_1_15 > 3.8f)) ? (var_1_29 == ((signed char) ((((var_1_10) > (((((var_1_11) < (var_1_27)) ? (var_1_11) : (var_1_27))))) ? (var_1_10) : (((((var_1_11) < (var_1_27)) ? (var_1_11) : (var_1_27)))))))) : 1) : ((((((var_1_23) < ((var_1_24 * var_1_14))) ? (var_1_23) : ((var_1_24 * var_1_14)))) <= var_1_14) ? (var_1_29 == ((signed char) ((var_1_30 + (1 - var_1_31)) + (var_1_32 + ((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))))))) : 1)) : ((! (var_1_24 <= var_1_27)) ? (var_1_29 == ((signed char) var_1_20)) : ((var_1_27 < var_1_23) ? (var_1_29 == ((signed char) (var_1_27 - var_1_31))) : (var_1_29 == ((signed char) (var_1_34 + var_1_27))))))) && (var_1_35 == ((unsigned long int) var_1_18))) && (var_1_36 == ((float) var_1_3))) && (var_1_37 == ((float) var_1_4)) ; [L214] RET, EXPR property() [L214] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=11, var_1_14=-11, var_1_18=-11, var_1_1=2, var_1_20=63, var_1_21=62, var_1_22=127, var_1_23=10, var_1_24=62, var_1_26=-11, var_1_27=0, var_1_28=0, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=-11, var_1_36=3, var_1_37=4, var_1_3=3, var_1_4=4, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_21=5, var_1_10=5, var_1_11=-11, var_1_12=5/2, var_1_13=11, var_1_14=-11, var_1_18=-11, var_1_1=2, var_1_20=63, var_1_21=62, var_1_22=127, var_1_23=10, var_1_24=62, var_1_26=-11, var_1_27=0, var_1_28=0, var_1_29=63, var_1_2=1, var_1_30=-31, var_1_31=0, var_1_32=-31, var_1_33=-31, var_1_34=-31, var_1_35=-11, var_1_36=3, var_1_37=4, var_1_3=3, var_1_4=4, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=-10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 5, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2118 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2085 mSDsluCounter, 2218 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1656 mSDsCounter, 1214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3492 IncrementalHoareTripleChecker+Invalid, 4706 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1214 mSolverCounterUnsat, 562 mSDtfsCounter, 3492 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 932 GetRequests, 782 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7273 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=439occurred in iteration=4, InterpolantAutomatonStates: 132, 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, 4 MinimizatonAttempts, 988 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1573 NumberOfCodeBlocks, 1573 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1342 ConstructedInterpolants, 0 QuantifiedInterpolants, 8678 SizeOfPredicates, 11 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 14829/15120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:03:30,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ea896f7bc04be31a5c6c97a4f6cc7d6fac7c26e247bcad19aec81c3c1b0a6a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:03:32,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:03:32,146 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:03:32,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:03:32,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:03:32,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:03:32,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:03:32,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:03:32,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:03:32,182 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:03:32,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:03:32,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:03:32,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:03:32,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:03:32,183 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:03:32,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:03:32,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:03:32,186 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:03:32,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:03:32,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:03:32,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:03:32,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:03:32,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:03:32,187 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:03:32,187 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:03:32,187 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:03:32,187 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:03:32,187 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:03:32,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:03:32,188 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:03:32,188 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:03:32,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:03:32,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:03:32,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:03:32,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:03:32,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:03:32,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:03:32,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:03:32,189 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:03:32,189 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:03:32,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:03:32,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:03:32,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:03:32,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:03:32,191 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:03:32,191 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ea896f7bc04be31a5c6c97a4f6cc7d6fac7c26e247bcad19aec81c3c1b0a6a7 [2024-10-11 11:03:32,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:03:32,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:03:32,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:03:32,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:03:32,480 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:03:32,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i [2024-10-11 11:03:33,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:03:34,016 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:03:34,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i [2024-10-11 11:03:34,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d16a64c85/077dbdd43f134138ab93f1a8870550bb/FLAGcce8dc02e [2024-10-11 11:03:34,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d16a64c85/077dbdd43f134138ab93f1a8870550bb [2024-10-11 11:03:34,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:03:34,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:03:34,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:03:34,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:03:34,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:03:34,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:03:34" (1/1) ... [2024-10-11 11:03:34,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377e0b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:34, skipping insertion in model container [2024-10-11 11:03:34,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:03:34" (1/1) ... [2024-10-11 11:03:34,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:03:34,222 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i[915,928] [2024-10-11 11:03:34,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:03:34,329 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:03:34,342 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i[915,928] [2024-10-11 11:03:34,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:03:34,411 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:03:34,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:34 WrapperNode [2024-10-11 11:03:34,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:03:34,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:03:34,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:03:34,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:03:34,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:34" (1/1) ... [2024-10-11 11:03:34,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:34" (1/1) ... [2024-10-11 11:03:34,478 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2024-10-11 11:03:34,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:03:34,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:03:34,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:03:34,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:03:34,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:34" (1/1) ... [2024-10-11 11:03:34,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:34" (1/1) ... [2024-10-11 11:03:34,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:34" (1/1) ... [2024-10-11 11:03:34,517 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:03:34,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:34" (1/1) ... [2024-10-11 11:03:34,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:34" (1/1) ... [2024-10-11 11:03:34,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:34" (1/1) ... [2024-10-11 11:03:34,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:34" (1/1) ... [2024-10-11 11:03:34,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:34" (1/1) ... [2024-10-11 11:03:34,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:34" (1/1) ... [2024-10-11 11:03:34,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:03:34,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:03:34,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:03:34,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:03:34,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:34" (1/1) ... [2024-10-11 11:03:34,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:03:34,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:03:34,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:03:34,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:03:34,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:03:34,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:03:34,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:03:34,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:03:34,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:03:34,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:03:34,693 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:03:34,695 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:03:49,095 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-11 11:03:49,095 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:03:49,179 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:03:49,179 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:03:49,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:03:49 BoogieIcfgContainer [2024-10-11 11:03:49,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:03:49,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:03:49,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:03:49,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:03:49,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:03:34" (1/3) ... [2024-10-11 11:03:49,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c55be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:03:49, skipping insertion in model container [2024-10-11 11:03:49,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:03:34" (2/3) ... [2024-10-11 11:03:49,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c55be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:03:49, skipping insertion in model container [2024-10-11 11:03:49,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:03:49" (3/3) ... [2024-10-11 11:03:49,188 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-2.i [2024-10-11 11:03:49,202 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:03:49,203 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:03:49,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:03:49,267 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;@1655635f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:03:49,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:03:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 11:03:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 11:03:49,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:03:49,291 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:03:49,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:03:49,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:03:49,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1876120938, now seen corresponding path program 1 times [2024-10-11 11:03:49,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:03:49,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906281933] [2024-10-11 11:03:49,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:03:49,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:03:49,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:03:49,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:03:49,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:03:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:50,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:03:50,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:03:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1006 proven. 0 refuted. 0 times theorem prover too weak. 1514 trivial. 0 not checked. [2024-10-11 11:03:50,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:03:50,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:03:50,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906281933] [2024-10-11 11:03:50,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906281933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:03:50,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:03:50,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:03:50,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294005806] [2024-10-11 11:03:50,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:03:50,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:03:50,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:03:50,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:03:50,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:03:50,480 INFO L87 Difference]: Start difference. First operand has 92 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 11:03:54,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:03:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:03:55,071 INFO L93 Difference]: Finished difference Result 183 states and 329 transitions. [2024-10-11 11:03:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:03:55,073 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 221 [2024-10-11 11:03:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:03:55,081 INFO L225 Difference]: With dead ends: 183 [2024-10-11 11:03:55,082 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 11:03:55,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:03:55,088 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 11:03:55,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 11:03:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 11:03:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 11:03:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 11:03:55,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 142 transitions. [2024-10-11 11:03:55,134 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 142 transitions. Word has length 221 [2024-10-11 11:03:55,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:03:55,135 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 142 transitions. [2024-10-11 11:03:55,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 11:03:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 142 transitions. [2024-10-11 11:03:55,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 11:03:55,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:03:55,139 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:03:55,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:03:55,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:03:55,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:03:55,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:03:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1658745254, now seen corresponding path program 1 times [2024-10-11 11:03:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:03:55,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095276379] [2024-10-11 11:03:55,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:03:55,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:03:55,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:03:55,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:03:55,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:03:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:03:56,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:03:56,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:03:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 11:03:56,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:03:56,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:03:56,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095276379] [2024-10-11 11:03:56,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095276379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:03:56,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:03:56,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:03:56,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878086893] [2024-10-11 11:03:56,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:03:56,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:03:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:03:56,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:03:56,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:03:56,715 INFO L87 Difference]: Start difference. First operand 90 states and 142 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 11:04:01,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:04:05,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:04:09,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:04:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:09,394 INFO L93 Difference]: Finished difference Result 197 states and 309 transitions. [2024-10-11 11:04:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:04:09,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 221 [2024-10-11 11:04:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:09,399 INFO L225 Difference]: With dead ends: 197 [2024-10-11 11:04:09,399 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 11:04:09,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:04:09,404 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 18 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:09,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 269 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2024-10-11 11:04:09,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 11:04:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2024-10-11 11:04:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 11:04:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2024-10-11 11:04:09,423 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 221 [2024-10-11 11:04:09,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:09,428 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2024-10-11 11:04:09,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 11:04:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2024-10-11 11:04:09,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 11:04:09,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:09,435 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:04:09,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 11:04:09,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:04:09,636 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:09,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:09,637 INFO L85 PathProgramCache]: Analyzing trace with hash 879411542, now seen corresponding path program 1 times [2024-10-11 11:04:09,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:04:09,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954843499] [2024-10-11 11:04:09,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:09,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:04:09,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:04:09,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:04:09,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 11:04:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:10,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:04:10,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:04:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 11:04:10,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:04:10,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:04:10,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954843499] [2024-10-11 11:04:10,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954843499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:04:10,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:04:10,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:04:10,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207152683] [2024-10-11 11:04:10,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:04:10,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:04:10,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:04:10,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:04:10,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:04:10,972 INFO L87 Difference]: Start difference. First operand 97 states and 152 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 11:04:15,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:04:19,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:04:23,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:04:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:23,720 INFO L93 Difference]: Finished difference Result 232 states and 357 transitions. [2024-10-11 11:04:23,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:04:23,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-10-11 11:04:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:23,723 INFO L225 Difference]: With dead ends: 232 [2024-10-11 11:04:23,723 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 11:04:23,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:04:23,727 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 38 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:23,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 267 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2024-10-11 11:04:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 11:04:23,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2024-10-11 11:04:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 88 states have internal predecessors, (117), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 11:04:23,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 203 transitions. [2024-10-11 11:04:23,739 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 203 transitions. Word has length 222 [2024-10-11 11:04:23,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:23,740 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 203 transitions. [2024-10-11 11:04:23,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 11:04:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 203 transitions. [2024-10-11 11:04:23,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 11:04:23,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:23,744 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:04:23,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 11:04:23,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:04:23,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:23,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:23,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1640548392, now seen corresponding path program 1 times [2024-10-11 11:04:23,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:04:23,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437696935] [2024-10-11 11:04:23,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:23,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-11 11:04:23,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:04:23,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:04:23,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 11:04:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:25,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-11 11:04:25,352 INFO L278 TraceCheckSpWp]: Computing forward predicates...