./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 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ea896f7bc04be31a5c6c97a4f6cc7d6fac7c26e247bcad19aec81c3c1b0a6a7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:10:59,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:10:59,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:10:59,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:10:59,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:10:59,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:10:59,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:10:59,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:10:59,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:10:59,526 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:10:59,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:10:59,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:10:59,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:10:59,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:10:59,528 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:10:59,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:10:59,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:10:59,529 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:10:59,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:10:59,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:10:59,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:10:59,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:10:59,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:10:59,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:10:59,532 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:10:59,533 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:10:59,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:10:59,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:10:59,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:10:59,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:10:59,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:10:59,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:10:59,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:10:59,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:10:59,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:10:59,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:10:59,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:10:59,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:10:59,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:10:59,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:10:59,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:10:59,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:10:59,539 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ea896f7bc04be31a5c6c97a4f6cc7d6fac7c26e247bcad19aec81c3c1b0a6a7 [2024-10-14 11:10:59,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:10:59,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:10:59,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:10:59,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:10:59,885 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:10:59,886 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-14 11:11:01,326 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:11:01,526 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:11:01,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i [2024-10-14 11:11:01,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73bdce797/0afc19c79af5499494aa68ba6ba61190/FLAG94e912448 [2024-10-14 11:11:01,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73bdce797/0afc19c79af5499494aa68ba6ba61190 [2024-10-14 11:11:01,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:11:01,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:11:01,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:11:01,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:11:01,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:11:01,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:11:01" (1/1) ... [2024-10-14 11:11:01,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3da33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:01, skipping insertion in model container [2024-10-14 11:11:01,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:11:01" (1/1) ... [2024-10-14 11:11:01,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:11:01,753 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-14 11:11:01,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:11:01,849 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:11:01,861 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-14 11:11:01,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:11:01,915 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:11:01,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:01 WrapperNode [2024-10-14 11:11:01,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:11:01,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:11:01,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:11:01,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:11:01,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:01" (1/1) ... [2024-10-14 11:11:01,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:01" (1/1) ... [2024-10-14 11:11:01,973 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 259 [2024-10-14 11:11:01,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:11:01,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:11:01,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:11:01,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:11:01,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:01" (1/1) ... [2024-10-14 11:11:01,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:01" (1/1) ... [2024-10-14 11:11:01,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:01" (1/1) ... [2024-10-14 11:11:02,010 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:11:02,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:01" (1/1) ... [2024-10-14 11:11:02,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:01" (1/1) ... [2024-10-14 11:11:02,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:01" (1/1) ... [2024-10-14 11:11:02,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:01" (1/1) ... [2024-10-14 11:11:02,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:01" (1/1) ... [2024-10-14 11:11:02,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:01" (1/1) ... [2024-10-14 11:11:02,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:11:02,054 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:11:02,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:11:02,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:11:02,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:01" (1/1) ... [2024-10-14 11:11:02,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:11:02,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:11:02,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:11:02,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:11:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:11:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:11:02,134 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:11:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:11:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:11:02,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:11:02,218 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:11:02,220 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:11:02,574 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-14 11:11:02,574 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:11:02,642 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:11:02,646 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:11:02,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:11:02 BoogieIcfgContainer [2024-10-14 11:11:02,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:11:02,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:11:02,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:11:02,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:11:02,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:11:01" (1/3) ... [2024-10-14 11:11:02,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd0663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:11:02, skipping insertion in model container [2024-10-14 11:11:02,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:01" (2/3) ... [2024-10-14 11:11:02,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd0663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:11:02, skipping insertion in model container [2024-10-14 11:11:02,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:11:02" (3/3) ... [2024-10-14 11:11:02,656 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-2.i [2024-10-14 11:11:02,669 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:11:02,669 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:11:02,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:11:02,764 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;@79365638, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:11:02,765 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:11:02,768 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-14 11:11:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-14 11:11:02,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:11:02,788 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-14 11:11:02,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:11:02,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:11:02,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1917984191, now seen corresponding path program 1 times [2024-10-14 11:11:02,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:11:02,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650485978] [2024-10-14 11:11:02,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:11:02,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:11:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:11:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:11:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:11:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:11:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:11:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:11:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:11:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:11:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:11:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:11:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:11:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:11:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:11:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:11:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:11:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:11:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 11:11:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:11:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 11:11:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:11:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:11:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:11:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:11:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:11:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:11:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:11:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:11:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 11:11:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:11:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 11:11:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:11:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 11:11:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 11:11:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 11:11:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 11:11:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 11:11:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,303 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-14 11:11:03,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:11:03,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650485978] [2024-10-14 11:11:03,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650485978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:11:03,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:11:03,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:11:03,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768625303] [2024-10-14 11:11:03,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:11:03,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:11:03,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:11:03,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:11:03,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:11:03,332 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-14 11:11:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:11:03,384 INFO L93 Difference]: Finished difference Result 205 states and 365 transitions. [2024-10-14 11:11:03,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:11:03,386 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-14 11:11:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:11:03,392 INFO L225 Difference]: With dead ends: 205 [2024-10-14 11:11:03,392 INFO L226 Difference]: Without dead ends: 101 [2024-10-14 11:11:03,397 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-14 11:11:03,399 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-14 11:11:03,400 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-14 11:11:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-14 11:11:03,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-14 11:11:03,436 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-14 11:11:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 160 transitions. [2024-10-14 11:11:03,443 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 160 transitions. Word has length 224 [2024-10-14 11:11:03,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:11:03,444 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 160 transitions. [2024-10-14 11:11:03,444 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-14 11:11:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 160 transitions. [2024-10-14 11:11:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-14 11:11:03,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:11:03,451 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-14 11:11:03,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:11:03,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:11:03,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:11:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1405302781, now seen corresponding path program 1 times [2024-10-14 11:11:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:11:03,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200176225] [2024-10-14 11:11:03,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:11:03,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:11:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:11:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:11:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:11:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:11:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:11:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:11:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:11:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:11:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:11:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:11:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:11:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:11:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:11:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:11:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:11:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:11:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 11:11:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:11:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 11:11:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:11:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:11:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:11:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:11:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:11:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:11:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:11:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:11:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 11:11:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:11:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 11:11:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:11:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 11:11:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 11:11:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 11:11:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 11:11:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 11:11:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,775 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-14 11:11:03,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:11:03,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200176225] [2024-10-14 11:11:03,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200176225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:11:03,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:11:03,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:11:03,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782410347] [2024-10-14 11:11:03,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:11:03,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:11:03,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:11:03,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:11:03,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:11:03,785 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-14 11:11:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:11:03,832 INFO L93 Difference]: Finished difference Result 230 states and 363 transitions. [2024-10-14 11:11:03,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:11:03,832 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-14 11:11:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:11:03,835 INFO L225 Difference]: With dead ends: 230 [2024-10-14 11:11:03,835 INFO L226 Difference]: Without dead ends: 130 [2024-10-14 11:11:03,836 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-14 11:11:03,837 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-14 11:11:03,837 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-14 11:11:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-14 11:11:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2024-10-14 11:11:03,847 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-14 11:11:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 170 transitions. [2024-10-14 11:11:03,849 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 170 transitions. Word has length 224 [2024-10-14 11:11:03,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:11:03,850 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 170 transitions. [2024-10-14 11:11:03,850 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-14 11:11:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 170 transitions. [2024-10-14 11:11:03,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-14 11:11:03,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:11:03,853 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-14 11:11:03,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:11:03,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:11:03,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:11:03,854 INFO L85 PathProgramCache]: Analyzing trace with hash 571971239, now seen corresponding path program 1 times [2024-10-14 11:11:03,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:11:03,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620920608] [2024-10-14 11:11:03,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:11:03,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:11:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:11:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:11:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:11:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:11:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:11:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:11:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:03,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:11:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:11:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:11:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:11:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:11:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:11:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:11:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:11:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:11:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:11:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 11:11:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:11:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 11:11:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:11:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:11:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:11:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:11:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:11:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:11:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:11:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:11:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 11:11:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:11:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 11:11:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:11:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 11:11:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 11:11:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 11:11:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 11:11:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 11:11:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:04,052 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-14 11:11:04,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:11:04,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620920608] [2024-10-14 11:11:04,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620920608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:11:04,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:11:04,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:11:04,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810581042] [2024-10-14 11:11:04,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:11:04,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:11:04,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:11:04,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:11:04,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:11:04,058 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-14 11:11:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:11:04,114 INFO L93 Difference]: Finished difference Result 265 states and 411 transitions. [2024-10-14 11:11:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:11:04,115 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-14 11:11:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:11:04,119 INFO L225 Difference]: With dead ends: 265 [2024-10-14 11:11:04,121 INFO L226 Difference]: Without dead ends: 158 [2024-10-14 11:11:04,122 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-14 11:11:04,123 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-14 11:11:04,123 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-14 11:11:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-14 11:11:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2024-10-14 11:11:04,144 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-14 11:11:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 239 transitions. [2024-10-14 11:11:04,146 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 239 transitions. Word has length 225 [2024-10-14 11:11:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:11:04,147 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 239 transitions. [2024-10-14 11:11:04,147 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-14 11:11:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2024-10-14 11:11:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-14 11:11:04,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:11:04,152 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-14 11:11:04,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:11:04,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:11:04,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:11:04,153 INFO L85 PathProgramCache]: Analyzing trace with hash 178944229, now seen corresponding path program 1 times [2024-10-14 11:11:04,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:11:04,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007952137] [2024-10-14 11:11:04,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:11:04,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:11:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:11:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:11:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:11:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:11:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:11:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:11:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:11:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:11:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:11:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:11:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:11:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:11:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:11:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:11:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:11:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:11:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 11:11:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:11:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 11:11:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:11:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:11:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:11:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:11:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:11:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:11:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:11:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:11:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 11:11:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:11:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 11:11:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:11:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 11:11:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 11:11:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 11:11:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 11:11:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 11:11:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,545 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-14 11:11:06,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:11:06,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007952137] [2024-10-14 11:11:06,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007952137] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:11:06,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961290380] [2024-10-14 11:11:06,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:11:06,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:11:06,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:11:06,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:11:06,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 11:11:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:06,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 11:11:06,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:11:08,203 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-14 11:11:08,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:11:10,150 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-14 11:11:10,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961290380] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:11:10,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 11:11:10,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 36 [2024-10-14 11:11:10,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106004244] [2024-10-14 11:11:10,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 11:11:10,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-14 11:11:10,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:11:10,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-14 11:11:10,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2024-10-14 11:11:10,156 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-14 11:11:22,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:11:22,921 INFO L93 Difference]: Finished difference Result 1556 states and 2207 transitions. [2024-10-14 11:11:22,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2024-10-14 11:11:22,922 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-14 11:11:22,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:11:22,946 INFO L225 Difference]: With dead ends: 1556 [2024-10-14 11:11:22,946 INFO L226 Difference]: Without dead ends: 1402 [2024-10-14 11:11:22,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7273 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=4498, Invalid=17852, Unknown=0, NotChecked=0, Total=22350 [2024-10-14 11:11:22,959 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 1993 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 3457 mSolverCounterSat, 1211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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, 4.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:11:22,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2026 Valid, 1456 Invalid, 4668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1211 Valid, 3457 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-14 11:11:22,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2024-10-14 11:11:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 439. [2024-10-14 11:11:23,054 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-14 11:11:23,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 653 transitions. [2024-10-14 11:11:23,058 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 653 transitions. Word has length 225 [2024-10-14 11:11:23,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:11:23,060 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 653 transitions. [2024-10-14 11:11:23,060 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-14 11:11:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 653 transitions. [2024-10-14 11:11:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-14 11:11:23,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:11:23,066 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-14 11:11:23,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 11:11:23,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:11:23,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:11:23,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:11:23,270 INFO L85 PathProgramCache]: Analyzing trace with hash 236202531, now seen corresponding path program 1 times [2024-10-14 11:11:23,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:11:23,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445647624] [2024-10-14 11:11:23,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:11:23,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:11:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 11:11:23,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [279745331] [2024-10-14 11:11:23,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:11:23,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:11:23,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:11:23,451 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:11:23,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 11:11:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:11:23,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:11:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:11:23,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:11:23,788 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:11:23,788 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:11:23,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 11:11:23,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:11:23,996 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 11:11:24,137 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:11:24,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:11:24 BoogieIcfgContainer [2024-10-14 11:11:24,140 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:11:24,141 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:11:24,141 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:11:24,141 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:11:24,141 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:11:02" (3/4) ... [2024-10-14 11:11:24,143 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:11:24,144 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:11:24,145 INFO L158 Benchmark]: Toolchain (without parser) took 22589.67ms. Allocated memory was 134.2MB in the beginning and 490.7MB in the end (delta: 356.5MB). Free memory was 64.2MB in the beginning and 247.9MB in the end (delta: -183.6MB). Peak memory consumption was 173.2MB. Max. memory is 16.1GB. [2024-10-14 11:11:24,145 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory was 100.4MB in the beginning and 100.4MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:11:24,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.79ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 64.1MB in the beginning and 144.9MB in the end (delta: -80.8MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-10-14 11:11:24,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.49ms. Allocated memory is still 186.6MB. Free memory was 144.9MB in the beginning and 140.5MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:11:24,146 INFO L158 Benchmark]: Boogie Preprocessor took 78.83ms. Allocated memory is still 186.6MB. Free memory was 140.5MB in the beginning and 133.3MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 11:11:24,146 INFO L158 Benchmark]: RCFGBuilder took 592.97ms. Allocated memory is still 186.6MB. Free memory was 132.5MB in the beginning and 95.6MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-14 11:11:24,146 INFO L158 Benchmark]: TraceAbstraction took 21492.16ms. Allocated memory was 186.6MB in the beginning and 490.7MB in the end (delta: 304.1MB). Free memory was 94.7MB in the beginning and 248.9MB in the end (delta: -154.2MB). Peak memory consumption was 150.5MB. Max. memory is 16.1GB. [2024-10-14 11:11:24,147 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 490.7MB. Free memory is still 247.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:11:24,148 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.13ms. Allocated memory is still 134.2MB. Free memory was 100.4MB in the beginning and 100.4MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.79ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 64.1MB in the beginning and 144.9MB in the end (delta: -80.8MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.49ms. Allocated memory is still 186.6MB. Free memory was 144.9MB in the beginning and 140.5MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.83ms. Allocated memory is still 186.6MB. Free memory was 140.5MB in the beginning and 133.3MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 592.97ms. Allocated memory is still 186.6MB. Free memory was 132.5MB in the beginning and 95.6MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21492.16ms. Allocated memory was 186.6MB in the beginning and 490.7MB in the end (delta: 304.1MB). Free memory was 94.7MB in the beginning and 248.9MB in the end (delta: -154.2MB). Peak memory consumption was 150.5MB. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 490.7MB. Free memory is still 247.9MB. 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: 21.3s, OverallIterations: 5, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2118 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2085 mSDsluCounter, 2218 SdHoareTripleChecker+Invalid, 3.8s 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.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 932 GetRequests, 782 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7273 ImplicationChecksByTransitivity, 9.1s 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, 6.4s 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-14 11:11:24,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ea896f7bc04be31a5c6c97a4f6cc7d6fac7c26e247bcad19aec81c3c1b0a6a7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:11:26,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:11:26,333 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:11:26,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:11:26,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:11:26,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:11:26,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:11:26,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:11:26,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:11:26,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:11:26,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:11:26,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:11:26,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:11:26,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:11:26,386 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:11:26,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:11:26,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:11:26,387 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:11:26,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:11:26,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:11:26,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:11:26,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:11:26,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:11:26,395 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:11:26,395 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:11:26,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:11:26,396 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:11:26,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:11:26,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:11:26,396 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:11:26,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:11:26,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:11:26,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:11:26,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:11:26,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:11:26,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:11:26,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:11:26,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:11:26,398 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:11:26,398 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:11:26,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:11:26,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:11:26,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:11:26,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:11:26,399 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:11:26,400 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ea896f7bc04be31a5c6c97a4f6cc7d6fac7c26e247bcad19aec81c3c1b0a6a7 [2024-10-14 11:11:26,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:11:26,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:11:26,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:11:26,684 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:11:26,685 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:11:26,686 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-14 11:11:28,207 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:11:28,493 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:11:28,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i [2024-10-14 11:11:28,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38c61498/1d9eef2b01634080b8bf17bb924e2e04/FLAG9235d848e [2024-10-14 11:11:28,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38c61498/1d9eef2b01634080b8bf17bb924e2e04 [2024-10-14 11:11:28,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:11:28,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:11:28,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:11:28,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:11:28,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:11:28,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:11:28" (1/1) ... [2024-10-14 11:11:28,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31094a52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:28, skipping insertion in model container [2024-10-14 11:11:28,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:11:28" (1/1) ... [2024-10-14 11:11:28,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:11:29,001 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-14 11:11:29,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:11:29,099 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:11:29,112 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-14 11:11:29,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:11:29,176 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:11:29,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:29 WrapperNode [2024-10-14 11:11:29,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:11:29,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:11:29,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:11:29,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:11:29,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:29" (1/1) ... [2024-10-14 11:11:29,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:29" (1/1) ... [2024-10-14 11:11:29,247 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2024-10-14 11:11:29,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:11:29,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:11:29,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:11:29,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:11:29,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:29" (1/1) ... [2024-10-14 11:11:29,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:29" (1/1) ... [2024-10-14 11:11:29,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:29" (1/1) ... [2024-10-14 11:11:29,299 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:11:29,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:29" (1/1) ... [2024-10-14 11:11:29,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:29" (1/1) ... [2024-10-14 11:11:29,325 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:29" (1/1) ... [2024-10-14 11:11:29,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:29" (1/1) ... [2024-10-14 11:11:29,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:29" (1/1) ... [2024-10-14 11:11:29,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:29" (1/1) ... [2024-10-14 11:11:29,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:11:29,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:11:29,370 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:11:29,370 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:11:29,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:29" (1/1) ... [2024-10-14 11:11:29,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:11:29,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:11:29,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:11:29,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:11:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:11:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:11:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:11:29,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:11:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:11:29,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:11:29,575 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:11:29,577 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:11:45,633 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-14 11:11:45,633 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:11:45,738 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:11:45,742 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:11:45,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:11:45 BoogieIcfgContainer [2024-10-14 11:11:45,743 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:11:45,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:11:45,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:11:45,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:11:45,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:11:28" (1/3) ... [2024-10-14 11:11:45,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f87de06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:11:45, skipping insertion in model container [2024-10-14 11:11:45,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:29" (2/3) ... [2024-10-14 11:11:45,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f87de06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:11:45, skipping insertion in model container [2024-10-14 11:11:45,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:11:45" (3/3) ... [2024-10-14 11:11:45,751 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-2.i [2024-10-14 11:11:45,765 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:11:45,765 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:11:45,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:11:45,824 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;@22362e73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:11:45,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:11:45,829 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-14 11:11:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-14 11:11:45,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:11:45,846 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-14 11:11:45,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:11:45,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:11:45,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1876120938, now seen corresponding path program 1 times [2024-10-14 11:11:45,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:11:45,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567284683] [2024-10-14 11:11:45,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:11:45,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:11:45,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:11:45,865 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:11:45,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 11:11:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:47,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:11:47,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:11:47,111 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-14 11:11:47,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:11:47,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:11:47,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567284683] [2024-10-14 11:11:47,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567284683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:11:47,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:11:47,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:11:47,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136422824] [2024-10-14 11:11:47,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:11:47,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:11:47,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:11:47,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:11:47,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:11:47,157 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-14 11:11:51,574 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-14 11:11:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:11:51,729 INFO L93 Difference]: Finished difference Result 183 states and 329 transitions. [2024-10-14 11:11:51,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:11:51,732 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-14 11:11:51,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:11:51,741 INFO L225 Difference]: With dead ends: 183 [2024-10-14 11:11:51,741 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 11:11:51,744 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-14 11:11:51,748 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 11:11:51,749 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.5s Time] [2024-10-14 11:11:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 11:11:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-14 11:11:51,789 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-14 11:11:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 142 transitions. [2024-10-14 11:11:51,793 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 142 transitions. Word has length 221 [2024-10-14 11:11:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:11:51,793 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 142 transitions. [2024-10-14 11:11:51,793 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-14 11:11:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 142 transitions. [2024-10-14 11:11:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-14 11:11:51,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:11:51,800 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-14 11:11:51,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 11:11:52,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:11:52,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:11:52,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:11:52,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1658745254, now seen corresponding path program 1 times [2024-10-14 11:11:52,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:11:52,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667220751] [2024-10-14 11:11:52,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:11:52,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:11:52,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:11:52,009 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:11:52,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 11:11:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:11:53,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 11:11:53,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:11:53,460 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-14 11:11:53,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:11:53,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:11:53,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667220751] [2024-10-14 11:11:53,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667220751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:11:53,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:11:53,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:11:53,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535216162] [2024-10-14 11:11:53,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:11:53,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:11:53,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:11:53,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:11:53,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:11:53,464 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-14 11:11:58,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:12:02,032 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-14 11:12:06,046 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-14 11:12:06,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:12:06,273 INFO L93 Difference]: Finished difference Result 197 states and 309 transitions. [2024-10-14 11:12:06,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:12:06,274 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-14 11:12:06,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:12:06,284 INFO L225 Difference]: With dead ends: 197 [2024-10-14 11:12:06,284 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 11:12:06,285 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-14 11:12:06,286 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 18 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s 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.8s IncrementalHoareTripleChecker+Time [2024-10-14 11:12:06,287 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.8s Time] [2024-10-14 11:12:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 11:12:06,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2024-10-14 11:12:06,307 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-14 11:12:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2024-10-14 11:12:06,310 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 221 [2024-10-14 11:12:06,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:12:06,312 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2024-10-14 11:12:06,312 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-14 11:12:06,314 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2024-10-14 11:12:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-14 11:12:06,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:12:06,319 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-14 11:12:06,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 11:12:06,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:12:06,520 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:12:06,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:12:06,521 INFO L85 PathProgramCache]: Analyzing trace with hash 879411542, now seen corresponding path program 1 times [2024-10-14 11:12:06,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:12:06,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320621342] [2024-10-14 11:12:06,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:12:06,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:12:06,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:12:06,525 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:12:06,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 11:12:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:12:07,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 11:12:07,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:12:08,209 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-14 11:12:08,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:12:08,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:12:08,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320621342] [2024-10-14 11:12:08,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320621342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:12:08,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:12:08,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:12:08,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794176217] [2024-10-14 11:12:08,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:12:08,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:12:08,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:12:08,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:12:08,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:12:08,213 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-14 11:12:12,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:12:16,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:12:20,982 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-14 11:12:21,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:12:21,157 INFO L93 Difference]: Finished difference Result 232 states and 357 transitions. [2024-10-14 11:12:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:12:21,157 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-14 11:12:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:12:21,159 INFO L225 Difference]: With dead ends: 232 [2024-10-14 11:12:21,160 INFO L226 Difference]: Without dead ends: 136 [2024-10-14 11:12:21,160 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-14 11:12:21,161 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 38 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s 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.9s IncrementalHoareTripleChecker+Time [2024-10-14 11:12:21,162 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.9s Time] [2024-10-14 11:12:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-14 11:12:21,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2024-10-14 11:12:21,176 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-14 11:12:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 203 transitions. [2024-10-14 11:12:21,178 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 203 transitions. Word has length 222 [2024-10-14 11:12:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:12:21,178 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 203 transitions. [2024-10-14 11:12:21,178 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-14 11:12:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 203 transitions. [2024-10-14 11:12:21,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-14 11:12:21,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:12:21,182 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-14 11:12:21,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 11:12:21,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:12:21,391 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:12:21,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:12:21,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1640548392, now seen corresponding path program 1 times [2024-10-14 11:12:21,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:12:21,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127619001] [2024-10-14 11:12:21,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:12:21,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:12:21,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:12:21,396 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:12:21,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 11:12:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:12:22,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-14 11:12:22,940 INFO L278 TraceCheckSpWp]: Computing forward predicates...