/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-9.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 02:26:30,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 02:26:30,428 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:26:30,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 02:26:30,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 02:26:30,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 02:26:30,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 02:26:30,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 02:26:30,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 02:26:30,465 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 02:26:30,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 02:26:30,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 02:26:30,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 02:26:30,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 02:26:30,467 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 02:26:30,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 02:26:30,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 02:26:30,468 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 02:26:30,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 02:26:30,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 02:26:30,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 02:26:30,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 02:26:30,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 02:26:30,470 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 02:26:30,470 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 02:26:30,470 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 02:26:30,470 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 02:26:30,470 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 02:26:30,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 02:26:30,471 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 02:26:30,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 02:26:30,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 02:26:30,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 02:26:30,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 02:26:30,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 02:26:30,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 02:26:30,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 02:26:30,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 02:26:30,472 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 02:26:30,473 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 02:26:30,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 02:26:30,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 02:26:30,473 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 02:26:30,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 02:26:30,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 02:26:30,473 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 02:26:30,474 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:26:30,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 02:26:30,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 02:26:30,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 02:26:30,687 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 02:26:30,688 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 02:26:30,689 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-9.i [2023-12-24 02:26:31,710 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 02:26:31,833 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 02:26:31,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-9.i [2023-12-24 02:26:31,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fdef9599/852a5d43b4fa4b46aa659a2cbb49ebee/FLAG40a2f1604 [2023-12-24 02:26:31,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fdef9599/852a5d43b4fa4b46aa659a2cbb49ebee [2023-12-24 02:26:31,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 02:26:31,855 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 02:26:31,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 02:26:31,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 02:26:31,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 02:26:31,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 02:26:31" (1/1) ... [2023-12-24 02:26:31,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9fb6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:26:31, skipping insertion in model container [2023-12-24 02:26:31,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 02:26:31" (1/1) ... [2023-12-24 02:26:31,881 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 02:26:31,983 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-9.i[914,927] [2023-12-24 02:26:32,006 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 02:26:32,017 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 02:26:32,026 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-9.i[914,927] [2023-12-24 02:26:32,043 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 02:26:32,054 INFO L206 MainTranslator]: Completed translation [2023-12-24 02:26:32,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:26:32 WrapperNode [2023-12-24 02:26:32,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 02:26:32,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 02:26:32,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 02:26:32,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 02:26:32,059 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:26:32" (1/1) ... [2023-12-24 02:26:32,073 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:26:32" (1/1) ... [2023-12-24 02:26:32,087 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 75 [2023-12-24 02:26:32,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 02:26:32,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 02:26:32,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 02:26:32,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 02:26:32,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:26:32" (1/1) ... [2023-12-24 02:26:32,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:26:32" (1/1) ... [2023-12-24 02:26:32,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:26:32" (1/1) ... [2023-12-24 02:26:32,104 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:26:32,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:26:32" (1/1) ... [2023-12-24 02:26:32,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:26:32" (1/1) ... [2023-12-24 02:26:32,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:26:32" (1/1) ... [2023-12-24 02:26:32,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:26:32" (1/1) ... [2023-12-24 02:26:32,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:26:32" (1/1) ... [2023-12-24 02:26:32,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:26:32" (1/1) ... [2023-12-24 02:26:32,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 02:26:32,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 02:26:32,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 02:26:32,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 02:26:32,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:26:32" (1/1) ... [2023-12-24 02:26:32,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 02:26:32,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 02:26:32,161 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:26:32,213 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:26:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 02:26:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 02:26:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 02:26:32,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 02:26:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 02:26:32,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 02:26:32,290 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 02:26:32,294 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 02:26:32,485 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 02:26:32,513 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 02:26:32,513 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 02:26:32,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:26:32 BoogieIcfgContainer [2023-12-24 02:26:32,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 02:26:32,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 02:26:32,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 02:26:32,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 02:26:32,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 02:26:31" (1/3) ... [2023-12-24 02:26:32,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e70ec9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:26:32, skipping insertion in model container [2023-12-24 02:26:32,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:26:32" (2/3) ... [2023-12-24 02:26:32,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e70ec9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:26:32, skipping insertion in model container [2023-12-24 02:26:32,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:26:32" (3/3) ... [2023-12-24 02:26:32,519 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-9.i [2023-12-24 02:26:32,531 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 02:26:32,531 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 02:26:32,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 02:26:32,570 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;@21a65852, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 02:26:32,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 02:26:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 02:26:32,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-24 02:26:32,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:26:32,583 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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:26:32,583 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:26:32,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:26:32,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1196541095, now seen corresponding path program 1 times [2023-12-24 02:26:32,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:26:32,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147370657] [2023-12-24 02:26:32,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:26:32,594 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:26:32,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:26:32,597 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:26:32,628 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:26:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:26:32,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 02:26:32,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:26:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-24 02:26:32,731 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 02:26:32,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:26:32,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147370657] [2023-12-24 02:26:32,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147370657] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 02:26:32,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 02:26:32,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 02:26:32,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280252175] [2023-12-24 02:26:32,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:26:32,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 02:26:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:26:32,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 02:26:32,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 02:26:32,757 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-24 02:26:32,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:26:32,788 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2023-12-24 02:26:32,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 02:26:32,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2023-12-24 02:26:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:26:32,793 INFO L225 Difference]: With dead ends: 52 [2023-12-24 02:26:32,793 INFO L226 Difference]: Without dead ends: 25 [2023-12-24 02:26:32,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 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:26:32,798 INFO L413 NwaCegarLoop]: 29 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, 29 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 02:26:32,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 02:26:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-24 02:26:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-24 02:26:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-24 02:26:32,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-12-24 02:26:32,821 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 38 [2023-12-24 02:26:32,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:26:32,822 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-12-24 02:26:32,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-24 02:26:32,822 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-12-24 02:26:32,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-24 02:26:32,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:26:32,825 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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:26:32,840 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 (2)] Ended with exit code 0 [2023-12-24 02:26:33,029 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:26:33,030 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:26:33,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:26:33,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1300771305, now seen corresponding path program 1 times [2023-12-24 02:26:33,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:26:33,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263918128] [2023-12-24 02:26:33,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:26:33,044 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:26:33,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:26:33,046 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:26:33,047 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:26:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:26:33,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 02:26:33,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:26:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 02:26:33,239 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 02:26:33,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:26:33,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263918128] [2023-12-24 02:26:33,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263918128] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 02:26:33,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 02:26:33,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 02:26:33,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485436283] [2023-12-24 02:26:33,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:26:33,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 02:26:33,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:26:33,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 02:26:33,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 02:26:33,242 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-24 02:26:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:26:33,363 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2023-12-24 02:26:33,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 02:26:33,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2023-12-24 02:26:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:26:33,365 INFO L225 Difference]: With dead ends: 81 [2023-12-24 02:26:33,365 INFO L226 Difference]: Without dead ends: 57 [2023-12-24 02:26:33,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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 02:26:33,366 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 32 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 02:26:33,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 86 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 02:26:33,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-24 02:26:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2023-12-24 02:26:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 02:26:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2023-12-24 02:26:33,377 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 38 [2023-12-24 02:26:33,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:26:33,378 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2023-12-24 02:26:33,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-24 02:26:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2023-12-24 02:26:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-24 02:26:33,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:26:33,379 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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:26:33,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-24 02:26:33,585 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:26:33,587 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:26:33,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:26:33,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1334005633, now seen corresponding path program 1 times [2023-12-24 02:26:33,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:26:33,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808397141] [2023-12-24 02:26:33,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:26:33,588 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:26:33,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:26:33,591 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:26:33,592 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:26:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:26:33,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 02:26:33,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:26:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 02:26:33,764 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 02:26:33,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:26:33,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808397141] [2023-12-24 02:26:33,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808397141] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 02:26:33,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 02:26:33,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 02:26:33,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12968716] [2023-12-24 02:26:33,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:26:33,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 02:26:33,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:26:33,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 02:26:33,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-24 02:26:33,766 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-24 02:26:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:26:33,856 INFO L93 Difference]: Finished difference Result 109 states and 141 transitions. [2023-12-24 02:26:33,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 02:26:33,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 39 [2023-12-24 02:26:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:26:33,858 INFO L225 Difference]: With dead ends: 109 [2023-12-24 02:26:33,858 INFO L226 Difference]: Without dead ends: 63 [2023-12-24 02:26:33,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-24 02:26:33,860 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 02:26:33,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 91 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 02:26:33,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-24 02:26:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2023-12-24 02:26:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 02:26:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2023-12-24 02:26:33,871 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 39 [2023-12-24 02:26:33,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:26:33,872 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2023-12-24 02:26:33,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-24 02:26:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2023-12-24 02:26:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-24 02:26:33,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:26:33,881 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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:26:33,898 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:26:34,084 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:26:34,085 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:26:34,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:26:34,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1334065215, now seen corresponding path program 1 times [2023-12-24 02:26:34,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:26:34,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568780862] [2023-12-24 02:26:34,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:26:34,086 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:26:34,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:26:34,092 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:26:34,093 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:26:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:26:34,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 02:26:34,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:26:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-24 02:26:38,425 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 02:26:38,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:26:38,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568780862] [2023-12-24 02:26:38,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568780862] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 02:26:38,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 02:26:38,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 02:26:38,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004243994] [2023-12-24 02:26:38,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:26:38,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 02:26:38,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:26:38,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 02:26:38,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-24 02:26:38,427 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-24 02:26:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:26:39,276 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2023-12-24 02:26:39,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 02:26:39,278 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 39 [2023-12-24 02:26:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:26:39,279 INFO L225 Difference]: With dead ends: 68 [2023-12-24 02:26:39,279 INFO L226 Difference]: Without dead ends: 66 [2023-12-24 02:26:39,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-12-24 02:26:39,280 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 64 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 02:26:39,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 59 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 02:26:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-24 02:26:39,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2023-12-24 02:26:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 02:26:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2023-12-24 02:26:39,287 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 39 [2023-12-24 02:26:39,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:26:39,287 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2023-12-24 02:26:39,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-24 02:26:39,287 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2023-12-24 02:26:39,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-24 02:26:39,288 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:26:39,288 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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:26:39,297 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 (5)] Ended with exit code 0 [2023-12-24 02:26:39,494 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:26:39,494 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:26:39,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:26:39,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1391323517, now seen corresponding path program 1 times [2023-12-24 02:26:39,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:26:39,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3787739] [2023-12-24 02:26:39,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:26:39,496 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:26:39,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:26:39,500 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:26:39,501 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:26:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:26:39,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 02:26:39,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:26:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-24 02:26:41,515 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 02:26:41,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:26:41,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3787739] [2023-12-24 02:26:41,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3787739] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 02:26:41,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 02:26:41,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 02:26:41,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849451554] [2023-12-24 02:26:41,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:26:41,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 02:26:41,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:26:41,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 02:26:41,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-24 02:26:41,517 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-24 02:26:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:26:42,069 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2023-12-24 02:26:42,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 02:26:42,069 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 39 [2023-12-24 02:26:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:26:42,070 INFO L225 Difference]: With dead ends: 66 [2023-12-24 02:26:42,070 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 02:26:42,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-12-24 02:26:42,074 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 39 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 02:26:42,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 56 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 02:26:42,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 02:26:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 02:26:42,076 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:26:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 02:26:42,077 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2023-12-24 02:26:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:26:42,078 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 02:26:42,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-24 02:26:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 02:26:42,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 02:26:42,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 02:26:42,093 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 (6)] Forceful destruction successful, exit code 0 [2023-12-24 02:26:42,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:26:42,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 02:26:42,948 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 02:26:42,948 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 02:26:42,948 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 02:26:42,948 INFO L895 garLoopResultBuilder]: At program point L81-2(lines 81 87) the Hoare annotation is: (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse2)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse3))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse2))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse3))))))) (.cse1 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 (= ~var_1_10~0 ~var_1_11~0) (= ~var_1_1~0 ~var_1_3~0) (= ~var_1_9~0 (_ bv64 8)) .cse1) (and (= ~last_1_var_1_8~0 (_ bv100 16)) .cse0 (= ~var_1_8~0 (_ bv100 16)) .cse1))) [2023-12-24 02:26:42,948 INFO L899 garLoopResultBuilder]: For program point L81-3(lines 81 87) no Hoare annotation was computed. [2023-12-24 02:26:42,949 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse2)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse3))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse2))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse3))))))) (.cse1 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 (= ~var_1_9~0 (_ bv64 8)) .cse1) (and (= ~last_1_var_1_8~0 (_ bv100 16)) .cse0 (= ~var_1_8~0 (_ bv100 16)) .cse1))) [2023-12-24 02:26:42,949 INFO L895 garLoopResultBuilder]: At program point L65-1(line 65) the Hoare annotation is: (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse2)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse3))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse2))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse3))))))) (.cse1 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 (= ~var_1_9~0 (_ bv64 8)) .cse1) (and (= ~last_1_var_1_8~0 (_ bv100 16)) .cse0 (= ~var_1_8~0 (_ bv100 16)) .cse1))) [2023-12-24 02:26:42,949 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 02:26:42,949 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-12-24 02:26:42,949 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 02:26:42,949 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse2)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse3))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse2))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse3))))))) (.cse1 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 (= ~var_1_9~0 (_ bv64 8)) .cse1) (and (= ~last_1_var_1_8~0 (_ bv100 16)) .cse0 (= ~var_1_8~0 (_ bv100 16)) .cse1))) [2023-12-24 02:26:42,949 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse2)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse3))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse2))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse3))))))) (.cse1 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 (= ~var_1_9~0 (_ bv64 8)) .cse1) (and (= ~last_1_var_1_8~0 (_ bv100 16)) .cse0 (= ~var_1_8~0 (_ bv100 16)) .cse1))) [2023-12-24 02:26:42,949 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2023-12-24 02:26:42,949 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 52) no Hoare annotation was computed. [2023-12-24 02:26:42,950 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 52) no Hoare annotation was computed. [2023-12-24 02:26:42,950 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 02:26:42,950 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 46) no Hoare annotation was computed. [2023-12-24 02:26:42,950 INFO L899 garLoopResultBuilder]: For program point L38-1(lines 35 47) no Hoare annotation was computed. [2023-12-24 02:26:42,950 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 59) no Hoare annotation was computed. [2023-12-24 02:26:42,950 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-12-24 02:26:42,950 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-12-24 02:26:42,950 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse0 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= ~last_1_var_1_8~0 (_ bv100 16)) (= ~var_1_8~0 (_ bv100 16)) .cse0) (and (= ~var_1_9~0 (_ bv64 8)) .cse0))) [2023-12-24 02:26:42,950 INFO L899 garLoopResultBuilder]: For program point L68-1(lines 60 69) no Hoare annotation was computed. [2023-12-24 02:26:42,950 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 47) no Hoare annotation was computed. [2023-12-24 02:26:42,950 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 02:26:42,950 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 02:26:42,950 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 02:26:42,950 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 02:26:42,953 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-24 02:26:42,954 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 02:26:42,985 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:26:42,985 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:26:42,986 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:26:42,986 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:26:42,986 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:26:42,986 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:26:42,986 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:26:42,986 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:26:42,986 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:26:42,987 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:26:42,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 02:26:42 BoogieIcfgContainer [2023-12-24 02:26:42,987 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 02:26:42,988 INFO L158 Benchmark]: Toolchain (without parser) took 11132.40ms. Allocated memory was 413.1MB in the beginning and 868.2MB in the end (delta: 455.1MB). Free memory was 368.5MB in the beginning and 593.2MB in the end (delta: -224.7MB). Peak memory consumption was 231.3MB. Max. memory is 8.0GB. [2023-12-24 02:26:42,988 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 206.6MB. Free memory was 155.7MB in the beginning and 155.6MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 02:26:42,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.16ms. Allocated memory is still 413.1MB. Free memory was 368.5MB in the beginning and 355.8MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 02:26:42,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.58ms. Allocated memory is still 413.1MB. Free memory was 355.8MB in the beginning and 353.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 02:26:42,988 INFO L158 Benchmark]: Boogie Preprocessor took 44.65ms. Allocated memory is still 413.1MB. Free memory was 353.8MB in the beginning and 351.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 02:26:42,989 INFO L158 Benchmark]: RCFGBuilder took 380.42ms. Allocated memory is still 413.1MB. Free memory was 351.3MB in the beginning and 336.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-24 02:26:42,989 INFO L158 Benchmark]: TraceAbstraction took 10471.97ms. Allocated memory was 413.1MB in the beginning and 868.2MB in the end (delta: 455.1MB). Free memory was 336.0MB in the beginning and 593.2MB in the end (delta: -257.2MB). Peak memory consumption was 198.8MB. Max. memory is 8.0GB. [2023-12-24 02:26:42,990 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.45ms. Allocated memory is still 206.6MB. Free memory was 155.7MB in the beginning and 155.6MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.16ms. Allocated memory is still 413.1MB. Free memory was 368.5MB in the beginning and 355.8MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.58ms. Allocated memory is still 413.1MB. Free memory was 355.8MB in the beginning and 353.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.65ms. Allocated memory is still 413.1MB. Free memory was 353.8MB in the beginning and 351.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 380.42ms. Allocated memory is still 413.1MB. Free memory was 351.3MB in the beginning and 336.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 10471.97ms. Allocated memory was 413.1MB in the beginning and 868.2MB in the end (delta: 455.1MB). Free memory was 336.0MB in the beginning and 593.2MB in the end (delta: -257.2MB). Peak memory consumption was 198.8MB. 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 164 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 321 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 185 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 136 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=4, InterpolantAutomatonStates: 38, 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, 5 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 36 PreInvPairs, 50 NumberOfFragments, 445 HoareAnnotationTreeSize, 36 FormulaSimplifications, 1076 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FormulaSimplificationsInter, 1129 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1053 SizeOfPredicates, 30 NumberOfNonLiveVariables, 399 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 200/200 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: 81]: Loop Invariant Derived loop invariant: ((((var_1_10 == var_1_11) && (var_1_1 == var_1_3)) && (var_1_9 == 64)) || ((last_1_var_1_8 == 100) && (var_1_8 == 100))) RESULT: Ultimate proved your program to be correct! [2023-12-24 02:26:43,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...