/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_floatingpointinfluence_has-floats_file-7.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 19:04:46,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 19:04:46,325 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-23 19:04:46,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 19:04:46,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 19:04:46,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 19:04:46,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 19:04:46,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 19:04:46,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 19:04:46,355 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 19:04:46,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 19:04:46,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 19:04:46,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 19:04:46,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 19:04:46,358 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 19:04:46,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 19:04:46,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 19:04:46,358 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 19:04:46,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 19:04:46,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 19:04:46,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 19:04:46,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 19:04:46,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 19:04:46,361 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 19:04:46,361 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 19:04:46,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 19:04:46,361 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 19:04:46,361 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 19:04:46,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 19:04:46,362 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 19:04:46,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 19:04:46,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 19:04:46,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 19:04:46,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 19:04:46,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 19:04:46,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 19:04:46,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 19:04:46,363 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 19:04:46,363 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 19:04:46,364 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 19:04:46,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 19:04:46,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 19:04:46,364 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 19:04:46,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 19:04:46,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 19:04:46,365 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 19:04:46,365 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-23 19:04:46,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 19:04:46,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 19:04:46,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 19:04:46,569 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 19:04:46,571 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 19:04:46,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-7.i [2023-12-23 19:04:47,587 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 19:04:47,730 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 19:04:47,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-7.i [2023-12-23 19:04:47,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a0f2b726/1926ae345a7b42438b0292d481dedce3/FLAG27c4ed35d [2023-12-23 19:04:47,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a0f2b726/1926ae345a7b42438b0292d481dedce3 [2023-12-23 19:04:47,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 19:04:47,747 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 19:04:47,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 19:04:47,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 19:04:47,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 19:04:47,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 07:04:47" (1/1) ... [2023-12-23 19:04:47,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b527090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:04:47, skipping insertion in model container [2023-12-23 19:04:47,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 07:04:47" (1/1) ... [2023-12-23 19:04:47,768 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 19:04:47,877 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_floatingpointinfluence_has-floats_file-7.i[916,929] [2023-12-23 19:04:47,905 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 19:04:47,914 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 19:04:47,922 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_floatingpointinfluence_has-floats_file-7.i[916,929] [2023-12-23 19:04:47,941 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 19:04:47,953 INFO L206 MainTranslator]: Completed translation [2023-12-23 19:04:47,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:04:47 WrapperNode [2023-12-23 19:04:47,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 19:04:47,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 19:04:47,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 19:04:47,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 19:04:47,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:04:47" (1/1) ... [2023-12-23 19:04:47,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:04:47" (1/1) ... [2023-12-23 19:04:47,985 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2023-12-23 19:04:47,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 19:04:47,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 19:04:47,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 19:04:47,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 19:04:47,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:04:47" (1/1) ... [2023-12-23 19:04:47,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:04:47" (1/1) ... [2023-12-23 19:04:48,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:04:47" (1/1) ... [2023-12-23 19:04:48,038 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-23 19:04:48,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:04:47" (1/1) ... [2023-12-23 19:04:48,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:04:47" (1/1) ... [2023-12-23 19:04:48,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:04:47" (1/1) ... [2023-12-23 19:04:48,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:04:47" (1/1) ... [2023-12-23 19:04:48,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:04:47" (1/1) ... [2023-12-23 19:04:48,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:04:47" (1/1) ... [2023-12-23 19:04:48,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 19:04:48,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 19:04:48,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 19:04:48,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 19:04:48,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:04:47" (1/1) ... [2023-12-23 19:04:48,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 19:04:48,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 19:04:48,086 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-23 19:04:48,095 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-23 19:04:48,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 19:04:48,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 19:04:48,108 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 19:04:48,108 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 19:04:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 19:04:48,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 19:04:48,156 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 19:04:48,159 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 19:04:48,954 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 19:04:48,988 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 19:04:48,988 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 19:04:48,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 07:04:48 BoogieIcfgContainer [2023-12-23 19:04:48,989 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 19:04:48,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 19:04:48,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 19:04:49,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 19:04:49,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 07:04:47" (1/3) ... [2023-12-23 19:04:49,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8bc84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 07:04:49, skipping insertion in model container [2023-12-23 19:04:49,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:04:47" (2/3) ... [2023-12-23 19:04:49,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8bc84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 07:04:49, skipping insertion in model container [2023-12-23 19:04:49,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 07:04:48" (3/3) ... [2023-12-23 19:04:49,007 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-7.i [2023-12-23 19:04:49,019 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 19:04:49,019 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 19:04:49,059 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 19:04:49,064 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;@403d562f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 19:04:49,064 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 19:04:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-23 19:04:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-23 19:04:49,074 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:04:49,074 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 19:04:49,074 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:04:49,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:04:49,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1111700779, now seen corresponding path program 1 times [2023-12-23 19:04:49,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:04:49,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276223534] [2023-12-23 19:04:49,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:04:49,092 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-23 19:04:49,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:04:49,093 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-23 19:04:49,119 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-23 19:04:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:04:49,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 19:04:49,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:04:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2023-12-23 19:04:49,318 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 19:04:49,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:04:49,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276223534] [2023-12-23 19:04:49,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276223534] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 19:04:49,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 19:04:49,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 19:04:49,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868777939] [2023-12-23 19:04:49,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:04:49,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 19:04:49,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:04:49,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 19:04:49,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 19:04:49,348 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-23 19:04:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:04:49,439 INFO L93 Difference]: Finished difference Result 75 states and 130 transitions. [2023-12-23 19:04:49,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 19:04:49,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 75 [2023-12-23 19:04:49,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:04:49,450 INFO L225 Difference]: With dead ends: 75 [2023-12-23 19:04:49,450 INFO L226 Difference]: Without dead ends: 37 [2023-12-23 19:04:49,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-23 19:04:49,457 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 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.1s IncrementalHoareTripleChecker+Time [2023-12-23 19:04:49,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-23 19:04:49,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-23 19:04:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-23 19:04:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-23 19:04:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2023-12-23 19:04:49,483 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 75 [2023-12-23 19:04:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:04:49,484 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2023-12-23 19:04:49,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-23 19:04:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2023-12-23 19:04:49,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-23 19:04:49,486 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:04:49,486 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 19:04:49,494 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-23 19:04:49,689 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-23 19:04:49,690 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:04:49,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:04:49,691 INFO L85 PathProgramCache]: Analyzing trace with hash 579381913, now seen corresponding path program 1 times [2023-12-23 19:04:49,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:04:49,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606316814] [2023-12-23 19:04:49,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:04:49,691 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-23 19:04:49,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:04:49,694 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-23 19:04:49,698 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-23 19:04:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:04:49,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-23 19:04:49,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:05:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-23 19:05:03,475 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 19:05:03,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:05:03,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606316814] [2023-12-23 19:05:03,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606316814] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 19:05:03,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 19:05:03,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-23 19:05:03,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042983107] [2023-12-23 19:05:03,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:05:03,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-23 19:05:03,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:05:03,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-23 19:05:03,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-23 19:05:03,478 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-23 19:05:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:05:05,256 INFO L93 Difference]: Finished difference Result 101 states and 138 transitions. [2023-12-23 19:05:05,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-23 19:05:05,257 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 75 [2023-12-23 19:05:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:05:05,258 INFO L225 Difference]: With dead ends: 101 [2023-12-23 19:05:05,259 INFO L226 Difference]: Without dead ends: 65 [2023-12-23 19:05:05,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2023-12-23 19:05:05,260 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 103 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-23 19:05:05,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 107 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-23 19:05:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-23 19:05:05,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2023-12-23 19:05:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 35 states have internal predecessors, (41), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-23 19:05:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2023-12-23 19:05:05,268 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 75 [2023-12-23 19:05:05,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:05:05,269 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2023-12-23 19:05:05,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-23 19:05:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2023-12-23 19:05:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-23 19:05:05,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:05:05,270 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 19:05:05,280 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-23 19:05:05,477 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-23 19:05:05,478 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:05:05,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:05:05,478 INFO L85 PathProgramCache]: Analyzing trace with hash 529017084, now seen corresponding path program 1 times [2023-12-23 19:05:05,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:05:05,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233629452] [2023-12-23 19:05:05,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:05:05,479 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-23 19:05:05,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:05:05,480 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-23 19:05:05,487 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-23 19:05:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:05:05,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 19:05:05,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:05:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-23 19:05:05,648 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 19:05:05,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:05:05,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233629452] [2023-12-23 19:05:05,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233629452] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 19:05:05,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 19:05:05,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 19:05:05,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487094907] [2023-12-23 19:05:05,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:05:05,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 19:05:05,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:05:05,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 19:05:05,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 19:05:05,652 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-23 19:05:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:05:05,867 INFO L93 Difference]: Finished difference Result 121 states and 156 transitions. [2023-12-23 19:05:05,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 19:05:05,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 76 [2023-12-23 19:05:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:05:05,872 INFO L225 Difference]: With dead ends: 121 [2023-12-23 19:05:05,873 INFO L226 Difference]: Without dead ends: 74 [2023-12-23 19:05:05,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 19:05:05,877 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 24 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-23 19:05:05,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 106 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-23 19:05:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-23 19:05:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2023-12-23 19:05:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 49 states have internal predecessors, (55), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-23 19:05:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2023-12-23 19:05:05,887 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 76 [2023-12-23 19:05:05,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:05:05,887 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2023-12-23 19:05:05,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-23 19:05:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2023-12-23 19:05:05,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-23 19:05:05,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:05:05,888 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 19:05:05,895 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-23 19:05:06,095 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-23 19:05:06,096 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:05:06,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:05:06,096 INFO L85 PathProgramCache]: Analyzing trace with hash 530864126, now seen corresponding path program 1 times [2023-12-23 19:05:06,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:05:06,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283222773] [2023-12-23 19:05:06,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:05:06,097 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-23 19:05:06,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:05:06,098 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-23 19:05:06,100 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-23 19:05:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:05:06,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-23 19:05:06,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:05:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-23 19:05:17,863 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 19:05:17,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:05:17,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283222773] [2023-12-23 19:05:17,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283222773] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 19:05:17,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 19:05:17,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-23 19:05:17,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152529816] [2023-12-23 19:05:17,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:05:17,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-23 19:05:17,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:05:17,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-23 19:05:17,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-23 19:05:17,866 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-23 19:05:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:05:20,183 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2023-12-23 19:05:20,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-23 19:05:20,193 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 76 [2023-12-23 19:05:20,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:05:20,194 INFO L225 Difference]: With dead ends: 78 [2023-12-23 19:05:20,194 INFO L226 Difference]: Without dead ends: 76 [2023-12-23 19:05:20,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2023-12-23 19:05:20,195 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 98 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-23 19:05:20,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 107 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-23 19:05:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-12-23 19:05:20,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2023-12-23 19:05:20,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 47 states have internal predecessors, (52), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-23 19:05:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2023-12-23 19:05:20,203 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 76 [2023-12-23 19:05:20,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:05:20,204 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2023-12-23 19:05:20,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-23 19:05:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2023-12-23 19:05:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-23 19:05:20,205 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:05:20,205 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 19:05:20,213 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-23 19:05:20,412 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-23 19:05:20,413 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:05:20,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:05:20,413 INFO L85 PathProgramCache]: Analyzing trace with hash -795037091, now seen corresponding path program 1 times [2023-12-23 19:05:20,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:05:20,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772197974] [2023-12-23 19:05:20,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:05:20,414 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-23 19:05:20,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:05:20,415 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-23 19:05:20,415 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-23 19:05:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:05:20,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-23 19:05:20,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:05:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-23 19:05:30,742 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 19:05:30,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:05:30,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772197974] [2023-12-23 19:05:30,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772197974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 19:05:30,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 19:05:30,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-23 19:05:30,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733860111] [2023-12-23 19:05:30,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:05:30,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-23 19:05:30,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:05:30,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-23 19:05:30,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-23 19:05:30,744 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-23 19:05:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:05:40,323 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2023-12-23 19:05:40,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-23 19:05:40,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2023-12-23 19:05:40,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:05:40,325 INFO L225 Difference]: With dead ends: 102 [2023-12-23 19:05:40,326 INFO L226 Difference]: Without dead ends: 100 [2023-12-23 19:05:40,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2023-12-23 19:05:40,326 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 90 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-12-23 19:05:40,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 140 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-12-23 19:05:40,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-23 19:05:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2023-12-23 19:05:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 57 states have internal predecessors, (63), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-23 19:05:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2023-12-23 19:05:40,335 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 77 [2023-12-23 19:05:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:05:40,335 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2023-12-23 19:05:40,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-23 19:05:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2023-12-23 19:05:40,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-23 19:05:40,336 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:05:40,336 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 19:05:40,345 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-23 19:05:40,543 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-23 19:05:40,543 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:05:40,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:05:40,544 INFO L85 PathProgramCache]: Analyzing trace with hash -737778789, now seen corresponding path program 1 times [2023-12-23 19:05:40,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:05:40,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907161089] [2023-12-23 19:05:40,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:05:40,545 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-23 19:05:40,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:05:40,546 INFO L229 MonitoredProcess]: Starting monitored process 7 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-23 19:05:40,564 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 (7)] Waiting until timeout for monitored process [2023-12-23 19:05:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:05:40,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-23 19:05:40,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:05:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-23 19:05:45,269 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 19:05:45,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:05:45,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907161089] [2023-12-23 19:05:45,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907161089] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 19:05:45,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 19:05:45,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-23 19:05:45,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705802323] [2023-12-23 19:05:45,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:05:45,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-23 19:05:45,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:05:45,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-23 19:05:45,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-23 19:05:45,271 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-23 19:05:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:05:47,623 INFO L93 Difference]: Finished difference Result 171 states and 212 transitions. [2023-12-23 19:05:47,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-23 19:05:47,623 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2023-12-23 19:05:47,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:05:47,624 INFO L225 Difference]: With dead ends: 171 [2023-12-23 19:05:47,624 INFO L226 Difference]: Without dead ends: 96 [2023-12-23 19:05:47,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2023-12-23 19:05:47,625 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 78 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-23 19:05:47,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 131 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-23 19:05:47,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-23 19:05:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2023-12-23 19:05:47,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-23 19:05:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2023-12-23 19:05:47,633 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 77 [2023-12-23 19:05:47,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:05:47,633 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2023-12-23 19:05:47,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-23 19:05:47,633 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2023-12-23 19:05:47,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-23 19:05:47,634 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:05:47,634 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 19:05:47,646 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 (7)] Forceful destruction successful, exit code 0 [2023-12-23 19:05:47,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-23 19:05:47,842 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:05:47,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:05:47,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1114408197, now seen corresponding path program 1 times [2023-12-23 19:05:47,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:05:47,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519183453] [2023-12-23 19:05:47,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:05:47,843 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-23 19:05:47,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:05:47,844 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-23 19:05:47,871 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-23 19:05:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:05:47,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-23 19:05:47,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:05:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-23 19:05:59,558 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 19:05:59,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:05:59,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519183453] [2023-12-23 19:05:59,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519183453] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 19:05:59,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 19:05:59,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-23 19:05:59,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210055628] [2023-12-23 19:05:59,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:05:59,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-23 19:05:59,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:05:59,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-23 19:05:59,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-23 19:05:59,560 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-23 19:06:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:06:12,644 INFO L93 Difference]: Finished difference Result 175 states and 212 transitions. [2023-12-23 19:06:12,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-23 19:06:12,653 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2023-12-23 19:06:12,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:06:12,654 INFO L225 Difference]: With dead ends: 175 [2023-12-23 19:06:12,654 INFO L226 Difference]: Without dead ends: 0 [2023-12-23 19:06:12,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2023-12-23 19:06:12,655 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 71 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-12-23 19:06:12,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 143 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-12-23 19:06:12,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-23 19:06:12,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-23 19:06:12,656 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-23 19:06:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-23 19:06:12,656 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2023-12-23 19:06:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:06:12,656 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-23 19:06:12,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-23 19:06:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-23 19:06:12,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-23 19:06:12,659 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 19:06:12,666 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-23 19:06:12,859 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-23 19:06:12,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-23 19:06:16,619 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 62) no Hoare annotation was computed. [2023-12-23 19:06:16,619 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-23 19:06:16,619 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-23 19:06:16,620 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2023-12-23 19:06:16,620 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-23 19:06:16,620 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-23 19:06:16,620 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-23 19:06:16,620 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-23 19:06:16,620 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-23 19:06:16,620 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-12-23 19:06:16,620 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 66) no Hoare annotation was computed. [2023-12-23 19:06:16,621 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 61) no Hoare annotation was computed. [2023-12-23 19:06:16,621 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-23 19:06:16,621 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (= currentRoundingMode roundNearestTiesToEven) [2023-12-23 19:06:16,621 INFO L899 garLoopResultBuilder]: For program point L86-1(lines 67 87) no Hoare annotation was computed. [2023-12-23 19:06:16,621 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-23 19:06:16,621 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 45) no Hoare annotation was computed. [2023-12-23 19:06:16,621 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 36 66) no Hoare annotation was computed. [2023-12-23 19:06:16,621 INFO L895 garLoopResultBuilder]: At program point L99-2(lines 99 105) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-23 19:06:16,621 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-23 19:06:16,621 INFO L899 garLoopResultBuilder]: For program point L99-3(lines 99 105) no Hoare annotation was computed. [2023-12-23 19:06:16,621 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-23 19:06:16,622 INFO L895 garLoopResultBuilder]: At program point L83-1(line 83) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-23 19:06:16,622 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-23 19:06:16,622 INFO L895 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-23 19:06:16,622 INFO L899 garLoopResultBuilder]: For program point L46(lines 36 66) no Hoare annotation was computed. [2023-12-23 19:06:16,622 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-23 19:06:16,622 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-23 19:06:16,622 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-12-23 19:06:16,622 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 42) no Hoare annotation was computed. [2023-12-23 19:06:16,622 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2023-12-23 19:06:16,622 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-23 19:06:16,622 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-12-23 19:06:16,623 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-23 19:06:16,623 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-23 19:06:16,623 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-23 19:06:16,623 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-23 19:06:16,623 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-23 19:06:16,623 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-23 19:06:16,625 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-23 19:06:16,626 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 19:06:16,638 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-23 19:06:16,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 07:06:16 BoogieIcfgContainer [2023-12-23 19:06:16,638 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 19:06:16,639 INFO L158 Benchmark]: Toolchain (without parser) took 88891.55ms. Allocated memory was 299.9MB in the beginning and 908.1MB in the end (delta: 608.2MB). Free memory was 249.8MB in the beginning and 571.6MB in the end (delta: -321.9MB). Peak memory consumption was 287.4MB. Max. memory is 8.0GB. [2023-12-23 19:06:16,639 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 181.4MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 19:06:16,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.96ms. Allocated memory is still 299.9MB. Free memory was 249.2MB in the beginning and 235.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-23 19:06:16,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.25ms. Allocated memory is still 299.9MB. Free memory was 235.6MB in the beginning and 234.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 19:06:16,639 INFO L158 Benchmark]: Boogie Preprocessor took 63.58ms. Allocated memory is still 299.9MB. Free memory was 234.0MB in the beginning and 231.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 19:06:16,640 INFO L158 Benchmark]: RCFGBuilder took 938.52ms. Allocated memory is still 299.9MB. Free memory was 231.4MB in the beginning and 212.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-23 19:06:16,640 INFO L158 Benchmark]: TraceAbstraction took 87648.07ms. Allocated memory was 299.9MB in the beginning and 908.1MB in the end (delta: 608.2MB). Free memory was 212.0MB in the beginning and 571.6MB in the end (delta: -359.6MB). Peak memory consumption was 249.6MB. Max. memory is 8.0GB. [2023-12-23 19:06:16,641 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.44ms. Allocated memory is still 181.4MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.96ms. Allocated memory is still 299.9MB. Free memory was 249.2MB in the beginning and 235.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.25ms. Allocated memory is still 299.9MB. Free memory was 235.6MB in the beginning and 234.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.58ms. Allocated memory is still 299.9MB. Free memory was 234.0MB in the beginning and 231.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 938.52ms. Allocated memory is still 299.9MB. Free memory was 231.4MB in the beginning and 212.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 87648.07ms. Allocated memory was 299.9MB in the beginning and 908.1MB in the end (delta: 608.2MB). Free memory was 212.0MB in the beginning and 571.6MB in the end (delta: -359.6MB). Peak memory consumption was 249.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 87.6s, OverallIterations: 7, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 543 SdHoareTripleChecker+Valid, 19.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 464 mSDsluCounter, 785 SdHoareTripleChecker+Invalid, 18.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 479 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1467 IncrementalHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 306 mSDtfsCounter, 1467 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 578 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=6, InterpolantAutomatonStates: 96, 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, 7 MinimizatonAttempts, 58 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 104 PreInvPairs, 130 NumberOfFragments, 448 HoareAnnotationTreeSize, 104 FormulaSimplifications, 22486 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FormulaSimplificationsInter, 9428 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 51.6s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 527 ConstructedInterpolants, 0 QuantifiedInterpolants, 2511 SizeOfPredicates, 70 NumberOfNonLiveVariables, 930 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1848/1848 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: 99]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-23 19:06:16,792 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...