/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-64.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-05 22:57:54,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 22:57:54,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 22:57:54,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 22:57:54,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 22:57:54,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 22:57:54,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 22:57:54,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 22:57:54,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 22:57:54,707 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 22:57:54,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 22:57:54,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 22:57:54,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 22:57:54,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 22:57:54,709 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 22:57:54,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 22:57:54,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 22:57:54,711 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 22:57:54,711 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 22:57:54,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 22:57:54,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 22:57:54,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 22:57:54,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 22:57:54,713 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 22:57:54,713 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 22:57:54,713 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 22:57:54,713 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 22:57:54,713 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 22:57:54,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 22:57:54,714 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 22:57:54,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 22:57:54,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 22:57:54,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 22:57:54,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 22:57:54,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 22:57:54,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 22:57:54,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 22:57:54,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 22:57:54,715 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 22:57:54,715 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 22:57:54,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 22:57:54,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 22:57:54,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 22:57:54,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 22:57:54,716 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-05 22:57:54,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 22:57:54,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 22:57:54,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 22:57:54,921 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 22:57:54,921 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 22:57:54,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-64.i [2024-11-05 22:57:56,083 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 22:57:56,245 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 22:57:56,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-64.i [2024-11-05 22:57:56,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c24296522/2d4513fa4c1a438a871c71b79f641b10/FLAGa817e697f [2024-11-05 22:57:56,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c24296522/2d4513fa4c1a438a871c71b79f641b10 [2024-11-05 22:57:56,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 22:57:56,656 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 22:57:56,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 22:57:56,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 22:57:56,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 22:57:56,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 10:57:56" (1/1) ... [2024-11-05 22:57:56,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5a65aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:57:56, skipping insertion in model container [2024-11-05 22:57:56,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 10:57:56" (1/1) ... [2024-11-05 22:57:56,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 22:57:56,802 WARN L250 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_floatingpointinfluence_no-floats_file-64.i[916,929] [2024-11-05 22:57:56,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 22:57:56,857 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 22:57:56,866 WARN L250 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_floatingpointinfluence_no-floats_file-64.i[916,929] [2024-11-05 22:57:56,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 22:57:56,893 INFO L204 MainTranslator]: Completed translation [2024-11-05 22:57:56,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:57:56 WrapperNode [2024-11-05 22:57:56,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 22:57:56,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 22:57:56,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 22:57:56,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 22:57:56,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:57:56" (1/1) ... [2024-11-05 22:57:56,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:57:56" (1/1) ... [2024-11-05 22:57:56,926 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-05 22:57:56,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 22:57:56,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 22:57:56,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 22:57:56,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 22:57:56,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:57:56" (1/1) ... [2024-11-05 22:57:56,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:57:56" (1/1) ... [2024-11-05 22:57:56,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:57:56" (1/1) ... [2024-11-05 22:57:56,954 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]. [2024-11-05 22:57:56,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:57:56" (1/1) ... [2024-11-05 22:57:56,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:57:56" (1/1) ... [2024-11-05 22:57:56,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:57:56" (1/1) ... [2024-11-05 22:57:56,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:57:56" (1/1) ... [2024-11-05 22:57:56,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:57:56" (1/1) ... [2024-11-05 22:57:56,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:57:56" (1/1) ... [2024-11-05 22:57:56,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 22:57:56,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 22:57:56,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 22:57:56,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 22:57:56,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:57:56" (1/1) ... [2024-11-05 22:57:56,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 22:57:56,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 22:57:56,999 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) [2024-11-05 22:57:57,001 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 [2024-11-05 22:57:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 22:57:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 22:57:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 22:57:57,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 22:57:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 22:57:57,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 22:57:57,098 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 22:57:57,100 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 22:57:57,396 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-05 22:57:57,396 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 22:57:57,405 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 22:57:57,405 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 22:57:57,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 10:57:57 BoogieIcfgContainer [2024-11-05 22:57:57,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 22:57:57,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 22:57:57,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 22:57:57,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 22:57:57,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 10:57:56" (1/3) ... [2024-11-05 22:57:57,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3e549f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 10:57:57, skipping insertion in model container [2024-11-05 22:57:57,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:57:56" (2/3) ... [2024-11-05 22:57:57,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3e549f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 10:57:57, skipping insertion in model container [2024-11-05 22:57:57,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 10:57:57" (3/3) ... [2024-11-05 22:57:57,412 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-64.i [2024-11-05 22:57:57,426 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 22:57:57,426 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 22:57:57,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 22:57:57,474 INFO L333 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, 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;@4770ef86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 22:57:57,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 22:57:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-05 22:57:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-05 22:57:57,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:57:57,489 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:57:57,489 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:57:57,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:57:57,493 INFO L85 PathProgramCache]: Analyzing trace with hash -766407730, now seen corresponding path program 1 times [2024-11-05 22:57:57,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 22:57:57,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399394732] [2024-11-05 22:57:57,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:57:57,503 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 [2024-11-05 22:57:57,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:57:57,505 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) [2024-11-05 22:57:57,506 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 [2024-11-05 22:57:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:57:57,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 22:57:57,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:57:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 526 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-05 22:57:57,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 22:57:57,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 22:57:57,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399394732] [2024-11-05 22:57:57,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399394732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 22:57:57,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:57:57,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-05 22:57:57,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551388525] [2024-11-05 22:57:57,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 22:57:57,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 22:57:57,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 22:57:57,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 22:57:57,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 22:57:57,786 INFO L87 Difference]: Start difference. First operand has 63 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-05 22:57:57,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:57:57,811 INFO L93 Difference]: Finished difference Result 119 states and 212 transitions. [2024-11-05 22:57:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 22:57:57,815 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 145 [2024-11-05 22:57:57,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:57:57,822 INFO L225 Difference]: With dead ends: 119 [2024-11-05 22:57:57,822 INFO L226 Difference]: Without dead ends: 59 [2024-11-05 22:57:57,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 22:57:57,829 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 22:57:57,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 22:57:57,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-05 22:57:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-05 22:57:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-05 22:57:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2024-11-05 22:57:57,862 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 145 [2024-11-05 22:57:57,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:57:57,863 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2024-11-05 22:57:57,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-05 22:57:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2024-11-05 22:57:57,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-05 22:57:57,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:57:57,865 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:57:57,873 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 [2024-11-05 22:57:58,067 WARN L453 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 [2024-11-05 22:57:58,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:57:58,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:57:58,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1694646600, now seen corresponding path program 1 times [2024-11-05 22:57:58,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 22:57:58,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298439837] [2024-11-05 22:57:58,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:57:58,070 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 [2024-11-05 22:57:58,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:57:58,072 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) [2024-11-05 22:57:58,073 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 [2024-11-05 22:57:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:57:58,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-05 22:57:58,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:58:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-05 22:58:07,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 22:58:07,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 22:58:07,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298439837] [2024-11-05 22:58:07,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298439837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 22:58:07,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:58:07,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-05 22:58:07,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197419858] [2024-11-05 22:58:07,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 22:58:07,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 22:58:07,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 22:58:07,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 22:58:07,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-05 22:58:07,846 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-05 22:58:08,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:58:08,415 INFO L93 Difference]: Finished difference Result 181 states and 274 transitions. [2024-11-05 22:58:08,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 22:58:08,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 145 [2024-11-05 22:58:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:58:08,419 INFO L225 Difference]: With dead ends: 181 [2024-11-05 22:58:08,419 INFO L226 Difference]: Without dead ends: 125 [2024-11-05 22:58:08,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-05 22:58:08,421 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 57 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 22:58:08,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 430 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 22:58:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-05 22:58:08,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2024-11-05 22:58:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 65 states have (on average 1.2) internal successors, (78), 65 states have internal predecessors, (78), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-05 22:58:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 174 transitions. [2024-11-05 22:58:08,442 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 174 transitions. Word has length 145 [2024-11-05 22:58:08,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:58:08,443 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 174 transitions. [2024-11-05 22:58:08,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-05 22:58:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 174 transitions. [2024-11-05 22:58:08,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-05 22:58:08,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:58:08,446 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:58:08,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 22:58:08,647 WARN L453 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 [2024-11-05 22:58:08,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:58:08,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:58:08,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2124128555, now seen corresponding path program 1 times [2024-11-05 22:58:08,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 22:58:08,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831680513] [2024-11-05 22:58:08,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:58:08,649 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 [2024-11-05 22:58:08,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:58:08,652 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) [2024-11-05 22:58:08,653 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 [2024-11-05 22:58:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:58:08,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 22:58:08,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:58:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-05 22:58:15,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 22:58:15,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 22:58:15,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831680513] [2024-11-05 22:58:15,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831680513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 22:58:15,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:58:15,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-05 22:58:15,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657088133] [2024-11-05 22:58:15,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 22:58:15,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 22:58:15,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 22:58:15,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 22:58:15,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 22:58:15,135 INFO L87 Difference]: Start difference. First operand 116 states and 174 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-05 22:58:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:58:15,440 INFO L93 Difference]: Finished difference Result 210 states and 314 transitions. [2024-11-05 22:58:15,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 22:58:15,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 146 [2024-11-05 22:58:15,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:58:15,442 INFO L225 Difference]: With dead ends: 210 [2024-11-05 22:58:15,442 INFO L226 Difference]: Without dead ends: 154 [2024-11-05 22:58:15,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-05 22:58:15,445 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 71 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 22:58:15,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 391 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 22:58:15,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-05 22:58:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2024-11-05 22:58:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 76 states have (on average 1.105263157894737) internal successors, (84), 77 states have internal predecessors, (84), 61 states have call successors, (61), 3 states have call predecessors, (61), 3 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-05 22:58:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 206 transitions. [2024-11-05 22:58:15,480 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 206 transitions. Word has length 146 [2024-11-05 22:58:15,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:58:15,482 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 206 transitions. [2024-11-05 22:58:15,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-05 22:58:15,483 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 206 transitions. [2024-11-05 22:58:15,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-05 22:58:15,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:58:15,485 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:58:15,492 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 (4)] Ended with exit code 0 [2024-11-05 22:58:15,686 WARN L453 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 [2024-11-05 22:58:15,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:58:15,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:58:15,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1793484961, now seen corresponding path program 1 times [2024-11-05 22:58:15,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 22:58:15,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707038930] [2024-11-05 22:58:15,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:58:15,688 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 [2024-11-05 22:58:15,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:58:15,690 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) [2024-11-05 22:58:15,691 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 [2024-11-05 22:58:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:58:15,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 22:58:15,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:58:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 428 proven. 111 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-05 22:58:16,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:58:18,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 22:58:18,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707038930] [2024-11-05 22:58:18,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707038930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-05 22:58:18,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1441313949] [2024-11-05 22:58:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:58:18,582 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-05 22:58:18,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-05 22:58:18,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 22:58:18,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-05 22:58:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:58:18,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-05 22:58:18,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:58:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-05 22:58:31,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 22:58:31,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1441313949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 22:58:31,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 22:58:31,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2024-11-05 22:58:31,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623622143] [2024-11-05 22:58:31,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 22:58:31,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 22:58:31,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 22:58:31,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 22:58:31,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-05 22:58:31,612 INFO L87 Difference]: Start difference. First operand 141 states and 206 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-05 22:58:33,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:58:33,448 INFO L93 Difference]: Finished difference Result 164 states and 231 transitions. [2024-11-05 22:58:33,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 22:58:33,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 147 [2024-11-05 22:58:33,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:58:33,452 INFO L225 Difference]: With dead ends: 164 [2024-11-05 22:58:33,452 INFO L226 Difference]: Without dead ends: 162 [2024-11-05 22:58:33,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-11-05 22:58:33,453 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 28 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-05 22:58:33,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 414 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-05 22:58:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-05 22:58:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 141. [2024-11-05 22:58:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 76 states have (on average 1.105263157894737) internal successors, (84), 77 states have internal predecessors, (84), 61 states have call successors, (61), 3 states have call predecessors, (61), 3 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-05 22:58:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 206 transitions. [2024-11-05 22:58:33,467 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 206 transitions. Word has length 147 [2024-11-05 22:58:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:58:33,467 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 206 transitions. [2024-11-05 22:58:33,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-05 22:58:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 206 transitions. [2024-11-05 22:58:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-05 22:58:33,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:58:33,471 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:58:33,480 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 (5)] Ended with exit code 0 [2024-11-05 22:58:33,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-05 22:58:33,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-05 22:58:33,872 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:58:33,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:58:33,873 INFO L85 PathProgramCache]: Analyzing trace with hash -36523888, now seen corresponding path program 1 times [2024-11-05 22:58:33,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 22:58:33,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730670652] [2024-11-05 22:58:33,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:58:33,874 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 [2024-11-05 22:58:33,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:58:33,875 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 22:58:33,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-05 22:58:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:58:34,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 22:58:34,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:58:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4557 backedges. 2537 proven. 63 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2024-11-05 22:58:34,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:58:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4557 backedges. 44 proven. 135 refuted. 0 times theorem prover too weak. 4378 trivial. 0 not checked. [2024-11-05 22:58:34,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 22:58:34,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730670652] [2024-11-05 22:58:34,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730670652] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:58:34,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:58:34,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2024-11-05 22:58:34,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100344912] [2024-11-05 22:58:34,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:58:34,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 22:58:34,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 22:58:34,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 22:58:34,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-05 22:58:34,759 INFO L87 Difference]: Start difference. First operand 141 states and 206 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 5 states have call successors, (96), 4 states have call predecessors, (96), 6 states have return successors, (96), 5 states have call predecessors, (96), 5 states have call successors, (96) [2024-11-05 22:58:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:58:35,430 INFO L93 Difference]: Finished difference Result 275 states and 385 transitions. [2024-11-05 22:58:35,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-05 22:58:35,432 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 5 states have call successors, (96), 4 states have call predecessors, (96), 6 states have return successors, (96), 5 states have call predecessors, (96), 5 states have call successors, (96) Word has length 287 [2024-11-05 22:58:35,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:58:35,433 INFO L225 Difference]: With dead ends: 275 [2024-11-05 22:58:35,433 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 22:58:35,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2024-11-05 22:58:35,435 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 145 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 22:58:35,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 235 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 22:58:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 22:58:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 22:58:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 22:58:35,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 22:58:35,439 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 287 [2024-11-05 22:58:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:58:35,439 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 22:58:35,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 5 states have call successors, (96), 4 states have call predecessors, (96), 6 states have return successors, (96), 5 states have call predecessors, (96), 5 states have call successors, (96) [2024-11-05 22:58:35,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 22:58:35,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 22:58:35,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 22:58:35,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-05 22:58:35,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 22:58:35,647 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-05 22:58:35,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 22:58:36,501 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 22:58:36,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 10:58:36 BoogieIcfgContainer [2024-11-05 22:58:36,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 22:58:36,524 INFO L158 Benchmark]: Toolchain (without parser) took 39868.10ms. Allocated memory was 289.4MB in the beginning and 827.3MB in the end (delta: 537.9MB). Free memory was 247.9MB in the beginning and 654.9MB in the end (delta: -407.0MB). Peak memory consumption was 131.9MB. Max. memory is 8.0GB. [2024-11-05 22:58:36,526 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 206.6MB. Free memory is still 159.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 22:58:36,526 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.56ms. Allocated memory is still 289.4MB. Free memory was 247.9MB in the beginning and 232.8MB in the end (delta: 15.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-11-05 22:58:36,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.48ms. Allocated memory is still 289.4MB. Free memory was 232.8MB in the beginning and 230.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 22:58:36,527 INFO L158 Benchmark]: Boogie Preprocessor took 39.69ms. Allocated memory is still 289.4MB. Free memory was 230.7MB in the beginning and 228.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 22:58:36,527 INFO L158 Benchmark]: RCFGBuilder took 438.48ms. Allocated memory is still 289.4MB. Free memory was 228.0MB in the beginning and 211.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-11-05 22:58:36,528 INFO L158 Benchmark]: TraceAbstraction took 39115.83ms. Allocated memory was 289.4MB in the beginning and 827.3MB in the end (delta: 537.9MB). Free memory was 210.8MB in the beginning and 654.9MB in the end (delta: -444.1MB). Peak memory consumption was 94.1MB. Max. memory is 8.0GB. [2024-11-05 22:58:36,529 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.11ms. Allocated memory is still 206.6MB. Free memory is still 159.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.56ms. Allocated memory is still 289.4MB. Free memory was 247.9MB in the beginning and 232.8MB in the end (delta: 15.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.48ms. Allocated memory is still 289.4MB. Free memory was 232.8MB in the beginning and 230.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.69ms. Allocated memory is still 289.4MB. Free memory was 230.7MB in the beginning and 228.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 438.48ms. Allocated memory is still 289.4MB. Free memory was 228.0MB in the beginning and 211.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 39115.83ms. Allocated memory was 289.4MB in the beginning and 827.3MB in the end (delta: 537.9MB). Free memory was 210.8MB in the beginning and 654.9MB in the end (delta: -444.1MB). Peak memory consumption was 94.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.2s, OverallIterations: 5, TraceHistogramMax: 48, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 301 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 1559 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1135 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 739 IncrementalHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 424 mSDtfsCounter, 739 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1329 GetRequests, 1273 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=3, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 43 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 32.4s InterpolantComputationTime, 1017 NumberOfCodeBlocks, 1017 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1297 ConstructedInterpolants, 0 QuantifiedInterpolants, 4363 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1556 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 14325/14634 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((0 == var_1_10) && (last_1_var_1_16 <= ((var_1_3 + -last_1_var_1_16) % 4294967296))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (0 == var_1_10) Ensures: (((((0 != cond) || (last_1_var_1_16 <= ((var_1_3 + -last_1_var_1_16) % 4294967296))) && (((0 != cond) || (last_1_var_1_16 != 10)) || (10 != var_1_16))) && (0 == var_1_10)) && (((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (last_1_var_1_16 == \old(last_1_var_1_16)))) RESULT: Ultimate proved your program to be correct! [2024-11-05 22:58:36,563 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 0 Received shutdown request...