/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_fillercode_fillercodesize_ps-cn-10_file-29.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 01:08:10,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 01:08:10,916 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 01:08:10,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 01:08:10,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 01:08:10,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 01:08:10,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 01:08:10,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 01:08:10,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 01:08:10,942 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 01:08:10,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 01:08:10,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 01:08:10,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 01:08:10,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 01:08:10,944 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 01:08:10,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 01:08:10,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 01:08:10,945 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 01:08:10,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 01:08:10,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 01:08:10,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 01:08:10,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 01:08:10,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 01:08:10,953 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 01:08:10,956 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 01:08:10,957 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 01:08:10,957 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 01:08:10,958 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 01:08:10,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 01:08:10,958 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 01:08:10,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 01:08:10,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 01:08:10,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 01:08:10,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 01:08:10,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 01:08:10,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 01:08:10,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 01:08:10,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 01:08:10,960 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 01:08:10,960 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 01:08:10,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 01:08:10,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 01:08:10,961 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 01:08:10,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 01:08:10,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 01:08:10,961 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 01:08:10,961 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 01:08:11,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 01:08:11,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 01:08:11,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 01:08:11,195 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 01:08:11,195 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 01:08:11,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2023-12-23 01:08:12,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 01:08:12,369 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 01:08:12,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2023-12-23 01:08:12,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9f83f12/1356988679104b8fa73f2664c9339046/FLAG9bd4c466c [2023-12-23 01:08:12,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9f83f12/1356988679104b8fa73f2664c9339046 [2023-12-23 01:08:12,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 01:08:12,407 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 01:08:12,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 01:08:12,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 01:08:12,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 01:08:12,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:08:12" (1/1) ... [2023-12-23 01:08:12,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75030dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:08:12, skipping insertion in model container [2023-12-23 01:08:12,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:08:12" (1/1) ... [2023-12-23 01:08:12,449 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 01:08:12,553 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_fillercode_fillercodesize_ps-cn-10_file-29.i[915,928] [2023-12-23 01:08:12,599 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 01:08:12,614 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 01:08:12,623 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_fillercode_fillercodesize_ps-cn-10_file-29.i[915,928] [2023-12-23 01:08:12,643 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 01:08:12,660 INFO L206 MainTranslator]: Completed translation [2023-12-23 01:08:12,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:08:12 WrapperNode [2023-12-23 01:08:12,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 01:08:12,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 01:08:12,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 01:08:12,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 01:08:12,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:08:12" (1/1) ... [2023-12-23 01:08:12,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:08:12" (1/1) ... [2023-12-23 01:08:12,717 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2023-12-23 01:08:12,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 01:08:12,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 01:08:12,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 01:08:12,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 01:08:12,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:08:12" (1/1) ... [2023-12-23 01:08:12,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:08:12" (1/1) ... [2023-12-23 01:08:12,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:08:12" (1/1) ... [2023-12-23 01:08:12,739 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 01:08:12,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:08:12" (1/1) ... [2023-12-23 01:08:12,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:08:12" (1/1) ... [2023-12-23 01:08:12,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:08:12" (1/1) ... [2023-12-23 01:08:12,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:08:12" (1/1) ... [2023-12-23 01:08:12,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:08:12" (1/1) ... [2023-12-23 01:08:12,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:08:12" (1/1) ... [2023-12-23 01:08:12,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 01:08:12,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 01:08:12,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 01:08:12,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 01:08:12,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:08:12" (1/1) ... [2023-12-23 01:08:12,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 01:08:12,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 01:08:12,809 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 01:08:12,830 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 01:08:12,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 01:08:12,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 01:08:12,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 01:08:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 01:08:12,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 01:08:12,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 01:08:12,947 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 01:08:12,949 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 01:08:14,663 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 01:08:14,700 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 01:08:14,700 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 01:08:14,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:08:14 BoogieIcfgContainer [2023-12-23 01:08:14,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 01:08:14,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 01:08:14,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 01:08:14,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 01:08:14,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:08:12" (1/3) ... [2023-12-23 01:08:14,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43090405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:08:14, skipping insertion in model container [2023-12-23 01:08:14,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:08:12" (2/3) ... [2023-12-23 01:08:14,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43090405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:08:14, skipping insertion in model container [2023-12-23 01:08:14,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:08:14" (3/3) ... [2023-12-23 01:08:14,706 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2023-12-23 01:08:14,723 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 01:08:14,723 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 01:08:14,771 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 01:08:14,775 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;@190fdd66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 01:08:14,776 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 01:08:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-23 01:08:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-23 01:08:14,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 01:08:14,790 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:08:14,791 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 01:08:14,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 01:08:14,794 INFO L85 PathProgramCache]: Analyzing trace with hash -64128461, now seen corresponding path program 1 times [2023-12-23 01:08:14,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 01:08:14,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419726218] [2023-12-23 01:08:14,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 01:08:14,808 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 01:08:14,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 01:08:14,810 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 01:08:14,828 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 01:08:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 01:08:15,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 01:08:15,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 01:08:15,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2023-12-23 01:08:15,265 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 01:08:15,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 01:08:15,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419726218] [2023-12-23 01:08:15,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419726218] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 01:08:15,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 01:08:15,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 01:08:15,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338537913] [2023-12-23 01:08:15,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 01:08:15,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 01:08:15,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 01:08:15,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 01:08:15,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 01:08:15,305 INFO L87 Difference]: Start difference. First operand has 86 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2023-12-23 01:08:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 01:08:16,104 INFO L93 Difference]: Finished difference Result 169 states and 315 transitions. [2023-12-23 01:08:16,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 01:08:16,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 229 [2023-12-23 01:08:16,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 01:08:16,134 INFO L225 Difference]: With dead ends: 169 [2023-12-23 01:08:16,134 INFO L226 Difference]: Without dead ends: 84 [2023-12-23 01:08:16,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 228 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 01:08:16,140 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-23 01:08:16,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-23 01:08:16,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-23 01:08:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-12-23 01:08:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-23 01:08:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 134 transitions. [2023-12-23 01:08:16,174 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 134 transitions. Word has length 229 [2023-12-23 01:08:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 01:08:16,174 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 134 transitions. [2023-12-23 01:08:16,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2023-12-23 01:08:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2023-12-23 01:08:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-23 01:08:16,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 01:08:16,178 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:08:16,193 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-23 01:08:16,389 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 01:08:16,389 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 01:08:16,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 01:08:16,390 INFO L85 PathProgramCache]: Analyzing trace with hash -542001939, now seen corresponding path program 1 times [2023-12-23 01:08:16,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 01:08:16,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780508677] [2023-12-23 01:08:16,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 01:08:16,391 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 01:08:16,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 01:08:16,392 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 01:08:16,397 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 01:08:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 01:08:16,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-23 01:08:16,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 01:08:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1464 proven. 45 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2023-12-23 01:08:17,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 01:08:17,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 01:08:17,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780508677] [2023-12-23 01:08:17,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780508677] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 01:08:17,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1201822621] [2023-12-23 01:08:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 01:08:17,173 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 01:08:17,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 01:08:17,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-23 01:08:17,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-12-23 01:08:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 01:08:17,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 01:08:17,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 01:08:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2023-12-23 01:08:18,210 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 01:08:18,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1201822621] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 01:08:18,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-23 01:08:18,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-12-23 01:08:18,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189074201] [2023-12-23 01:08:18,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 01:08:18,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 01:08:18,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 01:08:18,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 01:08:18,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-23 01:08:18,213 INFO L87 Difference]: Start difference. First operand 84 states and 134 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2023-12-23 01:08:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 01:08:18,946 INFO L93 Difference]: Finished difference Result 250 states and 400 transitions. [2023-12-23 01:08:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 01:08:18,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 229 [2023-12-23 01:08:18,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 01:08:18,952 INFO L225 Difference]: With dead ends: 250 [2023-12-23 01:08:18,952 INFO L226 Difference]: Without dead ends: 167 [2023-12-23 01:08:18,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-23 01:08:18,953 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 22 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-23 01:08:18,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 258 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-23 01:08:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-23 01:08:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2023-12-23 01:08:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2023-12-23 01:08:18,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 265 transitions. [2023-12-23 01:08:18,983 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 265 transitions. Word has length 229 [2023-12-23 01:08:18,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 01:08:18,984 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 265 transitions. [2023-12-23 01:08:18,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2023-12-23 01:08:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 265 transitions. [2023-12-23 01:08:18,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-23 01:08:18,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 01:08:18,986 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:08:18,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2023-12-23 01:08:19,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-23 01:08:19,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 01:08:19,390 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 01:08:19,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 01:08:19,390 INFO L85 PathProgramCache]: Analyzing trace with hash -540154897, now seen corresponding path program 1 times [2023-12-23 01:08:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 01:08:19,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823568868] [2023-12-23 01:08:19,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 01:08:19,391 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 01:08:19,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 01:08:19,392 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 01:08:19,394 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 01:08:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 01:08:19,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-23 01:08:19,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 01:08:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1464 proven. 45 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2023-12-23 01:08:19,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 01:08:19,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 01:08:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823568868] [2023-12-23 01:08:19,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823568868] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 01:08:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [432340490] [2023-12-23 01:08:19,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 01:08:19,980 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 01:08:19,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 01:08:19,981 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-23 01:08:19,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-23 01:08:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 01:08:20,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 01:08:20,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 01:08:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2023-12-23 01:08:20,912 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 01:08:20,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [432340490] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 01:08:20,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-23 01:08:20,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-23 01:08:20,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943929401] [2023-12-23 01:08:20,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 01:08:20,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 01:08:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 01:08:20,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 01:08:20,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-23 01:08:20,914 INFO L87 Difference]: Start difference. First operand 165 states and 265 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2023-12-23 01:08:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 01:08:22,732 INFO L93 Difference]: Finished difference Result 491 states and 789 transitions. [2023-12-23 01:08:22,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 01:08:22,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 229 [2023-12-23 01:08:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 01:08:22,736 INFO L225 Difference]: With dead ends: 491 [2023-12-23 01:08:22,736 INFO L226 Difference]: Without dead ends: 327 [2023-12-23 01:08:22,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-23 01:08:22,739 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 126 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-23 01:08:22,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 367 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-23 01:08:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-12-23 01:08:22,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2023-12-23 01:08:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 164 states have (on average 1.2682926829268293) internal successors, (208), 164 states have internal predecessors, (208), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2023-12-23 01:08:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 520 transitions. [2023-12-23 01:08:22,789 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 520 transitions. Word has length 229 [2023-12-23 01:08:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 01:08:22,789 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 520 transitions. [2023-12-23 01:08:22,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2023-12-23 01:08:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 520 transitions. [2023-12-23 01:08:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-23 01:08:22,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 01:08:22,792 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:08:22,814 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 01:08:23,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-23 01:08:23,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-23 01:08:23,209 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 01:08:23,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 01:08:23,209 INFO L85 PathProgramCache]: Analyzing trace with hash -482896595, now seen corresponding path program 1 times [2023-12-23 01:08:23,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 01:08:23,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209620547] [2023-12-23 01:08:23,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 01:08:23,210 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 01:08:23,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 01:08:23,211 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 01:08:23,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-23 01:08:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 01:08:23,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-23 01:08:23,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 01:08:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1464 proven. 45 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2023-12-23 01:08:23,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 01:08:23,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 01:08:23,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209620547] [2023-12-23 01:08:23,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209620547] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 01:08:23,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [248857311] [2023-12-23 01:08:23,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 01:08:23,746 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 01:08:23,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 01:08:23,757 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-23 01:08:23,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-23 01:08:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 01:08:24,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-23 01:08:24,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 01:08:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1338 proven. 36 refuted. 0 times theorem prover too weak. 1590 trivial. 0 not checked. [2023-12-23 01:08:26,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 01:08:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 78 proven. 36 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2023-12-23 01:08:27,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [248857311] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 01:08:27,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-23 01:08:27,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2023-12-23 01:08:27,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355322406] [2023-12-23 01:08:27,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-23 01:08:27,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-23 01:08:27,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 01:08:27,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-23 01:08:27,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-23 01:08:27,172 INFO L87 Difference]: Start difference. First operand 325 states and 520 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2023-12-23 01:08:35,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:08:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 01:08:40,714 INFO L93 Difference]: Finished difference Result 879 states and 1360 transitions. [2023-12-23 01:08:40,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-23 01:08:40,722 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) Word has length 229 [2023-12-23 01:08:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 01:08:40,726 INFO L225 Difference]: With dead ends: 879 [2023-12-23 01:08:40,726 INFO L226 Difference]: Without dead ends: 555 [2023-12-23 01:08:40,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 690 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=417, Invalid=1143, Unknown=0, NotChecked=0, Total=1560 [2023-12-23 01:08:40,734 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 323 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2023-12-23 01:08:40,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 322 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2023-12-23 01:08:40,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2023-12-23 01:08:40,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 361. [2023-12-23 01:08:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 192 states have (on average 1.21875) internal successors, (234), 192 states have internal predecessors, (234), 156 states have call successors, (156), 12 states have call predecessors, (156), 12 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2023-12-23 01:08:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 546 transitions. [2023-12-23 01:08:40,832 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 546 transitions. Word has length 229 [2023-12-23 01:08:40,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 01:08:40,833 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 546 transitions. [2023-12-23 01:08:40,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2023-12-23 01:08:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 546 transitions. [2023-12-23 01:08:40,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-23 01:08:40,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 01:08:40,835 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:08:40,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-23 01:08:41,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2023-12-23 01:08:41,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-23 01:08:41,236 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 01:08:41,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 01:08:41,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1264278974, now seen corresponding path program 1 times [2023-12-23 01:08:41,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 01:08:41,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684883499] [2023-12-23 01:08:41,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 01:08:41,237 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 01:08:41,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 01:08:41,238 INFO L229 MonitoredProcess]: Starting monitored process 9 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 01:08:41,240 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 (9)] Waiting until timeout for monitored process [2023-12-23 01:08:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 01:08:41,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-23 01:08:41,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 01:09:02,159 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2023-12-23 01:09:10,843 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true [2023-12-23 01:09:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1420 proven. 99 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2023-12-23 01:09:16,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 01:10:31,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 01:10:31,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684883499] [2023-12-23 01:10:31,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684883499] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 01:10:31,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1726884127] [2023-12-23 01:10:31,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 01:10:31,318 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 01:10:31,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 01:10:31,319 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-23 01:10:31,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-23 01:10:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 01:10:32,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-23 01:10:32,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 01:10:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1420 proven. 99 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2023-12-23 01:10:57,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 01:11:22,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1726884127] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 01:11:22,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 01:11:22,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2023-12-23 01:11:22,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176603914] [2023-12-23 01:11:22,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 01:11:22,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-23 01:11:22,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 01:11:22,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-23 01:11:22,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=152, Unknown=10, NotChecked=54, Total=272 [2023-12-23 01:11:22,851 INFO L87 Difference]: Start difference. First operand 361 states and 546 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 4 states have call successors, (39), 4 states have call predecessors, (39), 5 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2023-12-23 01:12:41,642 WARN L293 SmtUtils]: Spent 22.88s on a formula simplification. DAG size of input: 110 DAG size of output: 235 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 01:12:46,111 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse2)) (.cse1 (fp.neg .cse3))) (and (or (and (fp.leq c_~var_1_25~0 .cse0) (fp.geq c_~var_1_25~0 .cse1)) (and (fp.geq c_~var_1_25~0 .cse2) (fp.leq c_~var_1_25~0 .cse3))) (or (and (fp.geq c_~var_1_26~0 .cse2) (fp.leq c_~var_1_26~0 .cse3)) (and (fp.leq c_~var_1_26~0 .cse0) (fp.geq c_~var_1_26~0 .cse1))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse7 (fp.neg .cse4)) (.cse6 (fp.neg .cse5))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse6) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (fp.geq ~var_1_24~0 .cse4) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse5))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse4) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse5))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse6) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (fp.geq ~var_1_26~0 .cse4) (fp.geq ~var_1_24~0 .cse4) (fp.leq ~var_1_24~0 .cse5) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse4) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse6) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse7) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse4) (fp.leq ~var_1_24~0 .cse5))) (fp.leq ~var_1_25~0 .cse7))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse4) (fp.leq ~var_1_25~0 .cse5) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse5) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse7) (fp.geq ~var_1_24~0 .cse6)))))))) (or (and (fp.leq c_~var_1_24~0 .cse3) (fp.geq c_~var_1_24~0 .cse2)) (and (fp.leq c_~var_1_24~0 .cse0) (fp.geq c_~var_1_24~0 .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-12-23 01:12:51,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 01:12:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 01:12:52,099 INFO L93 Difference]: Finished difference Result 1123 states and 1672 transitions. [2023-12-23 01:12:52,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-23 01:12:52,106 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 4 states have call successors, (39), 4 states have call predecessors, (39), 5 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 230 [2023-12-23 01:12:52,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 01:12:52,110 INFO L225 Difference]: With dead ends: 1123 [2023-12-23 01:12:52,110 INFO L226 Difference]: Without dead ends: 763 [2023-12-23 01:12:52,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 144.2s TimeCoverageRelationStatistics Valid=130, Invalid=321, Unknown=23, NotChecked=126, Total=600 [2023-12-23 01:12:52,112 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 111 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 567 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-12-23 01:12:52,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 522 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 399 Invalid, 0 Unknown, 567 Unchecked, 5.6s Time] [2023-12-23 01:12:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2023-12-23 01:12:52,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 751. [2023-12-23 01:12:52,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 406 states have (on average 1.206896551724138) internal successors, (490), 406 states have internal predecessors, (490), 312 states have call successors, (312), 32 states have call predecessors, (312), 32 states have return successors, (312), 312 states have call predecessors, (312), 312 states have call successors, (312) [2023-12-23 01:12:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1114 transitions. [2023-12-23 01:12:52,180 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1114 transitions. Word has length 230 [2023-12-23 01:12:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 01:12:52,181 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1114 transitions. [2023-12-23 01:12:52,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 4 states have call successors, (39), 4 states have call predecessors, (39), 5 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2023-12-23 01:12:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1114 transitions. [2023-12-23 01:12:52,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-23 01:12:52,183 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 01:12:52,183 INFO L195 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:12:52,196 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 (9)] Forceful destruction successful, exit code 0 [2023-12-23 01:12:52,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2023-12-23 01:12:52,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-23 01:12:52,597 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 01:12:52,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 01:12:52,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2073625600, now seen corresponding path program 1 times [2023-12-23 01:12:52,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 01:12:52,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346173048] [2023-12-23 01:12:52,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 01:12:52,598 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 01:12:52,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 01:12:52,599 INFO L229 MonitoredProcess]: Starting monitored process 11 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 01:12:52,602 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 (11)] Waiting until timeout for monitored process [2023-12-23 01:12:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 01:12:52,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-23 01:12:52,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 01:13:16,566 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2023-12-23 01:14:11,552 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification. DAG size of input: 74 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 01:14:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1420 proven. 99 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2023-12-23 01:14:17,343 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 01:15:47,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 01:15:47,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346173048] [2023-12-23 01:15:47,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346173048] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 01:15:47,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1521910445] [2023-12-23 01:15:47,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 01:15:47,418 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 01:15:47,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 01:15:47,419 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-23 01:15:47,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-23 01:15:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 01:15:48,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-23 01:15:48,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 01:16:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1420 proven. 99 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2023-12-23 01:16:19,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 01:16:48,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1521910445] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 01:16:48,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 01:16:48,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2023-12-23 01:16:48,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749681072] [2023-12-23 01:16:48,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 01:16:48,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-23 01:16:48,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 01:16:48,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-23 01:16:48,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=170, Unknown=18, NotChecked=28, Total=272 [2023-12-23 01:16:48,159 INFO L87 Difference]: Start difference. First operand 751 states and 1114 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 4 states have call successors, (39), 4 states have call predecessors, (39), 5 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2023-12-23 01:17:28,202 WARN L293 SmtUtils]: Spent 25.52s on a formula simplification. DAG size of input: 102 DAG size of output: 212 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 01:17:32,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:17:33,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:17:38,132 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 [0] [2023-12-23 01:17:42,781 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 [0] [2023-12-23 01:17:59,050 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 [0] [2023-12-23 01:18:08,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:18:09,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:18:13,881 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 [0] [2023-12-23 01:18:18,116 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 [0] [2023-12-23 01:18:32,748 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 [0] [2023-12-23 01:18:37,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:18:41,182 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 [0] [2023-12-23 01:18:44,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:18:47,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:18:51,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:18:55,476 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 [0] [2023-12-23 01:18:59,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:19:02,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:19:06,102 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 [0] [2023-12-23 01:19:10,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:19:13,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:19:17,607 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 [0] [2023-12-23 01:19:21,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:19:24,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:19:28,771 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 [0] [2023-12-23 01:19:31,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:19:34,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:19:38,888 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 [0] [2023-12-23 01:19:42,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:19:46,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:19:50,235 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 [0] [2023-12-23 01:19:54,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:19:58,291 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 [0] [2023-12-23 01:20:02,340 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 [0] [2023-12-23 01:20:06,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:20:10,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:20:13,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:20:16,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:20:20,316 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 [0] [2023-12-23 01:20:24,361 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 [0] [2023-12-23 01:20:28,409 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 [0] [2023-12-23 01:20:32,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:20:36,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:20:40,358 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 [0] [2023-12-23 01:20:44,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:20:48,399 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 [0] [2023-12-23 01:20:57,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:21:01,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:21:11,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:21:15,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:21:19,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:21:23,255 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 [0] [2023-12-23 01:21:36,030 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 [0] [2023-12-23 01:21:40,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:21:44,086 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 [0] [2023-12-23 01:21:48,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:21:52,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:21:55,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:21:59,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:22:03,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:22:06,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:22:10,695 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 [0] [2023-12-23 01:22:14,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:22:18,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:22:22,691 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 [0] [2023-12-23 01:22:27,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:22:31,064 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 [0] [2023-12-23 01:22:35,121 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 [0] [2023-12-23 01:22:39,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 01:22:43,175 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 [0] [2023-12-23 01:22:47,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 [0] Received shutdown request... [2023-12-23 01:22:50,637 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 01:22:50,667 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 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 01:22:50,668 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 01:22:51,246 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 [0] [2023-12-23 01:22:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-23 01:22:51,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 210.5s TimeCoverageRelationStatistics Valid=129, Invalid=350, Unknown=31, NotChecked=42, Total=552 [2023-12-23 01:22:51,251 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 72 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 112 mSolverCounterUnsat, 48 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 273.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 48 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 273.4s IncrementalHoareTripleChecker+Time [2023-12-23 01:22:51,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 188 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 387 Invalid, 48 Unknown, 115 Unchecked, 273.4s Time] [2023-12-23 01:22:51,252 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 01:22:51,263 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 (11)] Forceful destruction successful, exit code 0 [2023-12-23 01:22:51,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2023-12-23 01:22:51,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-23 01:22:51,654 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (751states) and FLOYD_HOARE automaton (currently 16 states, 14 states before enhancement),while ReachableStatesComputation was computing reachable states (84 states constructed, input type IntersectNwa). [2023-12-23 01:22:51,659 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-23 01:22:51,662 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 01:22:51,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:22:51 BoogieIcfgContainer [2023-12-23 01:22:51,664 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 01:22:51,664 INFO L158 Benchmark]: Toolchain (without parser) took 879257.33ms. Allocated memory was 182.5MB in the beginning and 288.4MB in the end (delta: 105.9MB). Free memory was 133.4MB in the beginning and 237.0MB in the end (delta: -103.6MB). Peak memory consumption was 152.9MB. Max. memory is 8.0GB. [2023-12-23 01:22:51,665 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 182.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 01:22:51,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.47ms. Allocated memory is still 182.5MB. Free memory was 133.2MB in the beginning and 117.7MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-23 01:22:51,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.51ms. Allocated memory is still 182.5MB. Free memory was 117.7MB in the beginning and 115.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 01:22:51,665 INFO L158 Benchmark]: Boogie Preprocessor took 44.31ms. Allocated memory is still 182.5MB. Free memory was 115.0MB in the beginning and 111.7MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-23 01:22:51,665 INFO L158 Benchmark]: RCFGBuilder took 1937.24ms. Allocated memory is still 182.5MB. Free memory was 111.7MB in the beginning and 142.2MB in the end (delta: -30.5MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. [2023-12-23 01:22:51,665 INFO L158 Benchmark]: TraceAbstraction took 876962.38ms. Allocated memory was 182.5MB in the beginning and 288.4MB in the end (delta: 105.9MB). Free memory was 141.7MB in the beginning and 237.0MB in the end (delta: -95.4MB). Peak memory consumption was 160.8MB. Max. memory is 8.0GB. [2023-12-23 01:22:51,671 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 182.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.47ms. Allocated memory is still 182.5MB. Free memory was 133.2MB in the beginning and 117.7MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.51ms. Allocated memory is still 182.5MB. Free memory was 117.7MB in the beginning and 115.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.31ms. Allocated memory is still 182.5MB. Free memory was 115.0MB in the beginning and 111.7MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1937.24ms. Allocated memory is still 182.5MB. Free memory was 111.7MB in the beginning and 142.2MB in the end (delta: -30.5MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. * TraceAbstraction took 876962.38ms. Allocated memory was 182.5MB in the beginning and 288.4MB in the end (delta: 105.9MB). Free memory was 141.7MB in the beginning and 237.0MB in the end (delta: -95.4MB). Peak memory consumption was 160.8MB. 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 constructing difference of abstraction (751states) and FLOYD_HOARE automaton (currently 16 states, 14 states before enhancement),while ReachableStatesComputation was computing reachable states (84 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 876.9s, OverallIterations: 6, TraceHistogramMax: 39, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 469.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 48 mSolverCounterUnknown, 704 SdHoareTripleChecker+Valid, 293.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 654 mSDsluCounter, 1788 SdHoareTripleChecker+Invalid, 291.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 682 IncrementalHoareTripleChecker+Unchecked, 1042 mSDsCounter, 617 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1195 IncrementalHoareTripleChecker+Invalid, 2542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 617 mSolverCounterUnsat, 746 mSDtfsCounter, 1195 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3125 GetRequests, 3032 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 357.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=751occurred in iteration=5, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 210 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 399.1s InterpolantComputationTime, 2523 NumberOfCodeBlocks, 2523 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2740 ConstructedInterpolants, 81 QuantifiedInterpolants, 33659 SizeOfPredicates, 52 NumberOfNonLiveVariables, 4006 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 34965/35568 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