/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_operatoramount_amount10_file-26.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 06:12:44,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 06:12:44,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 06:12:44,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 06:12:44,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 06:12:44,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 06:12:44,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 06:12:44,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 06:12:44,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 06:12:44,141 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 06:12:44,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 06:12:44,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 06:12:44,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 06:12:44,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 06:12:44,143 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 06:12:44,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 06:12:44,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 06:12:44,144 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 06:12:44,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 06:12:44,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 06:12:44,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 06:12:44,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 06:12:44,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 06:12:44,145 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 06:12:44,145 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 06:12:44,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 06:12:44,146 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 06:12:44,146 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 06:12:44,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 06:12:44,147 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 06:12:44,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 06:12:44,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 06:12:44,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 06:12:44,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 06:12:44,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 06:12:44,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 06:12:44,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 06:12:44,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 06:12:44,149 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 06:12:44,149 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 06:12:44,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 06:12:44,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 06:12:44,150 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 06:12:44,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 06:12:44,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 06:12:44,151 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 06:12:44,151 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 06:12:44,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 06:12:44,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 06:12:44,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 06:12:44,364 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 06:12:44,364 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 06:12:44,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2023-12-24 06:12:45,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 06:12:45,624 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 06:12:45,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2023-12-24 06:12:45,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69285e2b6/3cfa65a7021e4b2fb809e469d90855f7/FLAG4f4067c99 [2023-12-24 06:12:45,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69285e2b6/3cfa65a7021e4b2fb809e469d90855f7 [2023-12-24 06:12:45,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 06:12:45,648 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 06:12:45,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 06:12:45,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 06:12:45,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 06:12:45,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 06:12:45" (1/1) ... [2023-12-24 06:12:45,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606b5972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:45, skipping insertion in model container [2023-12-24 06:12:45,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 06:12:45" (1/1) ... [2023-12-24 06:12:45,680 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 06:12:45,802 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_operatoramount_amount10_file-26.i[915,928] [2023-12-24 06:12:45,830 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 06:12:45,849 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 06:12:45,859 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_operatoramount_amount10_file-26.i[915,928] [2023-12-24 06:12:45,867 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 06:12:45,883 INFO L206 MainTranslator]: Completed translation [2023-12-24 06:12:45,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:45 WrapperNode [2023-12-24 06:12:45,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 06:12:45,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 06:12:45,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 06:12:45,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 06:12:45,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:45" (1/1) ... [2023-12-24 06:12:45,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:45" (1/1) ... [2023-12-24 06:12:45,923 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2023-12-24 06:12:45,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 06:12:45,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 06:12:45,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 06:12:45,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 06:12:45,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:45" (1/1) ... [2023-12-24 06:12:45,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:45" (1/1) ... [2023-12-24 06:12:45,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:45" (1/1) ... [2023-12-24 06:12:45,950 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-24 06:12:45,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:45" (1/1) ... [2023-12-24 06:12:45,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:45" (1/1) ... [2023-12-24 06:12:45,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:45" (1/1) ... [2023-12-24 06:12:45,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:45" (1/1) ... [2023-12-24 06:12:45,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:45" (1/1) ... [2023-12-24 06:12:45,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:45" (1/1) ... [2023-12-24 06:12:45,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 06:12:45,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 06:12:45,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 06:12:45,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 06:12:45,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:45" (1/1) ... [2023-12-24 06:12:45,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 06:12:45,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 06:12:45,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 06:12:46,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 06:12:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 06:12:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 06:12:46,035 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 06:12:46,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 06:12:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 06:12:46,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 06:12:46,133 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 06:12:46,136 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 06:12:46,425 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 06:12:46,456 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 06:12:46,456 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 06:12:46,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 06:12:46 BoogieIcfgContainer [2023-12-24 06:12:46,457 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 06:12:46,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 06:12:46,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 06:12:46,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 06:12:46,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 06:12:45" (1/3) ... [2023-12-24 06:12:46,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea2835b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 06:12:46, skipping insertion in model container [2023-12-24 06:12:46,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:45" (2/3) ... [2023-12-24 06:12:46,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea2835b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 06:12:46, skipping insertion in model container [2023-12-24 06:12:46,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 06:12:46" (3/3) ... [2023-12-24 06:12:46,463 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-26.i [2023-12-24 06:12:46,476 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 06:12:46,476 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 06:12:46,514 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 06:12:46,518 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;@672fd90d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 06:12:46,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 06:12:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 06:12:46,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 06:12:46,532 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:12:46,532 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 06:12:46,533 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:12:46,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:12:46,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1590931931, now seen corresponding path program 1 times [2023-12-24 06:12:46,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:12:46,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001524001] [2023-12-24 06:12:46,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:12:46,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:46,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:12:46,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 06:12:46,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 06:12:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:12:46,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 06:12:46,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:12:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-12-24 06:12:46,700 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 06:12:46,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:12:46,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001524001] [2023-12-24 06:12:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001524001] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 06:12:46,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 06:12:46,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 06:12:46,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211744442] [2023-12-24 06:12:46,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:12:46,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 06:12:46,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:12:46,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 06:12:46,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 06:12:46,725 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 06:12:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:12:46,753 INFO L93 Difference]: Finished difference Result 71 states and 123 transitions. [2023-12-24 06:12:46,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 06:12:46,756 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 89 [2023-12-24 06:12:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:12:46,760 INFO L225 Difference]: With dead ends: 71 [2023-12-24 06:12:46,760 INFO L226 Difference]: Without dead ends: 35 [2023-12-24 06:12:46,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 06:12:46,768 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 06:12:46,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 06:12:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-24 06:12:46,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-24 06:12:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 06:12:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2023-12-24 06:12:46,805 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 89 [2023-12-24 06:12:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:12:46,806 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2023-12-24 06:12:46,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 06:12:46,806 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2023-12-24 06:12:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 06:12:46,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:12:46,811 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 06:12:46,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 06:12:47,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:47,016 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:12:47,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:12:47,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2141560935, now seen corresponding path program 1 times [2023-12-24 06:12:47,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:12:47,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411325627] [2023-12-24 06:12:47,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:12:47,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:47,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:12:47,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 06:12:47,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 06:12:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:12:47,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 06:12:47,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:12:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 104 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2023-12-24 06:12:48,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 06:12:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-24 06:12:50,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:12:50,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411325627] [2023-12-24 06:12:50,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411325627] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 06:12:50,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 06:12:50,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-12-24 06:12:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789348643] [2023-12-24 06:12:50,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 06:12:50,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 06:12:50,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:12:50,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 06:12:50,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-12-24 06:12:50,068 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-24 06:12:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:12:51,107 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2023-12-24 06:12:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 06:12:51,109 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 89 [2023-12-24 06:12:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:12:51,110 INFO L225 Difference]: With dead ends: 47 [2023-12-24 06:12:51,110 INFO L226 Difference]: Without dead ends: 45 [2023-12-24 06:12:51,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-12-24 06:12:51,111 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 53 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 06:12:51,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 99 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 06:12:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-24 06:12:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2023-12-24 06:12:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 06:12:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2023-12-24 06:12:51,123 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 89 [2023-12-24 06:12:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:12:51,125 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2023-12-24 06:12:51,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-24 06:12:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2023-12-24 06:12:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 06:12:51,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:12:51,131 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 06:12:51,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-24 06:12:51,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:51,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:12:51,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:12:51,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2141620517, now seen corresponding path program 1 times [2023-12-24 06:12:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:12:51,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130090604] [2023-12-24 06:12:51,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:12:51,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:51,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:12:51,340 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 06:12:51,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 06:12:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:12:51,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 06:12:51,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:12:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 104 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2023-12-24 06:12:52,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 06:12:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-24 06:12:53,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:12:53,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130090604] [2023-12-24 06:12:53,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130090604] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 06:12:53,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 06:12:53,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-12-24 06:12:53,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538364104] [2023-12-24 06:12:53,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 06:12:53,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 06:12:53,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:12:53,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 06:12:53,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-12-24 06:12:53,259 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-24 06:12:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:12:54,174 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2023-12-24 06:12:54,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 06:12:54,177 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 89 [2023-12-24 06:12:54,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:12:54,178 INFO L225 Difference]: With dead ends: 45 [2023-12-24 06:12:54,178 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 06:12:54,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-12-24 06:12:54,179 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 47 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 06:12:54,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 119 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 06:12:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 06:12:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 06:12:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 06:12:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 06:12:54,180 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2023-12-24 06:12:54,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:12:54,181 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 06:12:54,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-24 06:12:54,181 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 06:12:54,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 06:12:54,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 06:12:54,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 06:12:54,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:54,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 06:12:54,878 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (= currentRoundingMode roundNearestTiesToEven) [2023-12-24 06:12:54,878 INFO L899 garLoopResultBuilder]: For program point L64-1(line 64) no Hoare annotation was computed. [2023-12-24 06:12:54,878 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-12-24 06:12:54,878 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:54,878 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:54,878 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 06:12:54,878 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 06:12:54,878 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 06:12:54,879 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2023-12-24 06:12:54,879 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 36 40) no Hoare annotation was computed. [2023-12-24 06:12:54,879 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:54,879 INFO L895 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:54,879 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 06:12:54,879 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-24 06:12:54,879 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:54,879 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:54,879 INFO L895 garLoopResultBuilder]: At program point L78-2(lines 78 84) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:54,880 INFO L899 garLoopResultBuilder]: For program point L78-3(lines 78 84) no Hoare annotation was computed. [2023-12-24 06:12:54,880 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:54,880 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:54,880 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 06:12:54,880 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-12-24 06:12:54,880 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:54,880 INFO L895 garLoopResultBuilder]: At program point L58-1(line 58) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:54,880 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-12-24 06:12:54,880 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:54,880 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:54,881 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 06:12:54,881 INFO L899 garLoopResultBuilder]: For program point L67(lines 44 68) no Hoare annotation was computed. [2023-12-24 06:12:54,881 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-12-24 06:12:54,881 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:54,881 INFO L895 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:54,881 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-12-24 06:12:54,881 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 06:12:54,881 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 06:12:54,881 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 06:12:54,881 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 06:12:54,883 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-24 06:12:54,887 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 06:12:54,903 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 06:12:54,903 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 06:12:54,920 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 06:12:54,921 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 06:12:54,921 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 06:12:54,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 06:12:54 BoogieIcfgContainer [2023-12-24 06:12:54,922 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 06:12:54,922 INFO L158 Benchmark]: Toolchain (without parser) took 9273.84ms. Allocated memory was 333.4MB in the beginning and 481.3MB in the end (delta: 147.8MB). Free memory was 282.2MB in the beginning and 230.4MB in the end (delta: 51.9MB). Peak memory consumption was 200.4MB. Max. memory is 8.0GB. [2023-12-24 06:12:54,922 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 166.7MB. Free memory was 116.5MB in the beginning and 116.4MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 06:12:54,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.59ms. Allocated memory is still 333.4MB. Free memory was 282.2MB in the beginning and 269.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 06:12:54,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.80ms. Allocated memory is still 333.4MB. Free memory was 269.7MB in the beginning and 267.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 06:12:54,924 INFO L158 Benchmark]: Boogie Preprocessor took 38.30ms. Allocated memory is still 333.4MB. Free memory was 267.9MB in the beginning and 265.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 06:12:54,926 INFO L158 Benchmark]: RCFGBuilder took 493.68ms. Allocated memory is still 333.4MB. Free memory was 265.5MB in the beginning and 248.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-24 06:12:54,926 INFO L158 Benchmark]: TraceAbstraction took 8463.39ms. Allocated memory was 333.4MB in the beginning and 481.3MB in the end (delta: 147.8MB). Free memory was 248.0MB in the beginning and 230.4MB in the end (delta: 17.6MB). Peak memory consumption was 165.8MB. Max. memory is 8.0GB. [2023-12-24 06:12:54,928 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.15ms. Allocated memory is still 166.7MB. Free memory was 116.5MB in the beginning and 116.4MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.59ms. Allocated memory is still 333.4MB. Free memory was 282.2MB in the beginning and 269.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.80ms. Allocated memory is still 333.4MB. Free memory was 269.7MB in the beginning and 267.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.30ms. Allocated memory is still 333.4MB. Free memory was 267.9MB in the beginning and 265.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 493.68ms. Allocated memory is still 333.4MB. Free memory was 265.5MB in the beginning and 248.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 8463.39ms. Allocated memory was 333.4MB in the beginning and 481.3MB in the end (delta: 147.8MB). Free memory was 248.0MB in the beginning and 230.4MB in the end (delta: 17.6MB). Peak memory consumption was 165.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 420 IncrementalHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 105 mSDtfsCounter, 420 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=2, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 46 PreInvPairs, 63 NumberOfFragments, 559 HoareAnnotationTreeSize, 46 FormulaSimplifications, 1308 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FormulaSimplificationsInter, 413 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 440 ConstructedInterpolants, 1 QuantifiedInterpolants, 2069 SizeOfPredicates, 46 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1880/2100 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: 78]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-24 06:12:54,959 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...