/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 21:04:17,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 21:04:17,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-23 21:04:17,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 21:04:17,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 21:04:17,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 21:04:17,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 21:04:17,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 21:04:17,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 21:04:17,557 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 21:04:17,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 21:04:17,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 21:04:17,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 21:04:17,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 21:04:17,558 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 21:04:17,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 21:04:17,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 21:04:17,559 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 21:04:17,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 21:04:17,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 21:04:17,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 21:04:17,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 21:04:17,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 21:04:17,560 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 21:04:17,560 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 21:04:17,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 21:04:17,560 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 21:04:17,561 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 21:04:17,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 21:04:17,561 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 21:04:17,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 21:04:17,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 21:04:17,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 21:04:17,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 21:04:17,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 21:04:17,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 21:04:17,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 21:04:17,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 21:04:17,562 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 21:04:17,562 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 21:04:17,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 21:04:17,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 21:04:17,563 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 21:04:17,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 21:04:17,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 21:04:17,564 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 21:04:17,564 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-23 21:04:17,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 21:04:17,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 21:04:17,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 21:04:17,761 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 21:04:17,763 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 21:04:17,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i [2023-12-23 21:04:18,743 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 21:04:18,931 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 21:04:18,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i [2023-12-23 21:04:18,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfd701b8/4e4ad31c5a46482dbc9181839783f217/FLAGb07d76f98 [2023-12-23 21:04:18,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfd701b8/4e4ad31c5a46482dbc9181839783f217 [2023-12-23 21:04:18,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 21:04:18,955 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 21:04:18,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 21:04:18,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 21:04:18,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 21:04:18,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:04:18" (1/1) ... [2023-12-23 21:04:18,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25fec6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:04:18, skipping insertion in model container [2023-12-23 21:04:18,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:04:18" (1/1) ... [2023-12-23 21:04:18,991 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 21:04:19,084 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i[915,928] [2023-12-23 21:04:19,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 21:04:19,166 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 21:04:19,174 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-2.i[915,928] [2023-12-23 21:04:19,205 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 21:04:19,217 INFO L206 MainTranslator]: Completed translation [2023-12-23 21:04:19,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:04:19 WrapperNode [2023-12-23 21:04:19,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 21:04:19,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 21:04:19,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 21:04:19,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 21:04:19,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:04:19" (1/1) ... [2023-12-23 21:04:19,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:04:19" (1/1) ... [2023-12-23 21:04:19,274 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2023-12-23 21:04:19,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 21:04:19,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 21:04:19,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 21:04:19,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 21:04:19,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:04:19" (1/1) ... [2023-12-23 21:04:19,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:04:19" (1/1) ... [2023-12-23 21:04:19,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:04:19" (1/1) ... [2023-12-23 21:04:19,310 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-23 21:04:19,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:04:19" (1/1) ... [2023-12-23 21:04:19,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:04:19" (1/1) ... [2023-12-23 21:04:19,318 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:04:19" (1/1) ... [2023-12-23 21:04:19,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:04:19" (1/1) ... [2023-12-23 21:04:19,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:04:19" (1/1) ... [2023-12-23 21:04:19,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:04:19" (1/1) ... [2023-12-23 21:04:19,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 21:04:19,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 21:04:19,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 21:04:19,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 21:04:19,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:04:19" (1/1) ... [2023-12-23 21:04:19,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 21:04:19,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 21:04:19,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-23 21:04:19,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-23 21:04:19,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 21:04:19,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 21:04:19,397 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 21:04:19,398 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 21:04:19,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 21:04:19,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 21:04:19,462 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 21:04:19,464 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 21:04:35,042 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 21:04:35,127 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 21:04:35,127 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 21:04:35,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:04:35 BoogieIcfgContainer [2023-12-23 21:04:35,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 21:04:35,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 21:04:35,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 21:04:35,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 21:04:35,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:04:18" (1/3) ... [2023-12-23 21:04:35,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62910e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:04:35, skipping insertion in model container [2023-12-23 21:04:35,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:04:19" (2/3) ... [2023-12-23 21:04:35,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62910e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:04:35, skipping insertion in model container [2023-12-23 21:04:35,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:04:35" (3/3) ... [2023-12-23 21:04:35,136 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-2.i [2023-12-23 21:04:35,149 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 21:04:35,150 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 21:04:35,192 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 21:04:35,198 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;@9b865c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 21:04:35,198 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 21:04:35,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 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-23 21:04:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-12-23 21:04:35,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 21:04:35,225 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] [2023-12-23 21:04:35,226 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 21:04:35,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 21:04:35,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1876120938, now seen corresponding path program 1 times [2023-12-23 21:04:35,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 21:04:35,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500573606] [2023-12-23 21:04:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:04:35,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 21:04:35,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 21:04:35,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 21:04:35,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-23 21:04:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:04:36,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 21:04:36,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:04:36,481 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-23 21:04:36,481 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 21:04:36,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 21:04:36,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500573606] [2023-12-23 21:04:36,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500573606] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 21:04:36,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 21:04:36,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 21:04:36,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041312615] [2023-12-23 21:04:36,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 21:04:36,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 21:04:36,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 21:04:36,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 21:04:36,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 21:04:36,515 INFO L87 Difference]: Start difference. First operand has 92 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 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.0) internal successors, (48), 2 states have internal predecessors, (48), 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-23 21:04:41,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.79s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:04:41,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 21:04:41,687 INFO L93 Difference]: Finished difference Result 183 states and 329 transitions. [2023-12-23 21:04:41,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 21:04:41,697 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 221 [2023-12-23 21:04:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 21:04:41,705 INFO L225 Difference]: With dead ends: 183 [2023-12-23 21:04:41,705 INFO L226 Difference]: Without dead ends: 90 [2023-12-23 21:04:41,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 21:04:41,713 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-23 21:04:41,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2023-12-23 21:04:41,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-23 21:04:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-12-23 21:04:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 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-23 21:04:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 142 transitions. [2023-12-23 21:04:41,764 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 142 transitions. Word has length 221 [2023-12-23 21:04:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 21:04:41,765 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 142 transitions. [2023-12-23 21:04:41,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-23 21:04:41,765 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 142 transitions. [2023-12-23 21:04:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-12-23 21:04:41,773 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 21:04:41,774 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] [2023-12-23 21:04:41,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-23 21:04:41,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 21:04:41,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 21:04:41,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 21:04:41,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1658745254, now seen corresponding path program 1 times [2023-12-23 21:04:41,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 21:04:41,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859945751] [2023-12-23 21:04:41,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:04:41,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 21:04:41,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 21:04:41,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 21:04:41,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-23 21:04:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:04:43,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 21:04:43,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:04:43,325 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-23 21:04:43,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 21:04:43,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 21:04:43,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859945751] [2023-12-23 21:04:43,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859945751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 21:04:43,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 21:04:43,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 21:04:43,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523484240] [2023-12-23 21:04:43,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 21:04:43,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 21:04:43,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 21:04:43,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 21:04:43,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 21:04:43,332 INFO L87 Difference]: Start difference. First operand 90 states and 142 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-23 21:04:48,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:04:52,225 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-23 21:04:56,227 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 [] [2023-12-23 21:04:56,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 21:04:56,553 INFO L93 Difference]: Finished difference Result 197 states and 309 transitions. [2023-12-23 21:04:56,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 21:04:56,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 221 [2023-12-23 21:04:56,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 21:04:56,557 INFO L225 Difference]: With dead ends: 197 [2023-12-23 21:04:56,557 INFO L226 Difference]: Without dead ends: 108 [2023-12-23 21:04:56,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 21:04:56,558 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 18 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2023-12-23 21:04:56,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 269 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 3 Unknown, 0 Unchecked, 13.2s Time] [2023-12-23 21:04:56,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-23 21:04:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2023-12-23 21:04:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 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-23 21:04:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2023-12-23 21:04:56,568 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 221 [2023-12-23 21:04:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 21:04:56,569 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2023-12-23 21:04:56,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-23 21:04:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2023-12-23 21:04:56,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2023-12-23 21:04:56,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 21:04:56,571 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-23 21:04:56,599 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-23 21:04:56,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 21:04:56,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 21:04:56,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 21:04:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash 879411542, now seen corresponding path program 1 times [2023-12-23 21:04:56,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 21:04:56,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074877132] [2023-12-23 21:04:56,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:04:56,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 21:04:56,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 21:04:56,786 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 21:04:56,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-23 21:04:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:04:57,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 21:04:57,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:04:58,042 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-23 21:04:58,042 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 21:04:58,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 21:04:58,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074877132] [2023-12-23 21:04:58,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074877132] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 21:04:58,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 21:04:58,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 21:04:58,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994728861] [2023-12-23 21:04:58,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 21:04:58,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 21:04:58,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 21:04:58,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 21:04:58,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 21:04:58,045 INFO L87 Difference]: Start difference. First operand 97 states and 152 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-23 21:05:03,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:05:07,135 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-23 21:05:11,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 21:05:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 21:05:11,506 INFO L93 Difference]: Finished difference Result 232 states and 357 transitions. [2023-12-23 21:05:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 21:05:11,506 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-23 21:05:11,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 21:05:11,508 INFO L225 Difference]: With dead ends: 232 [2023-12-23 21:05:11,508 INFO L226 Difference]: Without dead ends: 136 [2023-12-23 21:05:11,509 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-23 21:05:11,510 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 38 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2023-12-23 21:05:11,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 267 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 3 Unknown, 0 Unchecked, 13.4s Time] [2023-12-23 21:05:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-23 21:05:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2023-12-23 21:05:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 88 states have internal predecessors, (117), 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-23 21:05:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 203 transitions. [2023-12-23 21:05:11,524 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 203 transitions. Word has length 222 [2023-12-23 21:05:11,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 21:05:11,525 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 203 transitions. [2023-12-23 21:05:11,525 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-23 21:05:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 203 transitions. [2023-12-23 21:05:11,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2023-12-23 21:05:11,527 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 21:05:11,527 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-23 21:05:11,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-23 21:05:11,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 21:05:11,742 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 21:05:11,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 21:05:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1640548392, now seen corresponding path program 1 times [2023-12-23 21:05:11,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 21:05:11,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665369493] [2023-12-23 21:05:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 21:05:11,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 21:05:11,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 21:05:11,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 21:05:11,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-23 21:05:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 21:05:13,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-23 21:05:13,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 21:06:45,470 WARN L293 SmtUtils]: Spent 8.80s 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-23 21:06:53,241 WARN L293 SmtUtils]: Spent 7.77s 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-23 21:07:02,102 WARN L293 SmtUtils]: Spent 8.86s 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-23 21:07:11,009 WARN L293 SmtUtils]: Spent 8.91s 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-23 21:07:19,523 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-23 21:07:28,439 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-23 21:07:37,371 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-23 21:07:46,319 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-23 21:07:55,266 WARN L293 SmtUtils]: Spent 8.95s 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-23 21:08:04,346 WARN L293 SmtUtils]: Spent 9.08s 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-23 21:08:13,306 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-23 21:08:22,264 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-23 21:08:31,192 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-23 21:08:40,129 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-23 21:08:49,074 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-23 21:08:58,022 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-23 21:09:06,948 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-23 21:09:15,874 WARN L293 SmtUtils]: Spent 8.93s 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-23 21:09:20,139 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)) (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-23 21:09:24,388 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)) (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-23 21:09:33,313 WARN L293 SmtUtils]: Spent 8.92s 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-23 21:09:42,237 WARN L293 SmtUtils]: Spent 8.92s 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-23 21:09:51,152 WARN L293 SmtUtils]: Spent 8.91s 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-23 21:10:00,066 WARN L293 SmtUtils]: Spent 8.91s 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-23 21:10:08,622 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-23 21:10:17,551 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-23 21:10:26,480 WARN L293 SmtUtils]: Spent 8.93s 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-23 21:10:35,414 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-23 21:10:44,349 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-23 21:10:53,277 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-23 21:11:02,205 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-23 21:11:11,133 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-23 21:11:20,068 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-23 21:11:29,030 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-23 21:11:38,003 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-23 21:11:46,950 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-23 21:11:55,918 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-23 21:12:04,876 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-23 21:12:13,805 WARN L293 SmtUtils]: Spent 8.93s 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-23 21:12:18,089 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) (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-23 21:12:22,342 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) (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-23 21:12:31,355 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-23 21:12:40,343 WARN L293 SmtUtils]: Spent 8.99s 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-23 21:12:49,328 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-23 21:12:58,297 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-23 21:13:06,827 WARN L293 SmtUtils]: Spent 8.53s 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-23 21:13:15,791 WARN L293 SmtUtils]: Spent 8.96s 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-23 21:13:24,763 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-23 21:13:33,740 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-23 21:13:42,705 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-23 21:13:51,682 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-23 21:14:00,627 WARN L293 SmtUtils]: Spent 8.94s 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-23 21:14:09,570 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-23 21:14:18,534 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-23 21:14:27,503 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-23 21:14:36,482 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-23 21:14:45,481 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-23 21:14:55,379 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-23 21:15:04,332 WARN L293 SmtUtils]: Spent 8.95s 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-23 21:15:08,585 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)) (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) (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-23 21:15:12,843 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)) (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) (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-23 21:15:21,788 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-23 21:15:30,721 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-23 21:15:39,682 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-23 21:15:48,661 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-23 21:15:57,167 WARN L293 SmtUtils]: Spent 8.50s 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-23 21:16:06,091 WARN L293 SmtUtils]: Spent 8.92s 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-23 21:16:15,059 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-23 21:16:23,999 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-23 21:16:32,938 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-23 21:16:41,867 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-23 21:16:50,841 WARN L293 SmtUtils]: Spent 8.97s 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-23 21:16:59,781 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-23 21:17:08,720 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-23 21:17:17,676 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-23 21:17:26,618 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-23 21:17:35,584 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-23 21:17:44,536 WARN L293 SmtUtils]: Spent 8.95s 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-23 21:17:56,206 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-23 21:18:05,157 WARN L293 SmtUtils]: Spent 8.95s 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-23 21:18:09,410 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)) (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-23 21:18:13,665 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)) (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-23 21:18:22,621 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-23 21:18:31,561 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-23 21:18:40,509 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-23 21:18:49,487 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-23 21:18:58,036 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) Received shutdown request... [2023-12-23 21:19:04,809 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-23 21:19:04,809 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-23 21:19:05,847 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-23 21:19:06,010 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-23 21:19:06,106 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 21:19:06,107 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 223 with TraceHistMax 36,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-23 21:19:06,110 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-23 21:19:06,112 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-23 21:19:06,113 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 21:19:06,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 09:19:06 BoogieIcfgContainer [2023-12-23 21:19:06,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 21:19:06,115 INFO L158 Benchmark]: Toolchain (without parser) took 887159.57ms. Allocated memory is still 275.8MB. Free memory was 232.6MB in the beginning and 155.5MB in the end (delta: 77.2MB). Peak memory consumption was 78.3MB. Max. memory is 8.0GB. [2023-12-23 21:19:06,115 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 215.0MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 21:19:06,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.78ms. Allocated memory is still 275.8MB. Free memory was 232.3MB in the beginning and 214.8MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-23 21:19:06,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.69ms. Allocated memory is still 275.8MB. Free memory was 214.8MB in the beginning and 211.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-23 21:19:06,115 INFO L158 Benchmark]: Boogie Preprocessor took 69.18ms. Allocated memory is still 275.8MB. Free memory was 211.7MB in the beginning and 206.7MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-23 21:19:06,116 INFO L158 Benchmark]: RCFGBuilder took 15779.17ms. Allocated memory is still 275.8MB. Free memory was 206.4MB in the beginning and 225.2MB in the end (delta: -18.8MB). Peak memory consumption was 24.3MB. Max. memory is 8.0GB. [2023-12-23 21:19:06,116 INFO L158 Benchmark]: TraceAbstraction took 870983.23ms. Allocated memory is still 275.8MB. Free memory was 224.7MB in the beginning and 155.5MB in the end (delta: 69.2MB). Peak memory consumption was 69.7MB. Max. memory is 8.0GB. [2023-12-23 21:19:06,117 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 215.0MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.78ms. Allocated memory is still 275.8MB. Free memory was 232.3MB in the beginning and 214.8MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.69ms. Allocated memory is still 275.8MB. Free memory was 214.8MB in the beginning and 211.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 69.18ms. Allocated memory is still 275.8MB. Free memory was 211.7MB in the beginning and 206.7MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 15779.17ms. Allocated memory is still 275.8MB. Free memory was 206.4MB in the beginning and 225.2MB in the end (delta: -18.8MB). Peak memory consumption was 24.3MB. Max. memory is 8.0GB. * TraceAbstraction took 870983.23ms. Allocated memory is still 275.8MB. Free memory was 224.7MB in the beginning and 155.5MB in the end (delta: 69.2MB). Peak memory consumption was 69.7MB. 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 223 with TraceHistMax 36,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 870.9s, OverallIterations: 4, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 31.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 675 SdHoareTripleChecker+Invalid, 30.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 262 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 413 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 661 GetRequests, 659 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred 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, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 664 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 661 ConstructedInterpolants, 0 QuantifiedInterpolants, 696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1092 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