/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_25-while_file-52.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 23:07:05,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 23:07:05,094 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:07:05,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 23:07:05,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 23:07:05,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 23:07:05,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 23:07:05,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 23:07:05,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 23:07:05,114 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 23:07:05,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 23:07:05,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 23:07:05,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 23:07:05,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 23:07:05,115 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 23:07:05,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 23:07:05,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 23:07:05,116 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 23:07:05,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 23:07:05,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 23:07:05,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 23:07:05,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 23:07:05,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 23:07:05,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 23:07:05,118 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 23:07:05,118 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 23:07:05,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 23:07:05,119 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 23:07:05,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 23:07:05,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 23:07:05,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 23:07:05,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 23:07:05,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 23:07:05,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 23:07:05,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 23:07:05,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 23:07:05,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 23:07:05,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 23:07:05,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 23:07:05,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 23:07:05,121 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 23:07:05,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 23:07:05,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 23:07:05,122 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:07:05,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 23:07:05,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 23:07:05,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 23:07:05,286 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 23:07:05,286 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 23:07:05,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-52.i [2023-12-20 23:07:06,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 23:07:06,452 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 23:07:06,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-52.i [2023-12-20 23:07:06,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dff6e65b/eb255fcdaf9c4407a1f5573808660895/FLAG98f026c9a [2023-12-20 23:07:06,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dff6e65b/eb255fcdaf9c4407a1f5573808660895 [2023-12-20 23:07:06,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 23:07:06,474 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 23:07:06,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 23:07:06,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 23:07:06,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 23:07:06,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:07:06" (1/1) ... [2023-12-20 23:07:06,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3126a4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:06, skipping insertion in model container [2023-12-20 23:07:06,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:07:06" (1/1) ... [2023-12-20 23:07:06,498 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 23:07:06,596 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_25-while_file-52.i[915,928] [2023-12-20 23:07:06,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 23:07:06,629 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 23:07:06,636 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_25-while_file-52.i[915,928] [2023-12-20 23:07:06,650 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 23:07:06,659 INFO L206 MainTranslator]: Completed translation [2023-12-20 23:07:06,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:06 WrapperNode [2023-12-20 23:07:06,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 23:07:06,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 23:07:06,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 23:07:06,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 23:07:06,666 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:07:06" (1/1) ... [2023-12-20 23:07:06,671 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:07:06" (1/1) ... [2023-12-20 23:07:06,697 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2023-12-20 23:07:06,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 23:07:06,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 23:07:06,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 23:07:06,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 23:07:06,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:06" (1/1) ... [2023-12-20 23:07:06,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:06" (1/1) ... [2023-12-20 23:07:06,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:06" (1/1) ... [2023-12-20 23:07:06,717 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:07:06,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:06" (1/1) ... [2023-12-20 23:07:06,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:06" (1/1) ... [2023-12-20 23:07:06,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:06" (1/1) ... [2023-12-20 23:07:06,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:06" (1/1) ... [2023-12-20 23:07:06,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:06" (1/1) ... [2023-12-20 23:07:06,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:06" (1/1) ... [2023-12-20 23:07:06,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 23:07:06,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 23:07:06,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 23:07:06,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 23:07:06,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:06" (1/1) ... [2023-12-20 23:07:06,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 23:07:06,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 23:07:06,774 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:07:06,806 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:07:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 23:07:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 23:07:06,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 23:07:06,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 23:07:06,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 23:07:06,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 23:07:06,861 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 23:07:06,863 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 23:07:07,069 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 23:07:07,099 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 23:07:07,100 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 23:07:07,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:07:07 BoogieIcfgContainer [2023-12-20 23:07:07,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 23:07:07,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 23:07:07,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 23:07:07,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 23:07:07,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 11:07:06" (1/3) ... [2023-12-20 23:07:07,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d371b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:07:07, skipping insertion in model container [2023-12-20 23:07:07,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:06" (2/3) ... [2023-12-20 23:07:07,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d371b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:07:07, skipping insertion in model container [2023-12-20 23:07:07,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:07:07" (3/3) ... [2023-12-20 23:07:07,105 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-52.i [2023-12-20 23:07:07,116 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 23:07:07,116 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 23:07:07,156 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 23:07:07,161 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;@6f986f61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 23:07:07,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 23:07:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-20 23:07:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-20 23:07:07,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:07:07,180 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:07,180 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:07:07,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:07:07,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1214595298, now seen corresponding path program 1 times [2023-12-20 23:07:07,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:07:07,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592806725] [2023-12-20 23:07:07,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:07:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:07:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:07:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 23:07:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:07:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 23:07:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:07:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 23:07:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:07:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 23:07:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 23:07:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 23:07:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 23:07:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 23:07:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 23:07:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 23:07:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 23:07:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 23:07:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 23:07:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 23:07:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-20 23:07:07,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:07:07,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592806725] [2023-12-20 23:07:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592806725] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 23:07:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947964600] [2023-12-20 23:07:07,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:07:07,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 23:07:07,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 23:07:07,917 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) [2023-12-20 23:07:07,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 23:07:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:07:08,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-20 23:07:08,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 23:07:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 317 proven. 21 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2023-12-20 23:07:08,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 23:07:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-20 23:07:08,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947964600] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 23:07:08,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 23:07:08,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-12-20 23:07:08,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767892635] [2023-12-20 23:07:08,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 23:07:08,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 23:07:08,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:07:08,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 23:07:08,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-20 23:07:08,391 INFO L87 Difference]: Start difference. First operand has 46 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2023-12-20 23:07:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:07:09,100 INFO L93 Difference]: Finished difference Result 191 states and 344 transitions. [2023-12-20 23:07:09,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-20 23:07:09,102 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 109 [2023-12-20 23:07:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:07:09,108 INFO L225 Difference]: With dead ends: 191 [2023-12-20 23:07:09,108 INFO L226 Difference]: Without dead ends: 146 [2023-12-20 23:07:09,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2023-12-20 23:07:09,113 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 197 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 23:07:09,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 226 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 23:07:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-20 23:07:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2023-12-20 23:07:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 53 states have (on average 1.150943396226415) internal successors, (61), 54 states have internal predecessors, (61), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-20 23:07:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2023-12-20 23:07:09,160 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 109 [2023-12-20 23:07:09,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:07:09,161 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2023-12-20 23:07:09,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2023-12-20 23:07:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2023-12-20 23:07:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-20 23:07:09,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:07:09,163 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:09,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-20 23:07:09,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-20 23:07:09,369 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:07:09,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:07:09,370 INFO L85 PathProgramCache]: Analyzing trace with hash -560412064, now seen corresponding path program 1 times [2023-12-20 23:07:09,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:07:09,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550693540] [2023-12-20 23:07:09,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:07:09,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:07:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 23:07:09,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 23:07:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 23:07:09,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 23:07:09,511 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 23:07:09,512 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 23:07:09,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 23:07:09,516 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-20 23:07:09,518 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 23:07:09,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 11:07:09 BoogieIcfgContainer [2023-12-20 23:07:09,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 23:07:09,574 INFO L158 Benchmark]: Toolchain (without parser) took 3100.01ms. Allocated memory is still 299.9MB. Free memory was 255.8MB in the beginning and 209.9MB in the end (delta: 45.9MB). Peak memory consumption was 47.0MB. Max. memory is 8.0GB. [2023-12-20 23:07:09,577 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory was 132.2MB in the beginning and 132.0MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 23:07:09,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.00ms. Allocated memory is still 299.9MB. Free memory was 255.8MB in the beginning and 242.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 23:07:09,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.71ms. Allocated memory is still 299.9MB. Free memory was 242.7MB in the beginning and 239.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 23:07:09,578 INFO L158 Benchmark]: Boogie Preprocessor took 30.84ms. Allocated memory is still 299.9MB. Free memory was 239.6MB in the beginning and 235.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-20 23:07:09,578 INFO L158 Benchmark]: RCFGBuilder took 370.41ms. Allocated memory is still 299.9MB. Free memory was 234.9MB in the beginning and 215.5MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-20 23:07:09,579 INFO L158 Benchmark]: TraceAbstraction took 2471.82ms. Allocated memory is still 299.9MB. Free memory was 214.9MB in the beginning and 209.9MB in the end (delta: 5.0MB). Peak memory consumption was 6.1MB. Max. memory is 8.0GB. [2023-12-20 23:07:09,584 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.11ms. Allocated memory is still 182.5MB. Free memory was 132.2MB in the beginning and 132.0MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.00ms. Allocated memory is still 299.9MB. Free memory was 255.8MB in the beginning and 242.7MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.71ms. Allocated memory is still 299.9MB. Free memory was 242.7MB in the beginning and 239.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.84ms. Allocated memory is still 299.9MB. Free memory was 239.6MB in the beginning and 235.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 370.41ms. Allocated memory is still 299.9MB. Free memory was 234.9MB in the beginning and 215.5MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 2471.82ms. Allocated memory is still 299.9MB. Free memory was 214.9MB in the beginning and 209.9MB in the end (delta: 5.0MB). Peak memory consumption was 6.1MB. 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 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] double var_1_2 = 255.6; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 8; [L29] double var_1_10 = 255.2; [L30] unsigned char var_1_11 = 64; [L31] unsigned char var_1_12 = 100; [L32] unsigned char var_1_13 = 32; [L33] unsigned char var_1_14 = 64; [L34] unsigned char var_1_15 = 0; [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L61] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=8] [L62] var_1_6 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_7=0, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_7=0, var_1_8=0, var_1_9=8] [L63] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_7=0, var_1_8=0, var_1_9=8] [L64] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=8] [L64] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=8] [L65] var_1_7 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L66] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L67] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L67] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L68] var_1_8 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_9=8] [L69] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_9=8] [L70] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L70] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_10=1276/5, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L71] var_1_10 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L72] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=64, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L73] var_1_11 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L74] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L75] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L75] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=100, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L76] var_1_12 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_12 >= 64) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L77] RET assume_abort_if_not(var_1_12 >= 64) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L78] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L78] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=32, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L79] var_1_13 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L81] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L81] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=64, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L82] var_1_14 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L83] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L84] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L84] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L85] var_1_15 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L86] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L87] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L87] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=8] [L100] RET updateVariables() [L101] CALL step() [L38] COND TRUE (- var_1_2) <= var_1_10 [L39] var_1_9 = ((((((var_1_11 + var_1_12) - var_1_13)) < ((var_1_14 + var_1_15))) ? (((var_1_11 + var_1_12) - var_1_13)) : ((var_1_14 + var_1_15)))) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=-4, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L43] COND TRUE var_1_2 < 63.75 [L44] var_1_1 = (10 - var_1_9) VAL [isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L48] signed long int stepLocal_0 = (var_1_9 / -256) * 32; VAL [isInitial=1, stepLocal_0=0, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L49] COND FALSE !(var_1_9 > stepLocal_0) [L56] var_1_5 = var_1_7 VAL [isInitial=1, stepLocal_0=0, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L101] RET step() [L102] CALL, EXPR property() [L92-L93] return (((var_1_2 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_9))) : (var_1_1 == ((signed short int) (4 + var_1_9)))) && ((var_1_9 > ((var_1_9 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && (! var_1_8))))) : (var_1_5 == ((unsigned char) var_1_7))) : (var_1_5 == ((unsigned char) var_1_7)))) && (((- var_1_2) <= var_1_10) ? (var_1_9 == ((unsigned char) ((((((var_1_11 + var_1_12) - var_1_13)) < ((var_1_14 + var_1_15))) ? (((var_1_11 + var_1_12) - var_1_13)) : ((var_1_14 + var_1_15)))))) : (var_1_9 == ((unsigned char) var_1_12))) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_11=63, var_1_12=64, var_1_13=127, var_1_14=0, var_1_15=0, var_1_1=10, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 71 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=1, InterpolantAutomatonStates: 28, 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, 1 MinimizatonAttempts, 51 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 1077 SizeOfPredicates, 5 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 0 PerfectInterpolantSequences, 1773/1836 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:07:09,603 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...