/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 23:13:25,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 23:13:25,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 23:13:25,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 23:13:25,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 23:13:25,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 23:13:25,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 23:13:25,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 23:13:25,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 23:13:25,635 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 23:13:25,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 23:13:25,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 23:13:25,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 23:13:25,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 23:13:25,637 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 23:13:25,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 23:13:25,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 23:13:25,637 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 23:13:25,638 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 23:13:25,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 23:13:25,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 23:13:25,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 23:13:25,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 23:13:25,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 23:13:25,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 23:13:25,639 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 23:13:25,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 23:13:25,640 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 23:13:25,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 23:13:25,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 23:13:25,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 23:13:25,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 23:13:25,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 23:13:25,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 23:13:25,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 23:13:25,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 23:13:25,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 23:13:25,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 23:13:25,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 23:13:25,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 23:13:25,642 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 23:13:25,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 23:13:25,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 23:13:25,642 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: Use bitabs translation -> false [2023-12-20 23:13:25,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 23:13:25,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 23:13:25,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 23:13:25,820 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 23:13:25,822 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 23:13:25,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-12-20 23:13:26,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 23:13:26,860 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 23:13:26,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-12-20 23:13:26,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0cb3849/4fe14c28e48d4d31806a3c7c3811cfcf/FLAGa5b323288 [2023-12-20 23:13:26,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0cb3849/4fe14c28e48d4d31806a3c7c3811cfcf [2023-12-20 23:13:26,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 23:13:26,881 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 23:13:26,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 23:13:26,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 23:13:26,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 23:13:26,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:13:26" (1/1) ... [2023-12-20 23:13:26,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aaf6af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:13:26, skipping insertion in model container [2023-12-20 23:13:26,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:13:26" (1/1) ... [2023-12-20 23:13:26,916 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 23:13:27,041 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2023-12-20 23:13:27,109 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 23:13:27,116 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 23:13:27,128 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2023-12-20 23:13:27,156 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 23:13:27,169 INFO L206 MainTranslator]: Completed translation [2023-12-20 23:13:27,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:13:27 WrapperNode [2023-12-20 23:13:27,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 23:13:27,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 23:13:27,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 23:13:27,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 23:13:27,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:13:27" (1/1) ... [2023-12-20 23:13:27,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:13:27" (1/1) ... [2023-12-20 23:13:27,221 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2023-12-20 23:13:27,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 23:13:27,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 23:13:27,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 23:13:27,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 23:13:27,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:13:27" (1/1) ... [2023-12-20 23:13:27,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:13:27" (1/1) ... [2023-12-20 23:13:27,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:13:27" (1/1) ... [2023-12-20 23:13:27,256 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]. [2023-12-20 23:13:27,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:13:27" (1/1) ... [2023-12-20 23:13:27,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:13:27" (1/1) ... [2023-12-20 23:13:27,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:13:27" (1/1) ... [2023-12-20 23:13:27,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:13:27" (1/1) ... [2023-12-20 23:13:27,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:13:27" (1/1) ... [2023-12-20 23:13:27,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:13:27" (1/1) ... [2023-12-20 23:13:27,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 23:13:27,269 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 23:13:27,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 23:13:27,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 23:13:27,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:13:27" (1/1) ... [2023-12-20 23:13:27,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 23:13:27,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 23:13:27,301 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) [2023-12-20 23:13:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 23:13:27,325 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 23:13:27,325 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 23:13:27,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 23:13:27,324 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 [2023-12-20 23:13:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 23:13:27,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 23:13:27,382 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 23:13:27,383 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 23:13:27,598 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 23:13:27,650 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 23:13:27,650 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 23:13:27,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:13:27 BoogieIcfgContainer [2023-12-20 23:13:27,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 23:13:27,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 23:13:27,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 23:13:27,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 23:13:27,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 11:13:26" (1/3) ... [2023-12-20 23:13:27,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb22502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:13:27, skipping insertion in model container [2023-12-20 23:13:27,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:13:27" (2/3) ... [2023-12-20 23:13:27,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb22502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:13:27, skipping insertion in model container [2023-12-20 23:13:27,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:13:27" (3/3) ... [2023-12-20 23:13:27,657 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-12-20 23:13:27,668 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 23:13:27,668 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 23:13:27,695 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 23:13:27,699 INFO L357 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, mHoare=true, 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;@2d90e578, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 23:13:27,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 23:13:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 23:13:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-20 23:13:27,709 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:13:27,709 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:13:27,710 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:13:27,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:13:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash 23042951, now seen corresponding path program 1 times [2023-12-20 23:13:27,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:13:27,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390933650] [2023-12-20 23:13:27,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:13:27,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:13:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:27,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:13:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:27,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:13:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:27,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:13:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:27,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:13:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:27,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:13:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:27,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:13:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:27,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:13:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 23:13:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 23:13:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 23:13:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 23:13:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 23:13:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 23:13:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 23:13:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 23:13:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 23:13:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 23:13:28,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:13:28,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390933650] [2023-12-20 23:13:28,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390933650] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:13:28,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:13:28,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 23:13:28,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986565966] [2023-12-20 23:13:28,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:13:28,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 23:13:28,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:13:28,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 23:13:28,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 23:13:28,091 INFO L87 Difference]: Start difference. First operand has 54 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 23:13:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:13:28,138 INFO L93 Difference]: Finished difference Result 107 states and 179 transitions. [2023-12-20 23:13:28,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 23:13:28,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2023-12-20 23:13:28,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:13:28,146 INFO L225 Difference]: With dead ends: 107 [2023-12-20 23:13:28,146 INFO L226 Difference]: Without dead ends: 52 [2023-12-20 23:13:28,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 23:13:28,153 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 23:13:28,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 23:13:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-20 23:13:28,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-12-20 23:13:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 23:13:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2023-12-20 23:13:28,186 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 108 [2023-12-20 23:13:28,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:13:28,187 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. [2023-12-20 23:13:28,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 23:13:28,187 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2023-12-20 23:13:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-20 23:13:28,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:13:28,191 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:13:28,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 23:13:28,191 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:13:28,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:13:28,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2063703469, now seen corresponding path program 1 times [2023-12-20 23:13:28,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:13:28,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914832834] [2023-12-20 23:13:28,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:13:28,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:13:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:13:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:13:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:13:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:13:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:13:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:13:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:13:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 23:13:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 23:13:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 23:13:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 23:13:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 23:13:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 23:13:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 23:13:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 23:13:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 23:13:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 23:13:28,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:13:28,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914832834] [2023-12-20 23:13:28,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914832834] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:13:28,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:13:28,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 23:13:28,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856972423] [2023-12-20 23:13:28,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:13:28,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 23:13:28,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:13:28,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 23:13:28,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 23:13:28,409 INFO L87 Difference]: Start difference. First operand 52 states and 77 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 23:13:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:13:28,458 INFO L93 Difference]: Finished difference Result 119 states and 176 transitions. [2023-12-20 23:13:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 23:13:28,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2023-12-20 23:13:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:13:28,460 INFO L225 Difference]: With dead ends: 119 [2023-12-20 23:13:28,460 INFO L226 Difference]: Without dead ends: 68 [2023-12-20 23:13:28,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 23:13:28,463 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 15 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 23:13:28,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 136 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 23:13:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-20 23:13:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2023-12-20 23:13:28,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 23:13:28,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2023-12-20 23:13:28,470 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 108 [2023-12-20 23:13:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:13:28,471 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2023-12-20 23:13:28,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 23:13:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2023-12-20 23:13:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-20 23:13:28,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:13:28,472 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:13:28,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 23:13:28,472 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:13:28,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:13:28,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1902623251, now seen corresponding path program 1 times [2023-12-20 23:13:28,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:13:28,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814779641] [2023-12-20 23:13:28,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:13:28,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:13:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:13:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:13:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:13:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:13:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:13:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:13:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:13:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 23:13:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 23:13:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 23:13:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 23:13:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 23:13:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 23:13:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 23:13:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 23:13:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 23:13:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:13:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 23:13:28,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:13:28,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814779641] [2023-12-20 23:13:28,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814779641] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:13:28,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:13:28,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 23:13:28,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284343344] [2023-12-20 23:13:28,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:13:28,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 23:13:28,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:13:28,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 23:13:28,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 23:13:28,973 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 23:13:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:13:29,141 INFO L93 Difference]: Finished difference Result 179 states and 263 transitions. [2023-12-20 23:13:29,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 23:13:29,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2023-12-20 23:13:29,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:13:29,147 INFO L225 Difference]: With dead ends: 179 [2023-12-20 23:13:29,147 INFO L226 Difference]: Without dead ends: 120 [2023-12-20 23:13:29,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 23:13:29,150 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 79 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 23:13:29,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 239 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 23:13:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-20 23:13:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2023-12-20 23:13:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 58 states have internal predecessors, (72), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-20 23:13:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2023-12-20 23:13:29,164 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 108 [2023-12-20 23:13:29,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:13:29,165 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2023-12-20 23:13:29,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 23:13:29,165 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2023-12-20 23:13:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-20 23:13:29,166 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:13:29,166 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:13:29,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 23:13:29,166 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:13:29,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:13:29,167 INFO L85 PathProgramCache]: Analyzing trace with hash 622759573, now seen corresponding path program 1 times [2023-12-20 23:13:29,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:13:29,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253220675] [2023-12-20 23:13:29,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:13:29,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:13:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 23:13:29,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 23:13:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 23:13:29,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 23:13:29,304 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 23:13:29,305 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 23:13:29,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 23:13:29,308 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-20 23:13:29,311 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 23:13:29,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 11:13:29 BoogieIcfgContainer [2023-12-20 23:13:29,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 23:13:29,383 INFO L158 Benchmark]: Toolchain (without parser) took 2502.14ms. Allocated memory was 211.8MB in the beginning and 281.0MB in the end (delta: 69.2MB). Free memory was 163.6MB in the beginning and 151.0MB in the end (delta: 12.5MB). Peak memory consumption was 82.6MB. Max. memory is 8.0GB. [2023-12-20 23:13:29,383 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 211.8MB. Free memory is still 158.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 23:13:29,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.12ms. Allocated memory is still 211.8MB. Free memory was 163.2MB in the beginning and 148.7MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-20 23:13:29,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.24ms. Allocated memory is still 211.8MB. Free memory was 148.7MB in the beginning and 145.4MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 23:13:29,386 INFO L158 Benchmark]: Boogie Preprocessor took 45.68ms. Allocated memory is still 211.8MB. Free memory was 145.4MB in the beginning and 140.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-20 23:13:29,387 INFO L158 Benchmark]: RCFGBuilder took 382.20ms. Allocated memory was 211.8MB in the beginning and 281.0MB in the end (delta: 69.2MB). Free memory was 140.2MB in the beginning and 248.5MB in the end (delta: -108.3MB). Peak memory consumption was 24.5MB. Max. memory is 8.0GB. [2023-12-20 23:13:29,387 INFO L158 Benchmark]: TraceAbstraction took 1730.68ms. Allocated memory is still 281.0MB. Free memory was 248.0MB in the beginning and 151.0MB in the end (delta: 96.9MB). Peak memory consumption was 96.9MB. Max. memory is 8.0GB. [2023-12-20 23:13:29,391 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.38ms. Allocated memory is still 211.8MB. Free memory is still 158.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 287.12ms. Allocated memory is still 211.8MB. Free memory was 163.2MB in the beginning and 148.7MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.24ms. Allocated memory is still 211.8MB. Free memory was 148.7MB in the beginning and 145.4MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.68ms. Allocated memory is still 211.8MB. Free memory was 145.4MB in the beginning and 140.2MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 382.20ms. Allocated memory was 211.8MB in the beginning and 281.0MB in the end (delta: 69.2MB). Free memory was 140.2MB in the beginning and 248.5MB in the end (delta: -108.3MB). Peak memory consumption was 24.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1730.68ms. Allocated memory is still 281.0MB. Free memory was 248.0MB in the beginning and 151.0MB in the end (delta: 96.9MB). Peak memory consumption was 96.9MB. Max. memory is 8.0GB. * 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 someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of bitwise operation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; [L128] isInitial = 1 [L129] FCALL initially() [L130] int k_loop; [L131] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L131] COND TRUE k_loop < 1 [L132] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 [L132] RET updateLastVariables() [L133] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L133] RET updateVariables() [L134] CALL step() [L48] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L58] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L61] var_1_32 = var_1_16 [L62] var_1_30 = var_1_32 [L63] unsigned char stepLocal_0 = var_1_13; [L64] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=126, var_1_31=64, var_1_32=126, var_1_7=0] [L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L65] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=126, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=126, var_1_31=64, var_1_32=126, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=126, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=126, var_1_31=64, var_1_32=126, var_1_7=0] [L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L71] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=126, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=505, var_1_1=-126, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=126, var_1_31=64, var_1_32=126, var_1_7=0] [L79] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=126, var_1_11=126, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=505, var_1_1=-126, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=126, var_1_31=64, var_1_32=126, var_1_7=0] [L80] COND TRUE ! var_1_7 [L81] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=126, var_1_11=126, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=505, var_1_1=-126, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=126, var_1_31=64, var_1_32=126, var_1_7=0] [L134] RET step() [L135] CALL, EXPR property() [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) [L124] EXPR var_1_32 >> var_1_32 [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=126, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=505, var_1_1=-126, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=126, var_1_31=64, var_1_32=126, var_1_7=0] [L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=126, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=505, var_1_1=-126, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=126, var_1_31=64, var_1_32=126, var_1_7=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=126, var_1_13=64, var_1_15=126, var_1_16=126, var_1_17=505, var_1_1=-126, var_1_22=505, var_1_24=0, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=126, var_1_31=64, var_1_32=126, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 449 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 232 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 217 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=3, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 35 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1440/1440 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 [2023-12-20 23:13:29,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...