/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_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-89.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 02:25:50,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 02:25:50,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 02:25:50,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 02:25:50,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 02:25:50,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 02:25:50,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 02:25:50,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 02:25:50,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 02:25:50,632 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 02:25:50,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 02:25:50,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 02:25:50,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 02:25:50,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 02:25:50,633 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 02:25:50,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 02:25:50,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 02:25:50,634 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 02:25:50,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 02:25:50,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 02:25:50,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 02:25:50,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 02:25:50,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 02:25:50,635 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 02:25:50,635 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 02:25:50,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 02:25:50,636 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 02:25:50,636 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 02:25:50,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 02:25:50,637 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 02:25:50,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 02:25:50,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 02:25:50,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 02:25:50,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 02:25:50,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 02:25:50,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 02:25:50,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 02:25:50,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 02:25:50,638 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 02:25:50,638 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 02:25:50,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 02:25:50,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 02:25:50,639 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 02:25:50,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 02:25:50,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 02:25:50,640 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 02:25:50,640 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 [2023-12-24 02:25:50,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 02:25:50,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 02:25:50,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 02:25:50,787 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 02:25:50,787 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 02:25:50,789 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-89.i [2023-12-24 02:25:51,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 02:25:52,041 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 02:25:52,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-89.i [2023-12-24 02:25:52,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47905725/fc3d0227a2b045ada5fe50f24dc4658c/FLAG9480e4d7d [2023-12-24 02:25:52,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47905725/fc3d0227a2b045ada5fe50f24dc4658c [2023-12-24 02:25:52,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 02:25:52,070 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 02:25:52,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 02:25:52,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 02:25:52,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 02:25:52,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 02:25:52" (1/1) ... [2023-12-24 02:25:52,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec80e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:52, skipping insertion in model container [2023-12-24 02:25:52,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 02:25:52" (1/1) ... [2023-12-24 02:25:52,101 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 02:25:52,204 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-89.i[915,928] [2023-12-24 02:25:52,235 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 02:25:52,250 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 02:25:52,259 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-89.i[915,928] [2023-12-24 02:25:52,284 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 02:25:52,304 INFO L206 MainTranslator]: Completed translation [2023-12-24 02:25:52,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:52 WrapperNode [2023-12-24 02:25:52,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 02:25:52,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 02:25:52,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 02:25:52,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 02:25:52,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:52" (1/1) ... [2023-12-24 02:25:52,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:52" (1/1) ... [2023-12-24 02:25:52,364 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2023-12-24 02:25:52,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 02:25:52,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 02:25:52,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 02:25:52,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 02:25:52,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:52" (1/1) ... [2023-12-24 02:25:52,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:52" (1/1) ... [2023-12-24 02:25:52,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:52" (1/1) ... [2023-12-24 02:25:52,402 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-24 02:25:52,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:52" (1/1) ... [2023-12-24 02:25:52,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:52" (1/1) ... [2023-12-24 02:25:52,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:52" (1/1) ... [2023-12-24 02:25:52,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:52" (1/1) ... [2023-12-24 02:25:52,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:52" (1/1) ... [2023-12-24 02:25:52,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:52" (1/1) ... [2023-12-24 02:25:52,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 02:25:52,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 02:25:52,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 02:25:52,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 02:25:52,428 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:52" (1/1) ... [2023-12-24 02:25:52,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 02:25:52,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 02:25:52,474 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-24 02:25:52,522 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-24 02:25:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 02:25:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 02:25:52,529 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 02:25:52,529 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 02:25:52,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 02:25:52,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 02:25:52,617 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 02:25:52,620 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 02:25:53,128 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 02:25:53,153 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 02:25:53,153 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 02:25:53,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:25:53 BoogieIcfgContainer [2023-12-24 02:25:53,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 02:25:53,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 02:25:53,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 02:25:53,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 02:25:53,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 02:25:52" (1/3) ... [2023-12-24 02:25:53,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd43a49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:25:53, skipping insertion in model container [2023-12-24 02:25:53,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:52" (2/3) ... [2023-12-24 02:25:53,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd43a49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:25:53, skipping insertion in model container [2023-12-24 02:25:53,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:25:53" (3/3) ... [2023-12-24 02:25:53,159 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-89.i [2023-12-24 02:25:53,171 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 02:25:53,171 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 02:25:53,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 02:25:53,217 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;@462eb996, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 02:25:53,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 02:25:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 02:25:53,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-24 02:25:53,231 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:25:53,231 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:25:53,231 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:25:53,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:25:53,238 INFO L85 PathProgramCache]: Analyzing trace with hash -307185012, now seen corresponding path program 1 times [2023-12-24 02:25:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:25:53,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241224934] [2023-12-24 02:25:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:25:53,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:25:53,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:25:53,274 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 02:25:53,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 02:25:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:25:53,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 02:25:53,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:25:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2023-12-24 02:25:53,550 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 02:25:53,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:25:53,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241224934] [2023-12-24 02:25:53,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241224934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 02:25:53,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 02:25:53,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 02:25:53,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764065424] [2023-12-24 02:25:53,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:25:53,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 02:25:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:25:53,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 02:25:53,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 02:25:53,584 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-24 02:25:53,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:25:53,842 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2023-12-24 02:25:53,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 02:25:53,856 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2023-12-24 02:25:53,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:25:53,861 INFO L225 Difference]: With dead ends: 93 [2023-12-24 02:25:53,861 INFO L226 Difference]: Without dead ends: 46 [2023-12-24 02:25:53,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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-24 02:25:53,867 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 02:25:53,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 02:25:53,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-24 02:25:53,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-24 02:25:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 02:25:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2023-12-24 02:25:53,908 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 116 [2023-12-24 02:25:53,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:25:53,908 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2023-12-24 02:25:53,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-24 02:25:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2023-12-24 02:25:53,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-24 02:25:53,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:25:53,914 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:25:53,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 02:25:54,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:25:54,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:25:54,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:25:54,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1475096890, now seen corresponding path program 1 times [2023-12-24 02:25:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:25:54,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604622739] [2023-12-24 02:25:54,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:25:54,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:25:54,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:25:54,127 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 02:25:54,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 02:25:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:25:54,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 02:25:54,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:25:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-12-24 02:25:54,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 02:25:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-12-24 02:25:54,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:25:54,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604622739] [2023-12-24 02:25:54,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604622739] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 02:25:54,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 02:25:54,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-12-24 02:25:54,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675019280] [2023-12-24 02:25:54,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 02:25:54,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 02:25:54,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:25:54,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 02:25:54,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-24 02:25:54,844 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2023-12-24 02:25:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:25:55,614 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2023-12-24 02:25:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 02:25:55,627 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 116 [2023-12-24 02:25:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:25:55,628 INFO L225 Difference]: With dead ends: 101 [2023-12-24 02:25:55,628 INFO L226 Difference]: Without dead ends: 56 [2023-12-24 02:25:55,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2023-12-24 02:25:55,630 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 34 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 02:25:55,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 169 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 02:25:55,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-24 02:25:55,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2023-12-24 02:25:55,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 02:25:55,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2023-12-24 02:25:55,639 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 116 [2023-12-24 02:25:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:25:55,640 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2023-12-24 02:25:55,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2023-12-24 02:25:55,640 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2023-12-24 02:25:55,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-24 02:25:55,641 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:25:55,641 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:25:55,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 02:25:55,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:25:55,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:25:55,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:25:55,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1475156472, now seen corresponding path program 1 times [2023-12-24 02:25:55,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:25:55,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300843527] [2023-12-24 02:25:55,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:25:55,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:25:55,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:25:55,852 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 02:25:55,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 02:25:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:25:56,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 02:25:56,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:26:53,088 WARN L293 SmtUtils]: Spent 17.64s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 02:27:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-24 02:27:58,641 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 02:27:58,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:27:58,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300843527] [2023-12-24 02:27:58,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300843527] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 02:27:58,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 02:27:58,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-24 02:27:58,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515078035] [2023-12-24 02:27:58,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:27:58,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-24 02:27:58,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:27:58,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-24 02:27:58,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-12-24 02:27:58,643 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-24 02:28:05,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:28:25,530 WARN L293 SmtUtils]: Spent 17.96s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 02:28:27,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:28:31,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:28:31,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:28:31,765 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2023-12-24 02:28:31,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-24 02:28:31,805 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 116 [2023-12-24 02:28:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:28:31,806 INFO L225 Difference]: With dead ends: 83 [2023-12-24 02:28:31,806 INFO L226 Difference]: Without dead ends: 81 [2023-12-24 02:28:31,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 45.8s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2023-12-24 02:28:31,808 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 83 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2023-12-24 02:28:31,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 156 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2023-12-24 02:28:31,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-24 02:28:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2023-12-24 02:28:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 02:28:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2023-12-24 02:28:31,817 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 116 [2023-12-24 02:28:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:28:31,818 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2023-12-24 02:28:31,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-24 02:28:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2023-12-24 02:28:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-24 02:28:31,819 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:28:31,819 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 02:28:31,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-24 02:28:32,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:28:32,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:28:32,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:28:32,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2010464198, now seen corresponding path program 1 times [2023-12-24 02:28:32,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:28:32,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978032209] [2023-12-24 02:28:32,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:28:32,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:28:32,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:28:32,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 02:28:32,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 02:28:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:28:32,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 02:28:32,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:29:27,645 WARN L293 SmtUtils]: Spent 16.92s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 02:30:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-24 02:30:24,106 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 02:30:24,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:30:24,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978032209] [2023-12-24 02:30:24,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978032209] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 02:30:24,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 02:30:24,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-24 02:30:24,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200013408] [2023-12-24 02:30:24,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:30:24,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-24 02:30:24,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:30:24,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-24 02:30:24,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-12-24 02:30:24,109 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-24 02:30:39,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:31:04,239 WARN L293 SmtUtils]: Spent 23.51s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 02:31:06,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:31:08,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:31:09,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:31:10,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:31:10,282 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2023-12-24 02:31:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-24 02:31:10,301 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 116 [2023-12-24 02:31:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:31:10,301 INFO L225 Difference]: With dead ends: 80 [2023-12-24 02:31:10,302 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 02:31:10,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 51.4s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2023-12-24 02:31:10,303 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 104 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2023-12-24 02:31:10,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 175 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 20.2s Time] [2023-12-24 02:31:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 02:31:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 02:31:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 02:31:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 02:31:10,304 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2023-12-24 02:31:10,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:31:10,304 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 02:31:10,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-24 02:31:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 02:31:10,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 02:31:10,306 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 02:31:10,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 02:31:10,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:31:10,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 02:31:19,676 WARN L293 SmtUtils]: Spent 7.84s on a formula simplification. DAG size of input: 110 DAG size of output: 56 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 02:31:25,196 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,196 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,196 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,197 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,197 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse7 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse4 ((_ zero_extend 24) ~var_1_6~0))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,197 INFO L899 garLoopResultBuilder]: For program point L85-1(lines 55 86) no Hoare annotation was computed. [2023-12-24 02:31:25,197 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 02:31:25,197 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 02:31:25,197 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_6~0))) (and (bvsle .cse0 (_ bv1 32)) (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse2 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse1)) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse2))) (and (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1))) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse2)))))) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 02:31:25,198 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-12-24 02:31:25,198 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 02:31:25,198 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-24 02:31:25,198 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,198 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,198 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-12-24 02:31:25,199 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,199 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,199 INFO L895 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,199 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 02:31:25,199 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2023-12-24 02:31:25,200 INFO L899 garLoopResultBuilder]: For program point L45-2(lines 45 49) no Hoare annotation was computed. [2023-12-24 02:31:25,200 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-24 02:31:25,200 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse6 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))))) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,200 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse6 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))))) (bvsge ((_ zero_extend 24) ~var_1_6~0) (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,200 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 02:31:25,200 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-12-24 02:31:25,200 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2023-12-24 02:31:25,201 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse3 ((_ zero_extend 24) ~var_1_6~0))) (and (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))) (and (fp.leq ~var_1_12~0 ((_ to_fp 11 53) currentRoundingMode .cse1)) (fp.geq ~var_1_12~0 .cse2)))) (bvsle .cse3 (_ bv1 32)) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse2) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))))) (bvsge .cse3 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,201 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2023-12-24 02:31:25,201 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_6~0))) (and (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 02:31:25,201 INFO L899 garLoopResultBuilder]: For program point L79-1(line 79) no Hoare annotation was computed. [2023-12-24 02:31:25,201 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 02:31:25,201 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-24 02:31:25,201 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 54) no Hoare annotation was computed. [2023-12-24 02:31:25,201 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,201 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,202 INFO L895 garLoopResultBuilder]: At program point L96-2(lines 96 102) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,202 INFO L899 garLoopResultBuilder]: For program point L96-3(lines 96 102) no Hoare annotation was computed. [2023-12-24 02:31:25,202 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 53) no Hoare annotation was computed. [2023-12-24 02:31:25,202 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,202 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 02:31:25,202 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-12-24 02:31:25,202 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 39 43) no Hoare annotation was computed. [2023-12-24 02:31:25,202 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-24 02:31:25,203 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 02:31:25,203 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 02:31:25,203 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 02:31:25,203 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 02:31:25,206 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-24 02:31:25,207 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 02:31:25,220 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:31:25,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 02:31:25 BoogieIcfgContainer [2023-12-24 02:31:25,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 02:31:25,223 INFO L158 Benchmark]: Toolchain (without parser) took 333153.07ms. Allocated memory was 181.4MB in the beginning and 714.1MB in the end (delta: 532.7MB). Free memory was 128.8MB in the beginning and 344.8MB in the end (delta: -216.0MB). Peak memory consumption was 317.6MB. Max. memory is 8.0GB. [2023-12-24 02:31:25,223 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 02:31:25,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.50ms. Allocated memory is still 181.4MB. Free memory was 128.2MB in the beginning and 114.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-24 02:31:25,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.11ms. Allocated memory is still 181.4MB. Free memory was 114.6MB in the beginning and 112.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 02:31:25,224 INFO L158 Benchmark]: Boogie Preprocessor took 61.39ms. Allocated memory is still 181.4MB. Free memory was 112.5MB in the beginning and 110.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 02:31:25,224 INFO L158 Benchmark]: RCFGBuilder took 726.47ms. Allocated memory is still 181.4MB. Free memory was 110.0MB in the beginning and 92.6MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 02:31:25,225 INFO L158 Benchmark]: TraceAbstraction took 332067.18ms. Allocated memory was 181.4MB in the beginning and 714.1MB in the end (delta: 532.7MB). Free memory was 92.1MB in the beginning and 344.8MB in the end (delta: -252.6MB). Peak memory consumption was 280.9MB. Max. memory is 8.0GB. [2023-12-24 02:31:25,226 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.50ms. Allocated memory is still 181.4MB. Free memory was 128.2MB in the beginning and 114.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.11ms. Allocated memory is still 181.4MB. Free memory was 114.6MB in the beginning and 112.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.39ms. Allocated memory is still 181.4MB. Free memory was 112.5MB in the beginning and 110.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 726.47ms. Allocated memory is still 181.4MB. Free memory was 110.0MB in the beginning and 92.6MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 332067.18ms. Allocated memory was 181.4MB in the beginning and 714.1MB in the end (delta: 532.7MB). Free memory was 92.1MB in the beginning and 344.8MB in the end (delta: -252.6MB). Peak memory consumption was 280.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 332.0s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 80.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 33.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 564 SdHoareTripleChecker+Invalid, 30.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 387 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1015 IncrementalHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 177 mSDtfsCounter, 1015 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 597 GetRequests, 530 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 97.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=3, InterpolantAutomatonStates: 58, 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, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 77 PreInvPairs, 98 NumberOfFragments, 2539 HoareAnnotationTreeSize, 77 FormulaSimplifications, 4937 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FormulaSimplificationsInter, 2901 FormulaSimplificationTreeSizeReductionInter, 14.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 235.1s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 575 ConstructedInterpolants, 0 QuantifiedInterpolants, 6384 SizeOfPredicates, 47 NumberOfNonLiveVariables, 752 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 3345/3420 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((var_1_6 <= 1) && (var_1_6 >= 1)) RESULT: Ultimate proved your program to be correct! [2023-12-24 02:31:25,441 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 02:31:25,473 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 137 Received shutdown request...