/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_amount100_file-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 04:52:04,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 04:52:04,249 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 04:52:04,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 04:52:04,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 04:52:04,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 04:52:04,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 04:52:04,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 04:52:04,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 04:52:04,278 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 04:52:04,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 04:52:04,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 04:52:04,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 04:52:04,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 04:52:04,280 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 04:52:04,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 04:52:04,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 04:52:04,281 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 04:52:04,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 04:52:04,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 04:52:04,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 04:52:04,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 04:52:04,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 04:52:04,283 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 04:52:04,283 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 04:52:04,283 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 04:52:04,284 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 04:52:04,284 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 04:52:04,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 04:52:04,284 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 04:52:04,285 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 04:52:04,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 04:52:04,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 04:52:04,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 04:52:04,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 04:52:04,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 04:52:04,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 04:52:04,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 04:52:04,286 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 04:52:04,286 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 04:52:04,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 04:52:04,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 04:52:04,286 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 04:52:04,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 04:52:04,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 04:52:04,287 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 04:52:04,287 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 04:52:04,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 04:52:04,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 04:52:04,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 04:52:04,455 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 04:52:04,455 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 04:52:04,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-2.i [2023-12-24 04:52:05,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 04:52:05,717 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 04:52:05,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-2.i [2023-12-24 04:52:05,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/732d201d1/dee0d69bf85e406397dc4d7208d7bc6e/FLAG5ad1b58c7 [2023-12-24 04:52:05,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/732d201d1/dee0d69bf85e406397dc4d7208d7bc6e [2023-12-24 04:52:05,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 04:52:05,742 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 04:52:05,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 04:52:05,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 04:52:05,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 04:52:05,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 04:52:05" (1/1) ... [2023-12-24 04:52:05,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cd6dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:05, skipping insertion in model container [2023-12-24 04:52:05,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 04:52:05" (1/1) ... [2023-12-24 04:52:05,766 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 04:52:05,868 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_amount100_file-2.i[915,928] [2023-12-24 04:52:05,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 04:52:05,950 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 04:52:05,965 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_amount100_file-2.i[915,928] [2023-12-24 04:52:06,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 04:52:06,039 INFO L206 MainTranslator]: Completed translation [2023-12-24 04:52:06,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:06 WrapperNode [2023-12-24 04:52:06,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 04:52:06,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 04:52:06,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 04:52:06,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 04:52:06,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:06" (1/1) ... [2023-12-24 04:52:06,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:06" (1/1) ... [2023-12-24 04:52:06,078 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2023-12-24 04:52:06,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 04:52:06,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 04:52:06,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 04:52:06,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 04:52:06,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:06" (1/1) ... [2023-12-24 04:52:06,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:06" (1/1) ... [2023-12-24 04:52:06,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:06" (1/1) ... [2023-12-24 04:52:06,105 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 04:52:06,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:06" (1/1) ... [2023-12-24 04:52:06,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:06" (1/1) ... [2023-12-24 04:52:06,114 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:06" (1/1) ... [2023-12-24 04:52:06,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:06" (1/1) ... [2023-12-24 04:52:06,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:06" (1/1) ... [2023-12-24 04:52:06,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:06" (1/1) ... [2023-12-24 04:52:06,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 04:52:06,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 04:52:06,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 04:52:06,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 04:52:06,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:06" (1/1) ... [2023-12-24 04:52:06,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 04:52:06,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 04:52:06,185 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 04:52:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 04:52:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 04:52:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 04:52:06,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 04:52:06,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 04:52:06,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 04:52:06,225 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 04:52:06,294 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 04:52:06,296 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 04:52:22,096 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 04:52:22,151 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 04:52:22,151 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 04:52:22,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 04:52:22 BoogieIcfgContainer [2023-12-24 04:52:22,152 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 04:52:22,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 04:52:22,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 04:52:22,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 04:52:22,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 04:52:05" (1/3) ... [2023-12-24 04:52:22,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d137607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 04:52:22, skipping insertion in model container [2023-12-24 04:52:22,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:52:06" (2/3) ... [2023-12-24 04:52:22,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d137607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 04:52:22, skipping insertion in model container [2023-12-24 04:52:22,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 04:52:22" (3/3) ... [2023-12-24 04:52:22,157 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-2.i [2023-12-24 04:52:22,168 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 04:52:22,168 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 04:52:22,210 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 04:52:22,214 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;@a45c6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 04:52:22,214 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 04:52:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-24 04:52:22,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2023-12-24 04:52:22,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 04:52:22,230 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 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, 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, 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 04:52:22,230 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 04:52:22,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 04:52:22,249 INFO L85 PathProgramCache]: Analyzing trace with hash -588249247, now seen corresponding path program 1 times [2023-12-24 04:52:22,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 04:52:22,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493096012] [2023-12-24 04:52:22,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 04:52:22,261 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 04:52:22,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 04:52:22,278 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 04:52:22,311 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 04:52:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 04:52:23,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 04:52:23,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 04:52:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1006 proven. 0 refuted. 0 times theorem prover too weak. 1514 trivial. 0 not checked. [2023-12-24 04:52:23,459 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 04:52:23,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 04:52:23,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493096012] [2023-12-24 04:52:23,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493096012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 04:52:23,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 04:52:23,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 04:52:23,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187643176] [2023-12-24 04:52:23,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 04:52:23,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 04:52:23,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 04:52:23,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 04:52:23,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 04:52:23,490 INFO L87 Difference]: Start difference. First operand has 93 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2023-12-24 04:52:28,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.80s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 04:52:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 04:52:28,341 INFO L93 Difference]: Finished difference Result 183 states and 330 transitions. [2023-12-24 04:52:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 04:52:28,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 222 [2023-12-24 04:52:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 04:52:28,646 INFO L225 Difference]: With dead ends: 183 [2023-12-24 04:52:28,646 INFO L226 Difference]: Without dead ends: 91 [2023-12-24 04:52:28,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 221 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 04:52:28,653 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-24 04:52:28,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2023-12-24 04:52:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-24 04:52:28,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-12-24 04:52:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-24 04:52:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 143 transitions. [2023-12-24 04:52:28,698 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 143 transitions. Word has length 222 [2023-12-24 04:52:28,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 04:52:28,698 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 143 transitions. [2023-12-24 04:52:28,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2023-12-24 04:52:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 143 transitions. [2023-12-24 04:52:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2023-12-24 04:52:28,702 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 04:52:28,702 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 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, 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, 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 04:52:28,725 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 04:52:28,923 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 04:52:28,923 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 04:52:28,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 04:52:28,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1263039141, now seen corresponding path program 1 times [2023-12-24 04:52:28,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 04:52:28,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527895231] [2023-12-24 04:52:28,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 04:52:28,925 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 04:52:28,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 04:52:28,930 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 04:52:28,932 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 04:52:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 04:52:30,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 04:52:30,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 04:52:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-24 04:52:30,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 04:52:30,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 04:52:30,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527895231] [2023-12-24 04:52:30,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527895231] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 04:52:30,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 04:52:30,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 04:52:30,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855379726] [2023-12-24 04:52:30,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 04:52:30,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 04:52:30,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 04:52:30,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 04:52:30,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 04:52:30,284 INFO L87 Difference]: Start difference. First operand 91 states and 143 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-24 04:52:35,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.73s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 04:52:39,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 04:52:43,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 04:52:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 04:52:43,156 INFO L93 Difference]: Finished difference Result 200 states and 312 transitions. [2023-12-24 04:52:43,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 04:52:43,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2023-12-24 04:52:43,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 04:52:43,479 INFO L225 Difference]: With dead ends: 200 [2023-12-24 04:52:43,479 INFO L226 Difference]: Without dead ends: 110 [2023-12-24 04:52:43,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 04:52:43,481 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 17 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2023-12-24 04:52:43,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 273 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2023-12-24 04:52:43,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-24 04:52:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2023-12-24 04:52:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-24 04:52:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 158 transitions. [2023-12-24 04:52:43,525 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 158 transitions. Word has length 222 [2023-12-24 04:52:43,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 04:52:43,530 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 158 transitions. [2023-12-24 04:52:43,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-24 04:52:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 158 transitions. [2023-12-24 04:52:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2023-12-24 04:52:43,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 04:52:43,534 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 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, 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, 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 04:52:43,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 04:52:43,760 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 04:52:43,761 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 04:52:43,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 04:52:43,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1781240195, now seen corresponding path program 1 times [2023-12-24 04:52:43,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 04:52:43,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971977984] [2023-12-24 04:52:43,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 04:52:43,763 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 04:52:43,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 04:52:43,767 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 04:52:43,795 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 04:52:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 04:52:44,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 04:52:44,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 04:52:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-24 04:52:45,096 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 04:52:45,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 04:52:45,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971977984] [2023-12-24 04:52:45,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971977984] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 04:52:45,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 04:52:45,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 04:52:45,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327337840] [2023-12-24 04:52:45,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 04:52:45,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 04:52:45,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 04:52:45,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 04:52:45,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 04:52:45,099 INFO L87 Difference]: Start difference. First operand 101 states and 158 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-24 04:52:50,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.75s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 04:52:54,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 04:52:58,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 04:52:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 04:52:58,442 INFO L93 Difference]: Finished difference Result 244 states and 375 transitions. [2023-12-24 04:52:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 04:52:58,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 223 [2023-12-24 04:52:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 04:52:58,445 INFO L225 Difference]: With dead ends: 244 [2023-12-24 04:52:58,445 INFO L226 Difference]: Without dead ends: 144 [2023-12-24 04:52:58,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 04:52:58,447 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 37 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2023-12-24 04:52:58,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 271 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 13.3s Time] [2023-12-24 04:52:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-24 04:52:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2023-12-24 04:52:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 96 states have internal predecessors, (129), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-24 04:52:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2023-12-24 04:52:58,460 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 223 [2023-12-24 04:52:58,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 04:52:58,460 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2023-12-24 04:52:58,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-24 04:52:58,461 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2023-12-24 04:52:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2023-12-24 04:52:58,463 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 04:52:58,463 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 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, 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, 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 04:52:58,497 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 04:52:58,684 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 04:52:58,685 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 04:52:58,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 04:52:58,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1838498497, now seen corresponding path program 1 times [2023-12-24 04:52:58,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 04:52:58,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793880735] [2023-12-24 04:52:58,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 04:52:58,686 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 04:52:58,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 04:52:58,688 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 04:52:58,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 04:53:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 04:53:00,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-24 04:53:00,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 04:54:42,681 WARN L293 SmtUtils]: Spent 8.81s 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 04:54:51,532 WARN L293 SmtUtils]: Spent 8.85s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:55:00,603 WARN L293 SmtUtils]: Spent 9.07s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:55:09,481 WARN L293 SmtUtils]: Spent 8.88s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:55:18,023 WARN L293 SmtUtils]: Spent 8.54s 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 04:55:26,938 WARN L293 SmtUtils]: Spent 8.91s 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 04:55:35,874 WARN L293 SmtUtils]: Spent 8.94s 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 04:55:44,786 WARN L293 SmtUtils]: Spent 8.91s 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 04:55:53,706 WARN L293 SmtUtils]: Spent 8.92s 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 04:56:02,687 WARN L293 SmtUtils]: Spent 8.98s 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 04:56:11,621 WARN L293 SmtUtils]: Spent 8.93s 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 04:56:20,566 WARN L293 SmtUtils]: Spent 8.94s 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 04:56:29,501 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:56:38,479 WARN L293 SmtUtils]: Spent 8.98s 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 04:56:47,433 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:56:56,390 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:57:05,335 WARN L293 SmtUtils]: Spent 8.94s 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 04:57:12,930 WARN L293 SmtUtils]: Spent 7.59s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:57:21,893 WARN L293 SmtUtils]: Spent 8.96s 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 04:57:26,155 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse3 ((_ sign_extend 24) c_~var_1_27~0))) (and (bvsge .cse0 (_ bv4294967233 32)) (= (bvadd c_~var_1_8~0 (_ bv10 8)) (_ bv0 8)) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (bvsle .cse0 (_ bv63 32)) (fp.leq c_~var_1_4~0 .cse1) (bvsle ((_ zero_extend 24) c_~var_1_23~0) (_ bv127 32)) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse3 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))))) (bvsle .cse3 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from false [2023-12-24 04:57:30,414 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse3 ((_ sign_extend 24) c_~var_1_27~0))) (and (bvsge .cse0 (_ bv4294967233 32)) (= (bvadd c_~var_1_8~0 (_ bv10 8)) (_ bv0 8)) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (bvsle .cse0 (_ bv63 32)) (fp.leq c_~var_1_4~0 .cse1) (bvsle ((_ zero_extend 24) c_~var_1_23~0) (_ bv127 32)) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse3 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))))) (bvsle .cse3 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from true [2023-12-24 04:57:39,405 WARN L293 SmtUtils]: Spent 8.96s 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 04:57:48,339 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:57:57,286 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:58:06,252 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:58:14,767 WARN L293 SmtUtils]: Spent 8.51s 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 04:58:23,718 WARN L293 SmtUtils]: Spent 8.95s 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 04:58:32,700 WARN L293 SmtUtils]: Spent 8.98s 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 04:58:41,653 WARN L293 SmtUtils]: Spent 8.95s 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 04:58:50,634 WARN L293 SmtUtils]: Spent 8.98s 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 04:58:59,594 WARN L293 SmtUtils]: Spent 8.96s 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 04:59:08,528 WARN L293 SmtUtils]: Spent 8.93s 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 04:59:17,464 WARN L293 SmtUtils]: Spent 8.94s 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 04:59:26,400 WARN L293 SmtUtils]: Spent 8.94s 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 04:59:35,345 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 04:59:44,289 WARN L293 SmtUtils]: Spent 8.94s 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 04:59:53,258 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:00:02,221 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:00:11,221 WARN L293 SmtUtils]: Spent 9.00s 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 05:00:20,254 WARN L293 SmtUtils]: Spent 9.03s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:00:29,394 WARN L293 SmtUtils]: Spent 9.14s 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 05:00:33,688 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse3 ((_ sign_extend 24) c_~var_1_27~0))) (and (bvsge .cse0 (_ bv4294967233 32)) (= |c_ULTIMATE.start_step_~stepLocal_4~0#1| c_~var_1_11~0) (= (bvadd c_~var_1_8~0 (_ bv10 8)) (_ bv0 8)) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (bvsle .cse0 (_ bv63 32)) (fp.leq c_~var_1_4~0 .cse1) (bvsle ((_ zero_extend 24) c_~var_1_23~0) (_ bv127 32)) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse3 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))))) (bvsle .cse3 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from false [2023-12-24 05:00:37,956 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse3 ((_ sign_extend 24) c_~var_1_27~0))) (and (bvsge .cse0 (_ bv4294967233 32)) (= |c_ULTIMATE.start_step_~stepLocal_4~0#1| c_~var_1_11~0) (= (bvadd c_~var_1_8~0 (_ bv10 8)) (_ bv0 8)) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (bvsle .cse0 (_ bv63 32)) (fp.leq c_~var_1_4~0 .cse1) (bvsle ((_ zero_extend 24) c_~var_1_23~0) (_ bv127 32)) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse3 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))))) (bvsle .cse3 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from true [2023-12-24 05:00:46,946 WARN L293 SmtUtils]: Spent 8.98s 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 05:00:56,019 WARN L293 SmtUtils]: Spent 9.07s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:01:04,992 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:01:14,001 WARN L293 SmtUtils]: Spent 9.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:01:22,605 WARN L293 SmtUtils]: Spent 8.60s 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 05:01:31,782 WARN L293 SmtUtils]: Spent 9.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:01:40,791 WARN L293 SmtUtils]: Spent 9.01s 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 05:01:49,810 WARN L293 SmtUtils]: Spent 9.02s 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 05:01:58,818 WARN L293 SmtUtils]: Spent 9.01s 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 05:02:07,804 WARN L293 SmtUtils]: Spent 8.99s 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 05:02:16,789 WARN L293 SmtUtils]: Spent 8.98s 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 05:02:25,820 WARN L293 SmtUtils]: Spent 9.03s 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 05:02:34,824 WARN L293 SmtUtils]: Spent 9.00s 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 05:02:43,865 WARN L293 SmtUtils]: Spent 9.04s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:02:52,871 WARN L293 SmtUtils]: Spent 9.01s 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 05:03:05,901 WARN L293 SmtUtils]: Spent 8.95s 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 05:03:14,874 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:03:23,854 WARN L293 SmtUtils]: Spent 8.98s 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 05:03:28,128 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse3 ((_ sign_extend 24) c_~var_1_27~0))) (and (bvsge .cse0 (_ bv4294967233 32)) (= (bvadd c_~var_1_8~0 (_ bv10 8)) (_ bv0 8)) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (fp.leq c_~var_1_4~0 .cse1) (not (bvsge .cse0 (bvadd .cse3 (bvneg ((_ zero_extend 24) c_~var_1_23~0))))) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse3 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))))) (bvsle .cse3 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from false [2023-12-24 05:03:32,387 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse3 ((_ sign_extend 24) c_~var_1_27~0))) (and (bvsge .cse0 (_ bv4294967233 32)) (= (bvadd c_~var_1_8~0 (_ bv10 8)) (_ bv0 8)) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (fp.leq c_~var_1_4~0 .cse1) (not (bvsge .cse0 (bvadd .cse3 (bvneg ((_ zero_extend 24) c_~var_1_23~0))))) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse3 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))))) (bvsle .cse3 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from true [2023-12-24 05:03:41,364 WARN L293 SmtUtils]: Spent 8.97s 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 05:03:50,308 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:03:59,259 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:04:08,260 WARN L293 SmtUtils]: Spent 9.00s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:04:16,813 WARN L293 SmtUtils]: Spent 8.55s 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 05:04:25,756 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:04:34,712 WARN L293 SmtUtils]: Spent 8.96s 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 05:04:43,743 WARN L293 SmtUtils]: Spent 9.03s 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 05:04:52,838 WARN L293 SmtUtils]: Spent 9.10s 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 05:05:01,826 WARN L293 SmtUtils]: Spent 8.99s 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 05:05:10,834 WARN L293 SmtUtils]: Spent 9.01s 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 05:05:19,807 WARN L293 SmtUtils]: Spent 8.97s 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 05:05:28,826 WARN L293 SmtUtils]: Spent 9.02s 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 05:05:37,806 WARN L293 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:05:46,800 WARN L293 SmtUtils]: Spent 8.99s 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 05:05:55,776 WARN L293 SmtUtils]: Spent 8.97s 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 05:06:04,785 WARN L293 SmtUtils]: Spent 9.01s 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 05:06:13,783 WARN L293 SmtUtils]: Spent 9.00s 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 05:06:22,792 WARN L293 SmtUtils]: Spent 9.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:06:31,816 WARN L293 SmtUtils]: Spent 9.02s 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 05:06:36,122 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse3 ((_ sign_extend 24) c_~var_1_27~0))) (and (= c_~var_1_29~0 c_~var_1_20~0) (bvsge .cse0 (_ bv4294967233 32)) (= (bvadd c_~var_1_8~0 (_ bv10 8)) (_ bv0 8)) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (fp.leq c_~var_1_4~0 .cse1) (not (bvsge .cse0 (bvadd .cse3 (bvneg ((_ zero_extend 24) c_~var_1_23~0))))) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse3 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))))) (not (bvsle ((_ zero_extend 24) c_~var_1_24~0) .cse3)) (bvsle .cse3 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from false [2023-12-24 05:06:40,416 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse3 ((_ sign_extend 24) c_~var_1_27~0))) (and (= c_~var_1_29~0 c_~var_1_20~0) (bvsge .cse0 (_ bv4294967233 32)) (= (bvadd c_~var_1_8~0 (_ bv10 8)) (_ bv0 8)) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (fp.leq c_~var_1_4~0 .cse1) (not (bvsge .cse0 (bvadd .cse3 (bvneg ((_ zero_extend 24) c_~var_1_23~0))))) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse3 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))))) (not (bvsle ((_ zero_extend 24) c_~var_1_24~0) .cse3)) (bvsle .cse3 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from true [2023-12-24 05:06:49,475 WARN L293 SmtUtils]: Spent 9.05s 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) Received shutdown request... [2023-12-24 05:06:52,635 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 05:06:52,649 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 05:06:53,687 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 (5)] Forceful destruction successful, exit code 0 [2023-12-24 05:06:53,837 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 05:06:53,933 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 05:06:53,933 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 224 with TraceHistMax 36,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-24 05:06:53,936 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 [2023-12-24 05:06:53,939 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-24 05:06:53,943 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 05:06:53,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 05:06:53 BoogieIcfgContainer [2023-12-24 05:06:53,955 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 05:06:53,955 INFO L158 Benchmark]: Toolchain (without parser) took 888213.68ms. Allocated memory is still 286.3MB. Free memory was 232.5MB in the beginning and 154.4MB in the end (delta: 78.1MB). Peak memory consumption was 79.0MB. Max. memory is 8.0GB. [2023-12-24 05:06:53,955 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 205.5MB. Free memory is still 154.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 05:06:53,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.43ms. Allocated memory is still 286.3MB. Free memory was 232.5MB in the beginning and 214.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 05:06:53,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.92ms. Allocated memory is still 286.3MB. Free memory was 214.6MB in the beginning and 211.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 05:06:53,956 INFO L158 Benchmark]: Boogie Preprocessor took 42.48ms. Allocated memory is still 286.3MB. Free memory was 211.5MB in the beginning and 206.6MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 05:06:53,956 INFO L158 Benchmark]: RCFGBuilder took 16029.40ms. Allocated memory is still 286.3MB. Free memory was 206.6MB in the beginning and 229.3MB in the end (delta: -22.7MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. [2023-12-24 05:06:53,957 INFO L158 Benchmark]: TraceAbstraction took 871802.05ms. Allocated memory is still 286.3MB. Free memory was 228.3MB in the beginning and 154.4MB in the end (delta: 73.9MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. [2023-12-24 05:06:53,958 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44ms. Allocated memory is still 205.5MB. Free memory is still 154.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 297.43ms. Allocated memory is still 286.3MB. Free memory was 232.5MB in the beginning and 214.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.92ms. Allocated memory is still 286.3MB. Free memory was 214.6MB in the beginning and 211.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.48ms. Allocated memory is still 286.3MB. Free memory was 211.5MB in the beginning and 206.6MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 16029.40ms. Allocated memory is still 286.3MB. Free memory was 206.6MB in the beginning and 229.3MB in the end (delta: -22.7MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. * TraceAbstraction took 871802.05ms. Allocated memory is still 286.3MB. Free memory was 228.3MB in the beginning and 154.4MB in the end (delta: 73.9MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 224 with TraceHistMax 36,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 871.7s, OverallIterations: 4, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 31.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 684 SdHoareTripleChecker+Invalid, 30.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 266 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 418 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 664 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=3, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 667 NumberOfCodeBlocks, 667 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 664 ConstructedInterpolants, 0 QuantifiedInterpolants, 709 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1086 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 7560/7560 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown