/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-72.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 05:41:27,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 05:41:27,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 05:41:27,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 05:41:27,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 05:41:27,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 05:41:27,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 05:41:27,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 05:41:27,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 05:41:27,783 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 05:41:27,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 05:41:27,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 05:41:27,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 05:41:27,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 05:41:27,785 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 05:41:27,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 05:41:27,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 05:41:27,785 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 05:41:27,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 05:41:27,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 05:41:27,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 05:41:27,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 05:41:27,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 05:41:27,787 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 05:41:27,787 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 05:41:27,787 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 05:41:27,787 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 05:41:27,787 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 05:41:27,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 05:41:27,788 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 05:41:27,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 05:41:27,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 05:41:27,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 05:41:27,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 05:41:27,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 05:41:27,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 05:41:27,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 05:41:27,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 05:41:27,789 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 05:41:27,789 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 05:41:27,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 05:41:27,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 05:41:27,790 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 05:41:27,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 05:41:27,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 05:41:27,790 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 05:41:27,790 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 05:41:27,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 05:41:27,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 05:41:27,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 05:41:27,979 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 05:41:27,984 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 05:41:27,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-72.i [2023-12-24 05:41:29,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 05:41:29,290 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 05:41:29,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-72.i [2023-12-24 05:41:29,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc5400a6/485c61d4a88847e18975dd07e60dc065/FLAG6a853369c [2023-12-24 05:41:29,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc5400a6/485c61d4a88847e18975dd07e60dc065 [2023-12-24 05:41:29,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 05:41:29,326 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 05:41:29,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 05:41:29,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 05:41:29,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 05:41:29,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 05:41:29" (1/1) ... [2023-12-24 05:41:29,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@782cd186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:41:29, skipping insertion in model container [2023-12-24 05:41:29,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 05:41:29" (1/1) ... [2023-12-24 05:41:29,366 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 05:41:29,493 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-72.i[916,929] [2023-12-24 05:41:29,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 05:41:29,614 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 05:41:29,622 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-72.i[916,929] [2023-12-24 05:41:29,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 05:41:29,682 INFO L206 MainTranslator]: Completed translation [2023-12-24 05:41:29,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:41:29 WrapperNode [2023-12-24 05:41:29,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 05:41:29,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 05:41:29,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 05:41:29,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 05:41:29,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:41:29" (1/1) ... [2023-12-24 05:41:29,714 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:41:29" (1/1) ... [2023-12-24 05:41:29,738 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2023-12-24 05:41:29,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 05:41:29,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 05:41:29,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 05:41:29,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 05:41:29,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:41:29" (1/1) ... [2023-12-24 05:41:29,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:41:29" (1/1) ... [2023-12-24 05:41:29,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:41:29" (1/1) ... [2023-12-24 05:41:29,777 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-24 05:41:29,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:41:29" (1/1) ... [2023-12-24 05:41:29,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:41:29" (1/1) ... [2023-12-24 05:41:29,788 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:41:29" (1/1) ... [2023-12-24 05:41:29,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:41:29" (1/1) ... [2023-12-24 05:41:29,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:41:29" (1/1) ... [2023-12-24 05:41:29,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:41:29" (1/1) ... [2023-12-24 05:41:29,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 05:41:29,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 05:41:29,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 05:41:29,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 05:41:29,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:41:29" (1/1) ... [2023-12-24 05:41:29,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 05:41:29,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 05:41:29,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 05:41:29,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 05:41:29,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 05:41:29,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 05:41:29,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 05:41:29,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 05:41:29,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 05:41:29,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 05:41:29,928 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 05:41:29,930 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 05:41:46,957 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 05:41:46,987 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 05:41:46,987 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 05:41:46,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 05:41:46 BoogieIcfgContainer [2023-12-24 05:41:46,988 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 05:41:46,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 05:41:46,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 05:41:46,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 05:41:46,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 05:41:29" (1/3) ... [2023-12-24 05:41:46,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e73026a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 05:41:46, skipping insertion in model container [2023-12-24 05:41:46,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:41:29" (2/3) ... [2023-12-24 05:41:46,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e73026a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 05:41:46, skipping insertion in model container [2023-12-24 05:41:46,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 05:41:46" (3/3) ... [2023-12-24 05:41:46,993 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-72.i [2023-12-24 05:41:47,006 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 05:41:47,006 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 05:41:47,044 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 05:41:47,048 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;@439eae86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 05:41:47,048 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 05:41:47,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-24 05:41:47,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-24 05:41:47,066 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 05:41:47,067 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 05:41:47,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 05:41:47,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 05:41:47,072 INFO L85 PathProgramCache]: Analyzing trace with hash -253041127, now seen corresponding path program 1 times [2023-12-24 05:41:47,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 05:41:47,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940988933] [2023-12-24 05:41:47,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 05:41:47,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 05:41:47,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 05:41:47,102 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 05:41:47,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 05:41:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 05:41:48,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 05:41:48,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 05:41:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-12-24 05:41:54,723 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 05:41:54,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 05:41:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940988933] [2023-12-24 05:41:54,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940988933] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 05:41:54,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 05:41:54,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 05:41:54,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465482601] [2023-12-24 05:41:54,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 05:41:54,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 05:41:54,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 05:41:54,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 05:41:54,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 05:41:54,752 INFO L87 Difference]: Start difference. First operand has 80 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-24 05:41:59,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:42:02,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:42:07,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:42:11,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:42:15,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:42:18,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:42:23,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:42:27,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:42:31,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:42:35,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:42:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 05:42:35,185 INFO L93 Difference]: Finished difference Result 235 states and 441 transitions. [2023-12-24 05:42:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 05:42:35,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2023-12-24 05:42:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 05:42:35,509 INFO L225 Difference]: With dead ends: 235 [2023-12-24 05:42:35,509 INFO L226 Difference]: Without dead ends: 156 [2023-12-24 05:42:35,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 05:42:35,514 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 107 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 59 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.1s IncrementalHoareTripleChecker+Time [2023-12-24 05:42:35,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 399 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 40.1s Time] [2023-12-24 05:42:35,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-24 05:42:35,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2023-12-24 05:42:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-24 05:42:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 208 transitions. [2023-12-24 05:42:35,565 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 208 transitions. Word has length 183 [2023-12-24 05:42:35,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 05:42:35,565 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 208 transitions. [2023-12-24 05:42:35,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-24 05:42:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 208 transitions. [2023-12-24 05:42:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-24 05:42:35,568 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 05:42:35,568 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 05:42:35,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 05:42:35,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 05:42:35,785 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 05:42:35,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 05:42:35,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1941984869, now seen corresponding path program 1 times [2023-12-24 05:42:35,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 05:42:35,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489801909] [2023-12-24 05:42:35,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 05:42:35,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 05:42:35,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 05:42:35,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 05:42:35,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 05:42:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 05:42:36,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 05:42:36,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 05:42:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 334 proven. 75 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2023-12-24 05:42:39,881 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 05:42:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2023-12-24 05:42:41,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 05:42:41,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489801909] [2023-12-24 05:42:41,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489801909] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 05:42:41,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 05:42:41,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-24 05:42:41,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543439812] [2023-12-24 05:42:41,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 05:42:41,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 05:42:41,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 05:42:41,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 05:42:41,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 05:42:41,405 INFO L87 Difference]: Start difference. First operand 132 states and 208 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2023-12-24 05:42:48,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:42:52,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:42:56,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:42:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 05:42:56,210 INFO L93 Difference]: Finished difference Result 225 states and 344 transitions. [2023-12-24 05:42:56,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 05:42:56,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 183 [2023-12-24 05:42:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 05:42:56,542 INFO L225 Difference]: With dead ends: 225 [2023-12-24 05:42:56,542 INFO L226 Difference]: Without dead ends: 148 [2023-12-24 05:42:56,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 358 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-24 05:42:56,544 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 48 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2023-12-24 05:42:56,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 194 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 160 Invalid, 3 Unknown, 0 Unchecked, 14.5s Time] [2023-12-24 05:42:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-12-24 05:42:56,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 140. [2023-12-24 05:42:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 77 states have internal predecessors, (97), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-24 05:42:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 213 transitions. [2023-12-24 05:42:56,577 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 213 transitions. Word has length 183 [2023-12-24 05:42:56,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 05:42:56,578 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 213 transitions. [2023-12-24 05:42:56,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2023-12-24 05:42:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 213 transitions. [2023-12-24 05:42:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-24 05:42:56,580 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 05:42:56,580 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 05:42:56,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 05:42:56,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 05:42:56,798 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 05:42:56,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 05:42:56,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1341865177, now seen corresponding path program 1 times [2023-12-24 05:42:56,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 05:42:56,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574747986] [2023-12-24 05:42:56,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 05:42:56,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 05:42:56,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 05:42:56,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 05:42:56,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 05:42:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 05:42:57,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 05:42:57,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 05:42:58,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-12-24 05:42:58,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 05:42:58,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 05:42:58,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574747986] [2023-12-24 05:42:58,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574747986] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 05:42:58,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 05:42:58,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 05:42:58,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509785074] [2023-12-24 05:42:58,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 05:42:58,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 05:42:58,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 05:42:58,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 05:42:58,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 05:42:58,192 INFO L87 Difference]: Start difference. First operand 140 states and 213 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-24 05:43:03,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:43:08,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:43:12,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:43:12,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 05:43:12,585 INFO L93 Difference]: Finished difference Result 304 states and 463 transitions. [2023-12-24 05:43:12,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 05:43:12,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2023-12-24 05:43:12,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 05:43:12,588 INFO L225 Difference]: With dead ends: 304 [2023-12-24 05:43:12,588 INFO L226 Difference]: Without dead ends: 223 [2023-12-24 05:43:12,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 05:43:12,590 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 109 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2023-12-24 05:43:12,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 308 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 3 Unknown, 0 Unchecked, 14.4s Time] [2023-12-24 05:43:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-12-24 05:43:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2023-12-24 05:43:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 126 states have (on average 1.2777777777777777) internal successors, (161), 126 states have internal predecessors, (161), 87 states have call successors, (87), 6 states have call predecessors, (87), 6 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2023-12-24 05:43:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 335 transitions. [2023-12-24 05:43:12,617 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 335 transitions. Word has length 183 [2023-12-24 05:43:12,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 05:43:12,620 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 335 transitions. [2023-12-24 05:43:12,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-24 05:43:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 335 transitions. [2023-12-24 05:43:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-24 05:43:12,622 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 05:43:12,622 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 05:43:12,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 05:43:12,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 05:43:12,860 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 05:43:12,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 05:43:12,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1600030615, now seen corresponding path program 1 times [2023-12-24 05:43:12,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 05:43:12,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187375302] [2023-12-24 05:43:12,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 05:43:12,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 05:43:12,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 05:43:12,866 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 05:43:12,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 05:43:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 05:43:14,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 05:43:14,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 05:43:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 630 proven. 63 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2023-12-24 05:43:17,342 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 05:43:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 63 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2023-12-24 05:43:19,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 05:43:19,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187375302] [2023-12-24 05:43:19,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187375302] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 05:43:19,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 05:43:19,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2023-12-24 05:43:19,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417948873] [2023-12-24 05:43:19,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 05:43:19,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 05:43:19,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 05:43:19,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 05:43:19,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-24 05:43:19,337 INFO L87 Difference]: Start difference. First operand 220 states and 335 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2023-12-24 05:43:27,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.79s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:43:31,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:43:35,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:43:39,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:43:45,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:43:49,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:43:53,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:43:57,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:44:01,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:44:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 05:44:04,860 INFO L93 Difference]: Finished difference Result 414 states and 605 transitions. [2023-12-24 05:44:04,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-24 05:44:04,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 183 [2023-12-24 05:44:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 05:44:04,863 INFO L225 Difference]: With dead ends: 414 [2023-12-24 05:44:04,863 INFO L226 Difference]: Without dead ends: 251 [2023-12-24 05:44:04,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2023-12-24 05:44:04,865 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 224 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 152 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.8s IncrementalHoareTripleChecker+Time [2023-12-24 05:44:04,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 508 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 558 Invalid, 9 Unknown, 0 Unchecked, 43.8s Time] [2023-12-24 05:44:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-24 05:44:04,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 211. [2023-12-24 05:44:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 113 states have (on average 1.1327433628318584) internal successors, (128), 114 states have internal predecessors, (128), 87 states have call successors, (87), 10 states have call predecessors, (87), 10 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2023-12-24 05:44:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 302 transitions. [2023-12-24 05:44:04,886 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 302 transitions. Word has length 183 [2023-12-24 05:44:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 05:44:04,886 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 302 transitions. [2023-12-24 05:44:04,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2023-12-24 05:44:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 302 transitions. [2023-12-24 05:44:04,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-24 05:44:04,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 05:44:04,888 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 05:44:04,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 05:44:05,088 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 [2023-12-24 05:44:05,088 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 05:44:05,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 05:44:05,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1601877657, now seen corresponding path program 1 times [2023-12-24 05:44:05,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 05:44:05,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97792950] [2023-12-24 05:44:05,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 05:44:05,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 05:44:05,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 05:44:05,091 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 05:44:05,103 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 (6)] Waiting until timeout for monitored process [2023-12-24 05:44:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 05:44:06,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 05:44:06,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 05:46:24,225 WARN L293 SmtUtils]: Spent 9.98s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:46:33,983 WARN L293 SmtUtils]: Spent 9.76s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:46:43,841 WARN L293 SmtUtils]: Spent 9.86s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:46:53,707 WARN L293 SmtUtils]: Spent 9.85s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:47:03,629 WARN L293 SmtUtils]: Spent 9.92s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:47:13,577 WARN L293 SmtUtils]: Spent 9.95s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:47:23,481 WARN L293 SmtUtils]: Spent 9.90s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:47:33,429 WARN L293 SmtUtils]: Spent 9.95s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:47:43,429 WARN L293 SmtUtils]: Spent 10.00s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:47:53,378 WARN L293 SmtUtils]: Spent 9.95s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:48:03,377 WARN L293 SmtUtils]: Spent 10.00s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:48:13,332 WARN L293 SmtUtils]: Spent 9.95s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:48:23,307 WARN L293 SmtUtils]: Spent 9.97s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:48:33,340 WARN L293 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:48:43,333 WARN L293 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:48:53,275 WARN L293 SmtUtils]: Spent 9.94s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:49:03,305 WARN L293 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:49:13,315 WARN L293 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:49:21,878 WARN L293 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:49:31,901 WARN L293 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:49:41,945 WARN L293 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:49:51,900 WARN L293 SmtUtils]: Spent 9.95s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:50:01,943 WARN L293 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:50:11,964 WARN L293 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:50:21,980 WARN L293 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:50:32,023 WARN L293 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:50:42,064 WARN L293 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:50:52,009 WARN L293 SmtUtils]: Spent 9.94s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:51:01,955 WARN L293 SmtUtils]: Spent 9.94s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:51:11,942 WARN L293 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:51:21,889 WARN L293 SmtUtils]: Spent 9.95s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:51:31,873 WARN L293 SmtUtils]: Spent 9.98s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:51:41,784 WARN L293 SmtUtils]: Spent 9.91s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:51:51,673 WARN L293 SmtUtils]: Spent 9.89s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:52:00,309 WARN L293 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:52:10,247 WARN L293 SmtUtils]: Spent 9.94s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:52:14,804 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_20~0))) (let ((.cse4 ((_ sign_extend 24) c_~var_1_25~0)) (.cse5 ((_ sign_extend 24) c_~var_1_24~0)) (.cse2 (fp.mul c_currentRoundingMode .cse0 c_~var_1_26~0)) (.cse3 (fp.lt c_~var_1_14~0 c_~var_1_15~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_21~0))) (and (not (fp.lt .cse0 c_~var_1_14~0)) (= (_ bv16 32) c_~last_1_var_1_36~0) (= (_ bv1 8) c_~last_1_var_1_28~0) (bvsle ((_ zero_extend 24) c_~var_1_7~0) (_ bv0 32)) (bvsle ((_ zero_extend 24) c_~var_1_5~0) (_ bv0 32)) (= .cse1 c_~var_1_26~0) (not (fp.eq c_~var_1_21~0 c_~last_1_var_1_20~0)) (fp.gt .cse0 c_~var_1_15~0) (or (not (fp.geq (fp.div c_currentRoundingMode c_~var_1_22~0 c_~var_1_14~0) .cse2)) (not .cse3)) (= ((_ extract 7 0) (bvadd (_ bv4294967295 32) (bvneg (bvadd (bvneg .cse4) .cse5)))) c_~var_1_23~0) (= ((_ sign_extend 8) c_~var_1_24~0) c_~var_1_27~0) (let ((.cse13 ((_ zero_extend 16) c_~var_1_34~0))) (let ((.cse7 (= ((_ extract 15 0) .cse5) c_~var_1_29~0)) (.cse9 ((_ zero_extend 16) c_~var_1_35~0)) (.cse10 (bvsgt .cse4 .cse13))) (or (and (let ((.cse8 (bvadd .cse4 .cse9))) (let ((.cse6 (bvsgt .cse5 .cse8))) (or (and .cse6 .cse7) (and (not .cse6) (= ((_ extract 15 0) .cse8) c_~var_1_29~0))))) .cse10) (and (let ((.cse11 (bvadd .cse13 .cse9))) (let ((.cse12 (bvsgt .cse5 .cse11))) (or (and (= ((_ extract 15 0) .cse11) c_~var_1_29~0) (not .cse12)) (and .cse12 .cse7)))) (not .cse10))))) (= c_~var_1_8~0 ((_ sign_extend 8) c_~var_1_23~0)) (bvsle ((_ zero_extend 24) c_~var_1_6~0) (_ bv0 32)) (or (not (fp.geq (fp.div c_currentRoundingMode c_~var_1_22~0 c_~var_1_15~0) .cse2)) .cse3) (= c_~var_1_21~0 c_~var_1_20~0) (= (bvadd (_ bv16 16) c_~last_1_var_1_8~0) (_ bv0 16)) (let ((.cse14 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse15 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq c_~var_1_21~0 (fp.neg .cse14)) (fp.geq c_~var_1_21~0 (fp.neg .cse15))) (and (fp.geq c_~var_1_21~0 .cse14) (fp.leq c_~var_1_21~0 .cse15)))) (= c_~last_1_var_1_23~0 (_ bv16 8)) (= (_ bv0 8) c_~var_1_28~0) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~var_1_22~0 .cse1)))) is different from false [2023-12-24 05:52:19,343 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_20~0))) (let ((.cse4 ((_ sign_extend 24) c_~var_1_25~0)) (.cse5 ((_ sign_extend 24) c_~var_1_24~0)) (.cse2 (fp.mul c_currentRoundingMode .cse0 c_~var_1_26~0)) (.cse3 (fp.lt c_~var_1_14~0 c_~var_1_15~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_21~0))) (and (not (fp.lt .cse0 c_~var_1_14~0)) (= (_ bv16 32) c_~last_1_var_1_36~0) (= (_ bv1 8) c_~last_1_var_1_28~0) (bvsle ((_ zero_extend 24) c_~var_1_7~0) (_ bv0 32)) (bvsle ((_ zero_extend 24) c_~var_1_5~0) (_ bv0 32)) (= .cse1 c_~var_1_26~0) (not (fp.eq c_~var_1_21~0 c_~last_1_var_1_20~0)) (fp.gt .cse0 c_~var_1_15~0) (or (not (fp.geq (fp.div c_currentRoundingMode c_~var_1_22~0 c_~var_1_14~0) .cse2)) (not .cse3)) (= ((_ extract 7 0) (bvadd (_ bv4294967295 32) (bvneg (bvadd (bvneg .cse4) .cse5)))) c_~var_1_23~0) (= ((_ sign_extend 8) c_~var_1_24~0) c_~var_1_27~0) (let ((.cse13 ((_ zero_extend 16) c_~var_1_34~0))) (let ((.cse7 (= ((_ extract 15 0) .cse5) c_~var_1_29~0)) (.cse9 ((_ zero_extend 16) c_~var_1_35~0)) (.cse10 (bvsgt .cse4 .cse13))) (or (and (let ((.cse8 (bvadd .cse4 .cse9))) (let ((.cse6 (bvsgt .cse5 .cse8))) (or (and .cse6 .cse7) (and (not .cse6) (= ((_ extract 15 0) .cse8) c_~var_1_29~0))))) .cse10) (and (let ((.cse11 (bvadd .cse13 .cse9))) (let ((.cse12 (bvsgt .cse5 .cse11))) (or (and (= ((_ extract 15 0) .cse11) c_~var_1_29~0) (not .cse12)) (and .cse12 .cse7)))) (not .cse10))))) (= c_~var_1_8~0 ((_ sign_extend 8) c_~var_1_23~0)) (bvsle ((_ zero_extend 24) c_~var_1_6~0) (_ bv0 32)) (or (not (fp.geq (fp.div c_currentRoundingMode c_~var_1_22~0 c_~var_1_15~0) .cse2)) .cse3) (= c_~var_1_21~0 c_~var_1_20~0) (= (bvadd (_ bv16 16) c_~last_1_var_1_8~0) (_ bv0 16)) (let ((.cse14 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse15 ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq c_~var_1_21~0 (fp.neg .cse14)) (fp.geq c_~var_1_21~0 (fp.neg .cse15))) (and (fp.geq c_~var_1_21~0 .cse14) (fp.leq c_~var_1_21~0 .cse15)))) (= c_~last_1_var_1_23~0 (_ bv16 8)) (= (_ bv0 8) c_~var_1_28~0) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~var_1_22~0 .cse1)))) is different from true [2023-12-24 05:52:29,437 WARN L293 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:52:39,493 WARN L293 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:52:49,517 WARN L293 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:52:59,605 WARN L293 SmtUtils]: Spent 10.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:53:09,674 WARN L293 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:53:19,698 WARN L293 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:53:29,729 WARN L293 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:53:39,822 WARN L293 SmtUtils]: Spent 10.09s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:53:49,892 WARN L293 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:53:59,904 WARN L293 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:54:09,962 WARN L293 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:54:19,981 WARN L293 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:54:29,971 WARN L293 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:54:31,129 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-24 05:54:31,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 05:54:31,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97792950] [2023-12-24 05:54:31,130 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-24 05:54:31,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2023-12-24 05:54:31,158 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 (6)] Forceful destruction successful, exit code 0 [2023-12-24 05:54:31,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 05:54:31,332 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 58 more [2023-12-24 05:54:31,335 INFO L158 Benchmark]: Toolchain (without parser) took 782009.61ms. Allocated memory is still 348.1MB. Free memory was 296.2MB in the beginning and 167.4MB in the end (delta: 128.7MB). Peak memory consumption was 129.8MB. Max. memory is 8.0GB. [2023-12-24 05:54:31,335 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 219.2MB. Free memory is still 169.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 05:54:31,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.23ms. Allocated memory is still 348.1MB. Free memory was 295.9MB in the beginning and 278.6MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 05:54:31,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.94ms. Allocated memory is still 348.1MB. Free memory was 278.6MB in the beginning and 275.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 05:54:31,336 INFO L158 Benchmark]: Boogie Preprocessor took 58.10ms. Allocated memory is still 348.1MB. Free memory was 275.5MB in the beginning and 270.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-24 05:54:31,336 INFO L158 Benchmark]: RCFGBuilder took 17190.20ms. Allocated memory is still 348.1MB. Free memory was 270.7MB in the beginning and 299.4MB in the end (delta: -28.7MB). Peak memory consumption was 20.9MB. Max. memory is 8.0GB. [2023-12-24 05:54:31,336 INFO L158 Benchmark]: TraceAbstraction took 764345.66ms. Allocated memory is still 348.1MB. Free memory was 298.9MB in the beginning and 167.4MB in the end (delta: 131.5MB). Peak memory consumption was 132.0MB. Max. memory is 8.0GB. [2023-12-24 05:54:31,337 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44ms. Allocated memory is still 219.2MB. Free memory is still 169.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 356.23ms. Allocated memory is still 348.1MB. Free memory was 295.9MB in the beginning and 278.6MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.94ms. Allocated memory is still 348.1MB. Free memory was 278.6MB in the beginning and 275.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.10ms. Allocated memory is still 348.1MB. Free memory was 275.5MB in the beginning and 270.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 17190.20ms. Allocated memory is still 348.1MB. Free memory was 270.7MB in the beginning and 299.4MB in the end (delta: -28.7MB). Peak memory consumption was 20.9MB. Max. memory is 8.0GB. * TraceAbstraction took 764345.66ms. Allocated memory is still 348.1MB. Free memory was 298.9MB in the beginning and 167.4MB in the end (delta: 131.5MB). Peak memory consumption was 132.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...