/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-56.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 01:57:15,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 01:57:15,276 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 01:57:15,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 01:57:15,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 01:57:15,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 01:57:15,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 01:57:15,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 01:57:15,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 01:57:15,306 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 01:57:15,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 01:57:15,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 01:57:15,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 01:57:15,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 01:57:15,308 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 01:57:15,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 01:57:15,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 01:57:15,309 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 01:57:15,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 01:57:15,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 01:57:15,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 01:57:15,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 01:57:15,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 01:57:15,310 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 01:57:15,311 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 01:57:15,311 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 01:57:15,311 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 01:57:15,311 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 01:57:15,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 01:57:15,311 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 01:57:15,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 01:57:15,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 01:57:15,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 01:57:15,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 01:57:15,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 01:57:15,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 01:57:15,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 01:57:15,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 01:57:15,313 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 01:57:15,313 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 01:57:15,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 01:57:15,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 01:57:15,313 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 01:57:15,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 01:57:15,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 01:57:15,314 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 01:57:15,314 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 01:57:15,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 01:57:15,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 01:57:15,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 01:57:15,516 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 01:57:15,516 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 01:57:15,517 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-56.i [2023-12-24 01:57:16,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 01:57:16,819 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 01:57:16,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-56.i [2023-12-24 01:57:16,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b027091/abebce3e710e4ad0ad17fc45215f056d/FLAGa6ba37570 [2023-12-24 01:57:16,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65b027091/abebce3e710e4ad0ad17fc45215f056d [2023-12-24 01:57:16,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 01:57:16,839 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 01:57:16,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 01:57:16,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 01:57:16,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 01:57:16,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:57:16" (1/1) ... [2023-12-24 01:57:16,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2367ac76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:57:16, skipping insertion in model container [2023-12-24 01:57:16,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:57:16" (1/1) ... [2023-12-24 01:57:16,868 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 01:57:16,988 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-56.i[915,928] [2023-12-24 01:57:17,035 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 01:57:17,045 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 01:57:17,056 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-56.i[915,928] [2023-12-24 01:57:17,076 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 01:57:17,089 INFO L206 MainTranslator]: Completed translation [2023-12-24 01:57:17,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:57:17 WrapperNode [2023-12-24 01:57:17,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 01:57:17,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 01:57:17,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 01:57:17,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 01:57:17,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:57:17" (1/1) ... [2023-12-24 01:57:17,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:57:17" (1/1) ... [2023-12-24 01:57:17,135 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2023-12-24 01:57:17,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 01:57:17,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 01:57:17,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 01:57:17,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 01:57:17,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:57:17" (1/1) ... [2023-12-24 01:57:17,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:57:17" (1/1) ... [2023-12-24 01:57:17,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:57:17" (1/1) ... [2023-12-24 01:57:17,158 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 01:57:17,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:57:17" (1/1) ... [2023-12-24 01:57:17,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:57:17" (1/1) ... [2023-12-24 01:57:17,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:57:17" (1/1) ... [2023-12-24 01:57:17,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:57:17" (1/1) ... [2023-12-24 01:57:17,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:57:17" (1/1) ... [2023-12-24 01:57:17,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:57:17" (1/1) ... [2023-12-24 01:57:17,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 01:57:17,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 01:57:17,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 01:57:17,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 01:57:17,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:57:17" (1/1) ... [2023-12-24 01:57:17,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 01:57:17,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 01:57:17,245 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 01:57:17,275 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 01:57:17,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 01:57:17,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 01:57:17,289 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 01:57:17,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 01:57:17,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 01:57:17,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 01:57:17,356 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 01:57:17,357 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 01:57:17,563 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 01:57:17,594 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 01:57:17,594 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 01:57:17,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:57:17 BoogieIcfgContainer [2023-12-24 01:57:17,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 01:57:17,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 01:57:17,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 01:57:17,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 01:57:17,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 01:57:16" (1/3) ... [2023-12-24 01:57:17,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fd4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:57:17, skipping insertion in model container [2023-12-24 01:57:17,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:57:17" (2/3) ... [2023-12-24 01:57:17,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fd4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:57:17, skipping insertion in model container [2023-12-24 01:57:17,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:57:17" (3/3) ... [2023-12-24 01:57:17,606 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-56.i [2023-12-24 01:57:17,617 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 01:57:17,617 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 01:57:17,646 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 01:57:17,652 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;@691afdc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 01:57:17,652 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 01:57:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 01:57:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-24 01:57:17,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:57:17,662 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:57:17,662 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:57:17,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:57:17,666 INFO L85 PathProgramCache]: Analyzing trace with hash -797905389, now seen corresponding path program 1 times [2023-12-24 01:57:17,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:57:17,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672604678] [2023-12-24 01:57:17,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:57:17,674 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 01:57:17,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:57:17,683 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 01:57:17,686 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 01:57:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:57:17,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 01:57:17,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:57:17,908 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-12-24 01:57:17,908 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:57:17,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:57:17,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672604678] [2023-12-24 01:57:17,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672604678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:57:17,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 01:57:17,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 01:57:17,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065217066] [2023-12-24 01:57:17,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:57:17,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 01:57:17,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:57:17,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 01:57:17,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 01:57:17,956 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-24 01:57:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:57:18,003 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2023-12-24 01:57:18,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 01:57:18,011 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 65 [2023-12-24 01:57:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:57:18,017 INFO L225 Difference]: With dead ends: 67 [2023-12-24 01:57:18,017 INFO L226 Difference]: Without dead ends: 33 [2023-12-24 01:57:18,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 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 01:57:18,022 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 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.0s IncrementalHoareTripleChecker+Time [2023-12-24 01:57:18,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 01:57:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-24 01:57:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-24 01:57:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 01:57:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2023-12-24 01:57:18,049 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 65 [2023-12-24 01:57:18,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:57:18,049 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2023-12-24 01:57:18,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-24 01:57:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2023-12-24 01:57:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-24 01:57:18,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:57:18,051 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:57:18,057 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 01:57:18,258 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 01:57:18,258 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:57:18,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:57:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1822726957, now seen corresponding path program 1 times [2023-12-24 01:57:18,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:57:18,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370351385] [2023-12-24 01:57:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:57:18,260 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 01:57:18,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:57:18,262 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 01:57:18,268 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 01:57:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:57:18,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 01:57:18,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:57:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-24 01:57:18,658 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:57:18,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:57:18,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370351385] [2023-12-24 01:57:18,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370351385] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:57:18,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 01:57:18,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 01:57:18,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957575188] [2023-12-24 01:57:18,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:57:18,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 01:57:18,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:57:18,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 01:57:18,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 01:57:18,661 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:57:18,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:57:18,816 INFO L93 Difference]: Finished difference Result 98 states and 140 transitions. [2023-12-24 01:57:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 01:57:18,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 65 [2023-12-24 01:57:18,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:57:18,821 INFO L225 Difference]: With dead ends: 98 [2023-12-24 01:57:18,821 INFO L226 Difference]: Without dead ends: 66 [2023-12-24 01:57:18,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 01:57:18,822 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 25 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 01:57:18,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 119 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 01:57:18,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-24 01:57:18,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2023-12-24 01:57:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 01:57:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2023-12-24 01:57:18,839 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 65 [2023-12-24 01:57:18,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:57:18,840 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2023-12-24 01:57:18,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:57:18,841 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2023-12-24 01:57:18,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-24 01:57:18,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:57:18,843 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:57:18,850 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 01:57:19,048 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 01:57:19,049 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:57:19,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:57:19,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1662893713, now seen corresponding path program 1 times [2023-12-24 01:57:19,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:57:19,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598009200] [2023-12-24 01:57:19,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:57:19,052 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 01:57:19,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:57:19,056 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 01:57:19,085 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 01:57:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:57:19,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 01:57:19,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:59:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 144 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-24 01:59:06,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 02:00:36,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:00:36,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598009200] [2023-12-24 02:00:36,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598009200] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 02:00:36,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2022305028] [2023-12-24 02:00:36,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:00:36,175 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 02:00:36,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 02:00:36,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 02:00:36,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-24 02:00:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:00:36,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 02:00:36,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:01:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-24 02:01:02,955 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 02:01:02,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2022305028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 02:01:02,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 02:01:02,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 23 [2023-12-24 02:01:02,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189240815] [2023-12-24 02:01:02,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:01:02,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 02:01:02,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:01:02,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 02:01:02,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2023-12-24 02:01:02,958 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 02:01:04,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:01:04,842 INFO L93 Difference]: Finished difference Result 107 states and 150 transitions. [2023-12-24 02:01:04,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 02:01:04,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 65 [2023-12-24 02:01:04,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:01:04,849 INFO L225 Difference]: With dead ends: 107 [2023-12-24 02:01:04,849 INFO L226 Difference]: Without dead ends: 105 [2023-12-24 02:01:04,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2023-12-24 02:01:04,851 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 58 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 02:01:04,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 142 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 02:01:04,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-24 02:01:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2023-12-24 02:01:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-24 02:01:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 132 transitions. [2023-12-24 02:01:04,863 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 132 transitions. Word has length 65 [2023-12-24 02:01:04,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:01:04,863 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 132 transitions. [2023-12-24 02:01:04,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 02:01:04,863 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 132 transitions. [2023-12-24 02:01:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-24 02:01:04,864 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:01:04,864 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:04,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 02:01:05,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-12-24 02:01:05,267 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 02:01:05,267 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:01:05,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:01:05,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1287876369, now seen corresponding path program 1 times [2023-12-24 02:01:05,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:01:05,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726873074] [2023-12-24 02:01:05,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:01:05,269 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:01:05,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:01:05,297 INFO L229 MonitoredProcess]: Starting monitored process 6 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:01:05,323 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 (6)] Waiting until timeout for monitored process [2023-12-24 02:01:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:01:05,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 02:01:05,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:04:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 33 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 02:04:32,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 02:05:33,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:05:33,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726873074] [2023-12-24 02:05:33,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726873074] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 02:05:33,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [922664232] [2023-12-24 02:05:33,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:05:33,741 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 02:05:33,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 02:05:33,746 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 02:05:33,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-24 02:05:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:05:33,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 02:05:33,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:05:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-24 02:05:34,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 02:05:36,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [922664232] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 02:05:36,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 02:05:36,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6] total 21 [2023-12-24 02:05:36,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356051141] [2023-12-24 02:05:36,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 02:05:36,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-24 02:05:36,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:05:36,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-24 02:05:36,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2023-12-24 02:05:36,797 INFO L87 Difference]: Start difference. First operand 91 states and 132 transitions. Second operand has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 6 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-24 02:05:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:05:39,049 INFO L93 Difference]: Finished difference Result 162 states and 217 transitions. [2023-12-24 02:05:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-24 02:05:39,050 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 6 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 66 [2023-12-24 02:05:39,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:05:39,051 INFO L225 Difference]: With dead ends: 162 [2023-12-24 02:05:39,051 INFO L226 Difference]: Without dead ends: 93 [2023-12-24 02:05:39,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=486, Invalid=2270, Unknown=0, NotChecked=0, Total=2756 [2023-12-24 02:05:39,054 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 91 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 02:05:39,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 209 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 02:05:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-24 02:05:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2023-12-24 02:05:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 02:05:39,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2023-12-24 02:05:39,077 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 66 [2023-12-24 02:05:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:05:39,077 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2023-12-24 02:05:39,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 6 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-24 02:05:39,077 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2023-12-24 02:05:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-24 02:05:39,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:05:39,081 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 02:05:39,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-12-24 02:05:39,289 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 (6)] Ended with exit code 0 [2023-12-24 02:05:39,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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:05:39,489 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:05:39,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:05:39,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1475722096, now seen corresponding path program 1 times [2023-12-24 02:05:39,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:05:39,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651575961] [2023-12-24 02:05:39,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:05:39,491 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:05:39,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:05:39,492 INFO L229 MonitoredProcess]: Starting monitored process 8 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:05:39,493 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 (8)] Waiting until timeout for monitored process [2023-12-24 02:05:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:05:39,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-24 02:05:39,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:06:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 441 proven. 16 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2023-12-24 02:06:38,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 02:07:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2023-12-24 02:07:16,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:07:16,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651575961] [2023-12-24 02:07:16,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651575961] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 02:07:16,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 02:07:16,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 20 [2023-12-24 02:07:16,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486025370] [2023-12-24 02:07:16,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:07:16,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 02:07:16,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:07:16,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 02:07:16,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2023-12-24 02:07:16,578 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 02:07:18,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:07:18,911 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2023-12-24 02:07:18,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 02:07:18,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 129 [2023-12-24 02:07:18,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:07:18,917 INFO L225 Difference]: With dead ends: 85 [2023-12-24 02:07:18,917 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 02:07:18,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2023-12-24 02:07:18,918 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-24 02:07:18,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 88 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-24 02:07:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 02:07:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 02:07:18,919 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:07:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 02:07:18,919 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 129 [2023-12-24 02:07:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:07:18,919 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 02:07:18,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 02:07:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 02:07:18,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 02:07:18,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 02:07:18,929 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 (8)] Forceful destruction successful, exit code 0 [2023-12-24 02:07:19,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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:07:19,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 02:07:19,987 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2023-12-24 02:07:19,988 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 54) no Hoare annotation was computed. [2023-12-24 02:07:19,988 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 02:07:19,988 INFO L895 garLoopResultBuilder]: At program point L85-2(lines 85 91) the Hoare annotation is: (let ((.cse9 (= (_ bv0 16) ~var_1_11~0)) (.cse16 ((_ zero_extend 24) ~var_1_5~0)) (.cse14 (bvuge ~var_1_10~0 (_ bv1073741823 32))) (.cse3 ((_ sign_extend 24) ~var_1_3~0))) (or (let ((.cse13 ((_ zero_extend 24) ~var_1_7~0)) (.cse12 ((_ zero_extend 24) ~var_1_6~0))) (let ((.cse4 ((_ zero_extend 24) ~var_1_1~0)) (.cse6 (bvadd (bvneg .cse12) .cse16)) (.cse15 (bvsge (bvashr ((_ zero_extend 16) ~last_1_var_1_11~0) .cse3) ((_ zero_extend 24) ~last_1_var_1_1~0))) (.cse11 (bvadd (bvneg .cse13) .cse16))) (let ((.cse0 (bvslt .cse3 .cse11)) (.cse7 (= ((_ sign_extend 16) ((_ zero_extend 8) ~var_1_1~0)) ((_ sign_extend 16) ~var_1_12~0))) (.cse1 (not .cse15)) (.cse5 (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse6)))) (.cse8 (or .cse15 (= .cse12 .cse4)))) (and (or (not .cse0) (and (or .cse1 (let ((.cse2 (bvslt .cse3 .cse6))) (and (or (not .cse2) (= ((_ zero_extend 24) ((_ extract 7 0) .cse3)) .cse4)) (or .cse5 .cse2)))) .cse7 .cse8)) .cse9 (or .cse0 (and .cse7 (or .cse1 (let ((.cse10 (bvsgt .cse12 .cse13))) (and (or .cse5 (not .cse10)) (or .cse10 (= .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse11))))))) .cse8)) .cse14)))) (and (= ~last_1_var_1_11~0 (_ bv0 16)) (bvsle .cse3 (_ bv16 32)) .cse9 (bvsge .cse16 (_ bv127 32)) (= (_ bv1 8) ~last_1_var_1_1~0) .cse14 (bvsge .cse3 (_ bv0 32)) (= (_ bv1 8) ~var_1_1~0)))) [2023-12-24 02:07:19,988 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 02:07:19,988 INFO L899 garLoopResultBuilder]: For program point L85-3(lines 85 91) no Hoare annotation was computed. [2023-12-24 02:07:19,988 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 02:07:19,988 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2023-12-24 02:07:19,988 INFO L899 garLoopResultBuilder]: For program point L44-1(lines 44 48) no Hoare annotation was computed. [2023-12-24 02:07:19,989 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-12-24 02:07:19,989 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2023-12-24 02:07:19,989 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 36 40) no Hoare annotation was computed. [2023-12-24 02:07:19,989 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (and (= (_ bv0 16) ~var_1_11~0) (bvuge ~var_1_10~0 (_ bv1073741823 32))) [2023-12-24 02:07:19,989 INFO L895 garLoopResultBuilder]: At program point L65-1(line 65) the Hoare annotation is: (and (= (_ bv0 16) ~var_1_11~0) (bvuge ~var_1_10~0 (_ bv1073741823 32))) [2023-12-24 02:07:19,989 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 02:07:19,989 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 47) no Hoare annotation was computed. [2023-12-24 02:07:19,989 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-12-24 02:07:19,989 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 02:07:19,989 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (and (= (_ bv0 16) ~var_1_11~0) (bvuge ~var_1_10~0 (_ bv1073741823 32))) [2023-12-24 02:07:19,989 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (and (= (_ bv0 16) ~var_1_11~0) (bvuge ~var_1_10~0 (_ bv1073741823 32))) [2023-12-24 02:07:19,989 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 02:07:19,989 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (= (_ bv0 16) ~var_1_11~0) [2023-12-24 02:07:19,989 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (= (_ bv0 16) ~var_1_11~0) (bvuge ~var_1_10~0 (_ bv1073741823 32))) [2023-12-24 02:07:19,990 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-12-24 02:07:19,990 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (= (_ bv0 16) ~var_1_11~0) (bvuge ~var_1_10~0 (_ bv1073741823 32))) [2023-12-24 02:07:19,990 INFO L895 garLoopResultBuilder]: At program point L59-1(line 59) the Hoare annotation is: (and (= (_ bv0 16) ~var_1_11~0) (bvuge ~var_1_10~0 (_ bv1073741823 32))) [2023-12-24 02:07:19,990 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 55) no Hoare annotation was computed. [2023-12-24 02:07:19,990 INFO L899 garLoopResultBuilder]: For program point L72(lines 57 73) no Hoare annotation was computed. [2023-12-24 02:07:19,990 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (and (= (_ bv0 16) ~var_1_11~0) (bvuge ~var_1_10~0 (_ bv1073741823 32))) [2023-12-24 02:07:19,990 INFO L895 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: (and (= (_ bv0 16) ~var_1_11~0) (bvuge ~var_1_10~0 (_ bv1073741823 32))) [2023-12-24 02:07:19,990 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 56) no Hoare annotation was computed. [2023-12-24 02:07:19,990 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 02:07:19,990 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 02:07:19,990 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 02:07:19,990 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 02:07:19,992 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-24 02:07:19,994 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 02:07:20,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 02:07:20 BoogieIcfgContainer [2023-12-24 02:07:20,002 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 02:07:20,003 INFO L158 Benchmark]: Toolchain (without parser) took 603164.11ms. Allocated memory was 323.0MB in the beginning and 990.9MB in the end (delta: 667.9MB). Free memory was 270.4MB in the beginning and 881.8MB in the end (delta: -611.4MB). Peak memory consumption was 58.1MB. Max. memory is 8.0GB. [2023-12-24 02:07:20,003 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 199.2MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 02:07:20,003 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.60ms. Allocated memory is still 323.0MB. Free memory was 270.4MB in the beginning and 257.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 02:07:20,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.22ms. Allocated memory is still 323.0MB. Free memory was 256.8MB in the beginning and 255.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 02:07:20,004 INFO L158 Benchmark]: Boogie Preprocessor took 39.98ms. Allocated memory is still 323.0MB. Free memory was 255.2MB in the beginning and 252.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 02:07:20,004 INFO L158 Benchmark]: RCFGBuilder took 418.59ms. Allocated memory is still 323.0MB. Free memory was 252.6MB in the beginning and 234.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 02:07:20,004 INFO L158 Benchmark]: TraceAbstraction took 602406.27ms. Allocated memory was 323.0MB in the beginning and 990.9MB in the end (delta: 667.9MB). Free memory was 234.2MB in the beginning and 881.8MB in the end (delta: -647.6MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. [2023-12-24 02:07:20,005 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.10ms. Allocated memory is still 199.2MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.60ms. Allocated memory is still 323.0MB. Free memory was 270.4MB in the beginning and 257.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.22ms. Allocated memory is still 323.0MB. Free memory was 256.8MB in the beginning and 255.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.98ms. Allocated memory is still 323.0MB. Free memory was 255.2MB in the beginning and 252.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 418.59ms. Allocated memory is still 323.0MB. Free memory was 252.6MB in the beginning and 234.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 602406.27ms. Allocated memory was 323.0MB in the beginning and 990.9MB in the end (delta: 667.9MB). Free memory was 234.2MB in the beginning and 881.8MB in the end (delta: -647.6MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 602.4s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 602 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 418 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 579 IncrementalHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 184 mSDtfsCounter, 579 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 705 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 31.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=3, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 34 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 71 PreInvPairs, 93 NumberOfFragments, 262 HoareAnnotationTreeSize, 71 FormulaSimplifications, 116 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FormulaSimplificationsInter, 696 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 592.1s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 642 ConstructedInterpolants, 0 QuantifiedInterpolants, 5406 SizeOfPredicates, 89 NumberOfNonLiveVariables, 915 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 2546/2646 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: 85]: Loop Invariant Derived loop invariant: (((((!((var_1_3 < ((-(var_1_7) + var_1_5) % 4294967296))) || (((!(((last_1_var_1_11 >> var_1_3) >= last_1_var_1_1)) || ((!((var_1_3 < ((-(var_1_6) + var_1_5) % 4294967296))) || ((var_1_3 & 127) == var_1_1)) && ((var_1_1 == (((-(var_1_6) + var_1_5) % 4294967296) & 127)) || (var_1_3 < ((-(var_1_6) + var_1_5) % 4294967296))))) && (var_1_1 == var_1_12)) && (((last_1_var_1_11 >> var_1_3) >= last_1_var_1_1) || (var_1_6 == var_1_1)))) && (0 == var_1_11)) && ((var_1_3 < ((-(var_1_7) + var_1_5) % 4294967296)) || (((var_1_1 == var_1_12) && (!(((last_1_var_1_11 >> var_1_3) >= last_1_var_1_1)) || (((var_1_1 == (((-(var_1_6) + var_1_5) % 4294967296) & 127)) || !((var_1_6 > var_1_7))) && ((var_1_6 > var_1_7) || (var_1_1 == (((-(var_1_7) + var_1_5) % 4294967296) & 127)))))) && (((last_1_var_1_11 >> var_1_3) >= last_1_var_1_1) || (var_1_6 == var_1_1))))) && (var_1_10 >= 1073741823)) || ((((((((last_1_var_1_11 == 0) && (var_1_3 <= 16)) && (0 == var_1_11)) && (var_1_5 >= 127)) && (1 == last_1_var_1_1)) && (var_1_10 >= 1073741823)) && (var_1_3 >= 0)) && (1 == var_1_1))) RESULT: Ultimate proved your program to be correct! [2023-12-24 02:07:20,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...