/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-96.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 06:22:29,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 06:22:29,121 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:22:29,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 06:22:29,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 06:22:29,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 06:22:29,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 06:22:29,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 06:22:29,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 06:22:29,139 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 06:22:29,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 06:22:29,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 06:22:29,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 06:22:29,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 06:22:29,140 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 06:22:29,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 06:22:29,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 06:22:29,141 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 06:22:29,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 06:22:29,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 06:22:29,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 06:22:29,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 06:22:29,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 06:22:29,142 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 06:22:29,143 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 06:22:29,143 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 06:22:29,143 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 06:22:29,143 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 06:22:29,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 06:22:29,143 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 06:22:29,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 06:22:29,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 06:22:29,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 06:22:29,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 06:22:29,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 06:22:29,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 06:22:29,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 06:22:29,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 06:22:29,145 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 06:22:29,145 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 06:22:29,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 06:22:29,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 06:22:29,146 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 06:22:29,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 06:22:29,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 06:22:29,146 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 06:22:29,146 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:22:29,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 06:22:29,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 06:22:29,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 06:22:29,327 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 06:22:29,328 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 06:22:29,329 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-96.i [2023-12-24 06:22:30,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 06:22:30,481 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 06:22:30,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-96.i [2023-12-24 06:22:30,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfbded81b/366db8894a494d8ea740bce72bdeec29/FLAGdb284161e [2023-12-24 06:22:30,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfbded81b/366db8894a494d8ea740bce72bdeec29 [2023-12-24 06:22:30,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 06:22:30,498 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 06:22:30,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 06:22:30,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 06:22:30,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 06:22:30,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 06:22:30" (1/1) ... [2023-12-24 06:22:30,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b5dfc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:22:30, skipping insertion in model container [2023-12-24 06:22:30,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 06:22:30" (1/1) ... [2023-12-24 06:22:30,517 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 06:22:30,602 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-96.i[915,928] [2023-12-24 06:22:30,618 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 06:22:30,640 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 06:22:30,650 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-96.i[915,928] [2023-12-24 06:22:30,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 06:22:30,679 INFO L206 MainTranslator]: Completed translation [2023-12-24 06:22:30,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:22:30 WrapperNode [2023-12-24 06:22:30,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 06:22:30,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 06:22:30,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 06:22:30,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 06:22:30,688 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:22:30" (1/1) ... [2023-12-24 06:22:30,706 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:22:30" (1/1) ... [2023-12-24 06:22:30,721 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 70 [2023-12-24 06:22:30,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 06:22:30,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 06:22:30,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 06:22:30,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 06:22:30,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:22:30" (1/1) ... [2023-12-24 06:22:30,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:22:30" (1/1) ... [2023-12-24 06:22:30,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:22:30" (1/1) ... [2023-12-24 06:22:30,741 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:22:30,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:22:30" (1/1) ... [2023-12-24 06:22:30,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:22:30" (1/1) ... [2023-12-24 06:22:30,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:22:30" (1/1) ... [2023-12-24 06:22:30,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:22:30" (1/1) ... [2023-12-24 06:22:30,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:22:30" (1/1) ... [2023-12-24 06:22:30,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:22:30" (1/1) ... [2023-12-24 06:22:30,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 06:22:30,753 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 06:22:30,753 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 06:22:30,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 06:22:30,754 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:22:30" (1/1) ... [2023-12-24 06:22:30,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 06:22:30,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 06:22:30,777 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:22:30,796 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:22:30,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 06:22:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 06:22:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 06:22:30,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 06:22:30,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 06:22:30,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 06:22:30,874 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 06:22:30,877 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 06:22:31,119 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 06:22:31,203 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 06:22:31,203 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 06:22:31,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 06:22:31 BoogieIcfgContainer [2023-12-24 06:22:31,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 06:22:31,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 06:22:31,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 06:22:31,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 06:22:31,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 06:22:30" (1/3) ... [2023-12-24 06:22:31,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0a9696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 06:22:31, skipping insertion in model container [2023-12-24 06:22:31,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:22:30" (2/3) ... [2023-12-24 06:22:31,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0a9696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 06:22:31, skipping insertion in model container [2023-12-24 06:22:31,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 06:22:31" (3/3) ... [2023-12-24 06:22:31,214 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-96.i [2023-12-24 06:22:31,226 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 06:22:31,227 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 06:22:31,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 06:22:31,260 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;@706d3e60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 06:22:31,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 06:22:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 06:22:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-24 06:22:31,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:22:31,269 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 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:22:31,269 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:22:31,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:22:31,273 INFO L85 PathProgramCache]: Analyzing trace with hash -448125412, now seen corresponding path program 1 times [2023-12-24 06:22:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:22:31,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188361334] [2023-12-24 06:22:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:22:31,282 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:22:31,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:22:31,284 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:22:31,285 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:22:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:22:31,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 06:22:31,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:22:31,467 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-24 06:22:31,467 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 06:22:31,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:22:31,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188361334] [2023-12-24 06:22:31,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188361334] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 06:22:31,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 06:22:31,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 06:22:31,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044644043] [2023-12-24 06:22:31,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:22:31,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 06:22:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:22:31,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 06:22:31,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 06:22:31,517 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 06:22:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:22:31,577 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2023-12-24 06:22:31,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 06:22:31,581 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2023-12-24 06:22:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:22:31,585 INFO L225 Difference]: With dead ends: 51 [2023-12-24 06:22:31,585 INFO L226 Difference]: Without dead ends: 25 [2023-12-24 06:22:31,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:22:31,589 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 06:22:31,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 06:22:31,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-24 06:22:31,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-24 06:22:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 06:22:31,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-12-24 06:22:31,644 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 51 [2023-12-24 06:22:31,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:22:31,648 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-12-24 06:22:31,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 06:22:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-12-24 06:22:31,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-24 06:22:31,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:22:31,650 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 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:22:31,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 06:22:31,853 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:22:31,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:22:31,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:22:31,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1551569368, now seen corresponding path program 1 times [2023-12-24 06:22:31,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:22:31,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176794713] [2023-12-24 06:22:31,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:22:31,856 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:22:31,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:22:31,857 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:22:31,859 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:22:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:22:31,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 06:22:31,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:23:13,009 WARN L293 SmtUtils]: Spent 7.33s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:23:20,401 WARN L293 SmtUtils]: Spent 7.39s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:23:27,957 WARN L293 SmtUtils]: Spent 7.52s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:23:40,398 WARN L293 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:25:52,721 WARN L293 SmtUtils]: Spent 7.69s on a formula simplification. DAG size of input: 6 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:26:04,879 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:26:12,933 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:26:20,990 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:26:26,204 WARN L293 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:27:55,359 WARN L293 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:28:35,002 WARN L293 SmtUtils]: Spent 6.93s on a formula simplification. DAG size of input: 6 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:28:43,624 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:29:20,200 WARN L293 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:29:27,496 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((~var_1_8~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_7~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 255.0 2.0))) (.cse0 (fp.add roundNearestTiesToEven ~var_1_7~0 ~var_1_8~0)) (.cse2 (fp.neg ~var_1_7~0))) (and (not (fp.eq .cse0 (fp.add roundNearestTiesToEven ~var_1_7~0 .cse1))) (fp.eq .cse0 (fp.add roundNearestTiesToEven .cse2 .cse1)) (fp.eq .cse0 (fp.add roundNearestTiesToEven .cse2 ~var_1_8~0))))) (fp.geq ~var_1_8~0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (fp.leq ~var_1_8~0 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from true [2023-12-24 06:29:41,426 WARN L293 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:29:56,219 WARN L854 $PredicateComparison]: unable to prove that (exists ((~var_1_8~0 (_ FloatingPoint 8 24)) (~var_1_7~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 255.0 2.0))) (.cse0 (fp.add roundNearestTiesToEven ~var_1_7~0 ~var_1_8~0)) (.cse2 (fp.neg ~var_1_7~0))) (and (not (fp.eq .cse0 (fp.add roundNearestTiesToEven ~var_1_7~0 .cse1))) (fp.eq .cse0 (fp.add roundNearestTiesToEven .cse2 .cse1)) (fp.eq .cse0 (fp.add roundNearestTiesToEven .cse2 ~var_1_8~0))))) is different from false [2023-12-24 06:30:00,235 WARN L876 $PredicateComparison]: unable to prove that (exists ((~var_1_8~0 (_ FloatingPoint 8 24)) (~var_1_7~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 255.0 2.0))) (.cse0 (fp.add roundNearestTiesToEven ~var_1_7~0 ~var_1_8~0)) (.cse2 (fp.neg ~var_1_7~0))) (and (not (fp.eq .cse0 (fp.add roundNearestTiesToEven ~var_1_7~0 .cse1))) (fp.eq .cse0 (fp.add roundNearestTiesToEven .cse2 .cse1)) (fp.eq .cse0 (fp.add roundNearestTiesToEven .cse2 ~var_1_8~0))))) is different from true [2023-12-24 06:30:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-24 06:30:00,236 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 06:30:00,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:30:00,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176794713] [2023-12-24 06:30:00,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176794713] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 06:30:00,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 06:30:00,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-24 06:30:00,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836044668] [2023-12-24 06:30:00,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:30:00,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 06:30:00,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:30:00,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 06:30:00,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=74, Unknown=3, NotChecked=38, Total=156 [2023-12-24 06:30:00,240 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 06:31:04,958 WARN L293 SmtUtils]: Spent 46.19s on a formula simplification. DAG size of input: 86 DAG size of output: 83 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 06:31:09,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 06:31:13,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 06:31:17,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 06:31:21,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 06:31:25,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 06:31:29,061 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse2 (fp.neg .cse1)) (.cse3 (fp.neg .cse0))) (and (or (and (fp.leq c_~var_1_7~0 .cse0) (fp.geq c_~var_1_7~0 .cse1)) (and (fp.leq c_~var_1_7~0 .cse2) (fp.geq c_~var_1_7~0 .cse3))) (= c_~var_1_9~0 ((_ zero_extend 8) c_~var_1_4~0)) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) c_~var_1_4~0) (bvneg ((_ zero_extend 24) c_~var_1_5~0)))) c_~var_1_1~0) (exists ((~var_1_8~0 (_ FloatingPoint 8 24)) (~var_1_7~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 255.0 2.0))) (.cse4 (fp.add roundNearestTiesToEven ~var_1_7~0 ~var_1_8~0)) (.cse6 (fp.neg ~var_1_7~0))) (and (not (fp.eq .cse4 (fp.add roundNearestTiesToEven ~var_1_7~0 .cse5))) (fp.eq .cse4 (fp.add roundNearestTiesToEven .cse6 .cse5)) (fp.eq .cse4 (fp.add roundNearestTiesToEven .cse6 ~var_1_8~0))))) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode (/ 255.0 2.0)))) (let ((.cse7 (fp.lt .cse8 c_~var_1_8~0))) (let ((.cse10 (fp.lt c_~var_1_7~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse9 (not .cse7))) (or (and (or (and .cse7 (= (fp.add c_currentRoundingMode c_~var_1_7~0 .cse8) c_~var_1_6~0)) (and (= (fp.add c_currentRoundingMode c_~var_1_7~0 c_~var_1_8~0) c_~var_1_6~0) .cse9)) (not .cse10)) (and .cse10 (let ((.cse11 (fp.neg c_~var_1_7~0))) (or (and (= (fp.add c_currentRoundingMode .cse11 c_~var_1_8~0) c_~var_1_6~0) .cse9) (and .cse7 (= (fp.add c_currentRoundingMode .cse11 .cse8) c_~var_1_6~0))))))))) (or (and (fp.leq c_~var_1_8~0 .cse2) (fp.geq c_~var_1_8~0 .cse3)) (and (fp.leq c_~var_1_8~0 .cse0) (fp.geq c_~var_1_8~0 .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-12-24 06:31:30,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 06:31:42,220 WARN L293 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 06:31:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:31:59,024 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2023-12-24 06:31:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 06:31:59,035 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2023-12-24 06:31:59,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:31:59,035 INFO L225 Difference]: With dead ends: 45 [2023-12-24 06:31:59,035 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 06:31:59,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 110.7s TimeCoverageRelationStatistics Valid=129, Invalid=255, Unknown=8, NotChecked=114, Total=506 [2023-12-24 06:31:59,037 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 16 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 26.6s IncrementalHoareTripleChecker+Time [2023-12-24 06:31:59,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 44 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 162 Invalid, 5 Unknown, 98 Unchecked, 26.6s Time] [2023-12-24 06:31:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 06:31:59,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 06:31:59,038 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:31:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 06:31:59,038 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2023-12-24 06:31:59,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:31:59,038 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 06:31:59,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-24 06:31:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 06:31:59,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 06:31:59,046 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 06:31:59,055 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:31:59,255 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:31:59,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 06:32:06,759 WARN L293 SmtUtils]: Spent 6.56s on a formula simplification. DAG size of input: 108 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 06:32:06,761 INFO L895 garLoopResultBuilder]: At program point L64-2(lines 64 70) the Hoare annotation is: (let ((.cse3 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse2 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3))) (and (or (and (fp.geq ~var_1_8~0 .cse0) (fp.leq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 .cse2) (fp.geq ~var_1_8~0 .cse3))) (or (and (fp.geq ~var_1_7~0 .cse0) (fp.leq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:32:06,761 INFO L899 garLoopResultBuilder]: For program point L64-3(lines 64 70) no Hoare annotation was computed. [2023-12-24 06:32:06,761 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 06:32:06,761 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 06:32:06,761 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse3 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse2 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3))) (and (or (and (fp.geq ~var_1_8~0 .cse0) (fp.leq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 .cse2) (fp.geq ~var_1_8~0 .cse3))) (or (and (fp.geq ~var_1_7~0 .cse0) (fp.leq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:32:06,762 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 06:32:06,762 INFO L895 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse3 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse2 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3))) (and (or (and (fp.geq ~var_1_8~0 .cse0) (fp.leq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 .cse2) (fp.geq ~var_1_8~0 .cse3))) (or (and (fp.geq ~var_1_7~0 .cse0) (fp.leq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:32:06,762 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 38) no Hoare annotation was computed. [2023-12-24 06:32:06,762 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 39) no Hoare annotation was computed. [2023-12-24 06:32:06,762 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 06:32:06,762 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_7~0 (fp.neg .cse0)) (fp.leq ~var_1_7~0 (fp.neg .cse1))) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:32:06,762 INFO L899 garLoopResultBuilder]: For program point L53-1(lines 40 54) no Hoare annotation was computed. [2023-12-24 06:32:06,762 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2023-12-24 06:32:06,762 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse3 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse2 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3))) (and (or (and (fp.geq ~var_1_8~0 .cse0) (fp.leq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 .cse2) (fp.geq ~var_1_8~0 .cse3))) (or (and (fp.geq ~var_1_7~0 .cse0) (fp.leq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:32:06,767 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse3 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse2 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3))) (and (or (and (fp.geq ~var_1_8~0 .cse0) (fp.leq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 .cse2) (fp.geq ~var_1_8~0 .cse3))) (or (and (fp.geq ~var_1_7~0 .cse0) (fp.leq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:32:06,767 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 06:32:06,767 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-12-24 06:32:06,767 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse3 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse2 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3))) (and (or (and (fp.geq ~var_1_8~0 .cse0) (fp.leq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 .cse2) (fp.geq ~var_1_8~0 .cse3))) (or (and (fp.geq ~var_1_7~0 .cse0) (fp.leq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:32:06,767 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 06:32:06,767 INFO L895 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: (let ((.cse3 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse2 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3))) (and (or (and (fp.geq ~var_1_8~0 .cse0) (fp.leq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 .cse2) (fp.geq ~var_1_8~0 .cse3))) (or (and (fp.geq ~var_1_7~0 .cse0) (fp.leq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:32:06,767 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (= currentRoundingMode roundNearestTiesToEven) [2023-12-24 06:32:06,767 INFO L899 garLoopResultBuilder]: For program point L51-1(line 51) no Hoare annotation was computed. [2023-12-24 06:32:06,767 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-12-24 06:32:06,767 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 06:32:06,768 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 06:32:06,768 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 06:32:06,769 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 06:32:06,771 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-24 06:32:06,773 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 06:32:06,786 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 06:32:06,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 06:32:06 BoogieIcfgContainer [2023-12-24 06:32:06,787 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 06:32:06,788 INFO L158 Benchmark]: Toolchain (without parser) took 576288.80ms. Allocated memory was 176.2MB in the beginning and 726.7MB in the end (delta: 550.5MB). Free memory was 134.2MB in the beginning and 647.8MB in the end (delta: -513.5MB). Peak memory consumption was 38.0MB. Max. memory is 8.0GB. [2023-12-24 06:32:06,788 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 06:32:06,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.13ms. Allocated memory is still 176.2MB. Free memory was 133.9MB in the beginning and 121.7MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 06:32:06,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.56ms. Allocated memory is still 176.2MB. Free memory was 121.7MB in the beginning and 119.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 06:32:06,788 INFO L158 Benchmark]: Boogie Preprocessor took 27.82ms. Allocated memory is still 176.2MB. Free memory was 119.9MB in the beginning and 117.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 06:32:06,789 INFO L158 Benchmark]: RCFGBuilder took 450.26ms. Allocated memory is still 176.2MB. Free memory was 117.5MB in the beginning and 102.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-24 06:32:06,789 INFO L158 Benchmark]: TraceAbstraction took 575580.82ms. Allocated memory was 176.2MB in the beginning and 726.7MB in the end (delta: 550.5MB). Free memory was 102.1MB in the beginning and 647.8MB in the end (delta: -545.7MB). Peak memory consumption was 5.5MB. Max. memory is 8.0GB. [2023-12-24 06:32:06,790 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.13ms. Allocated memory is still 176.2MB. Free memory was 133.9MB in the beginning and 121.7MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.56ms. Allocated memory is still 176.2MB. Free memory was 121.7MB in the beginning and 119.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.82ms. Allocated memory is still 176.2MB. Free memory was 119.9MB in the beginning and 117.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 450.26ms. Allocated memory is still 176.2MB. Free memory was 117.5MB in the beginning and 102.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 575580.82ms. Allocated memory was 176.2MB in the beginning and 726.7MB in the end (delta: 550.5MB). Free memory was 102.1MB in the beginning and 647.8MB in the end (delta: -545.7MB). Peak memory consumption was 5.5MB. 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 575.5s, OverallIterations: 2, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 118.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 26.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 26.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 98 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 165 IncrementalHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 47 mSDtfsCounter, 165 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 110.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 21, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 27 PreInvPairs, 39 NumberOfFragments, 411 HoareAnnotationTreeSize, 27 FormulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FormulaSimplificationsInter, 1317 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 448.3s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 100 ConstructedInterpolants, 2 QuantifiedInterpolants, 777 SizeOfPredicates, 15 NumberOfNonLiveVariables, 188 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 224/224 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: 64]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-24 06:32:07,007 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 06:32:07,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...