/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 --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/byte_add-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:27:01,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:27:01,858 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 20:27:01,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:27:01,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:27:01,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:27:01,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:27:01,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:27:01,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:27:01,877 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:27:01,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:27:01,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:27:01,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:27:01,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:27:01,878 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:27:01,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:27:01,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:27:01,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:27:01,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:27:01,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:27:01,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:27:01,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:27:01,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:27:01,883 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:27:01,883 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:27:01,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:27:01,884 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:27:01,884 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:27:01,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:27:01,884 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:27:01,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:27:01,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:27:01,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:27:01,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:27:01,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:27:01,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:27:01,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:27:01,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:27:01,886 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:27:01,888 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:27:01,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:27:01,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:27:01,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:27:01,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:27:01,889 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES 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: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> 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 20:27:02,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:27:02,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:27:02,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:27:02,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:27:02,091 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:27:02,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add-1.i [2024-11-05 20:27:03,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:27:03,459 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:27:03,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i [2024-11-05 20:27:03,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6931393b/81ec95d7d67b40f582ad3f04d1abe597/FLAG6df5f73cb [2024-11-05 20:27:03,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6931393b/81ec95d7d67b40f582ad3f04d1abe597 [2024-11-05 20:27:03,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:27:03,477 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:27:03,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:27:03,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:27:03,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:27:03,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:27:03" (1/1) ... [2024-11-05 20:27:03,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48046dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:03, skipping insertion in model container [2024-11-05 20:27:03,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:27:03" (1/1) ... [2024-11-05 20:27:03,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:27:03,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i[1166,1179] [2024-11-05 20:27:03,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:27:03,666 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:27:03,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i[1166,1179] [2024-11-05 20:27:03,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:27:03,711 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:27:03,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:03 WrapperNode [2024-11-05 20:27:03,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:27:03,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:27:03,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:27:03,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:27:03,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:03" (1/1) ... [2024-11-05 20:27:03,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:03" (1/1) ... [2024-11-05 20:27:03,741 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2024-11-05 20:27:03,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:27:03,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:27:03,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:27:03,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:27:03,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:03" (1/1) ... [2024-11-05 20:27:03,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:03" (1/1) ... [2024-11-05 20:27:03,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:03" (1/1) ... [2024-11-05 20:27:03,764 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 20:27:03,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:03" (1/1) ... [2024-11-05 20:27:03,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:03" (1/1) ... [2024-11-05 20:27:03,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:03" (1/1) ... [2024-11-05 20:27:03,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:03" (1/1) ... [2024-11-05 20:27:03,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:03" (1/1) ... [2024-11-05 20:27:03,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:03" (1/1) ... [2024-11-05 20:27:03,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:27:03,785 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:27:03,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:27:03,785 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:27:03,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:03" (1/1) ... [2024-11-05 20:27:03,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:27:03,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:27:03,816 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 20:27:03,819 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 20:27:03,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:27:03,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:27:03,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:27:03,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:27:03,893 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:27:03,894 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:27:04,057 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-05 20:27:04,057 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:27:04,065 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:27:04,066 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-05 20:27:04,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:27:04 BoogieIcfgContainer [2024-11-05 20:27:04,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:27:04,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:27:04,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:27:04,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:27:04,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:27:03" (1/3) ... [2024-11-05 20:27:04,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da4c466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:27:04, skipping insertion in model container [2024-11-05 20:27:04,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:03" (2/3) ... [2024-11-05 20:27:04,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da4c466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:27:04, skipping insertion in model container [2024-11-05 20:27:04,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:27:04" (3/3) ... [2024-11-05 20:27:04,074 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2024-11-05 20:27:04,086 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:27:04,086 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:27:04,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:27:04,124 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;@2183c63d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:27:04,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:27:04,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 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 20:27:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-05 20:27:04,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:04,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:04,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:04,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:04,135 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2024-11-05 20:27:04,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:04,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [801071149] [2024-11-05 20:27:04,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:04,156 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 20:27:04,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:04,159 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 20:27:04,160 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 20:27:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:04,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 20:27:04,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:04,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:04,237 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:04,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [801071149] [2024-11-05 20:27:04,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [801071149] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:04,237 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:04,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-05 20:27:04,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479754289] [2024-11-05 20:27:04,241 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:04,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 20:27:04,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:04,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 20:27:04,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 20:27:04,261 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 20:27:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:04,275 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2024-11-05 20:27:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 20:27:04,276 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) Word has length 12 [2024-11-05 20:27:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:04,282 INFO L225 Difference]: With dead ends: 57 [2024-11-05 20:27:04,282 INFO L226 Difference]: Without dead ends: 38 [2024-11-05 20:27:04,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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 20:27:04,288 INFO L432 NwaCegarLoop]: 68 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, 68 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 20:27:04,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:27:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-05 20:27:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-05 20:27:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 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 20:27:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2024-11-05 20:27:04,313 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2024-11-05 20:27:04,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:04,314 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2024-11-05 20:27:04,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 20:27:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2024-11-05 20:27:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-05 20:27:04,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:04,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:04,322 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 20:27:04,522 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 20:27:04,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:04,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2024-11-05 20:27:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:04,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1456618710] [2024-11-05 20:27:04,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:04,524 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 20:27:04,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:04,527 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 20:27:04,528 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 20:27:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:04,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:27:04,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:04,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:04,650 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:04,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1456618710] [2024-11-05 20:27:04,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1456618710] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:04,650 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:04,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 20:27:04,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940311321] [2024-11-05 20:27:04,651 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:04,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:27:04,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:04,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:27:04,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:27:04,655 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 20:27:04,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:04,917 INFO L93 Difference]: Finished difference Result 141 states and 255 transitions. [2024-11-05 20:27:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 20:27:04,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) Word has length 12 [2024-11-05 20:27:04,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:04,919 INFO L225 Difference]: With dead ends: 141 [2024-11-05 20:27:04,919 INFO L226 Difference]: Without dead ends: 113 [2024-11-05 20:27:04,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:27:04,920 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 154 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:04,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 150 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:27:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-05 20:27:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2024-11-05 20:27:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.67) internal successors, (167), 100 states have internal predecessors, (167), 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 20:27:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 167 transitions. [2024-11-05 20:27:04,937 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 167 transitions. Word has length 12 [2024-11-05 20:27:04,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:04,937 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 167 transitions. [2024-11-05 20:27:04,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 20:27:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 167 transitions. [2024-11-05 20:27:04,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-05 20:27:04,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:04,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:04,949 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 20:27:05,138 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 20:27:05,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:05,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:05,140 INFO L85 PathProgramCache]: Analyzing trace with hash 583572890, now seen corresponding path program 1 times [2024-11-05 20:27:05,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:05,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1918617709] [2024-11-05 20:27:05,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:05,140 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 20:27:05,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:05,142 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 20:27:05,143 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 20:27:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:05,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:27:05,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:05,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:05,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:05,263 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:05,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1918617709] [2024-11-05 20:27:05,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1918617709] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:05,264 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:05,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2024-11-05 20:27:05,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809145425] [2024-11-05 20:27:05,264 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:05,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 20:27:05,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:05,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 20:27:05,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:27:05,265 INFO L87 Difference]: Start difference. First operand 101 states and 167 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 20:27:05,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:05,682 INFO L93 Difference]: Finished difference Result 274 states and 490 transitions. [2024-11-05 20:27:05,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 20:27:05,682 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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) Word has length 14 [2024-11-05 20:27:05,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:05,684 INFO L225 Difference]: With dead ends: 274 [2024-11-05 20:27:05,684 INFO L226 Difference]: Without dead ends: 229 [2024-11-05 20:27:05,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-05 20:27:05,685 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 793 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:05,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 169 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 20:27:05,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-05 20:27:05,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 190. [2024-11-05 20:27:05,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.656084656084656) internal successors, (313), 189 states have internal predecessors, (313), 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 20:27:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 313 transitions. [2024-11-05 20:27:05,707 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 313 transitions. Word has length 14 [2024-11-05 20:27:05,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:05,708 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 313 transitions. [2024-11-05 20:27:05,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 20:27:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 313 transitions. [2024-11-05 20:27:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 20:27:05,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:05,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 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 20:27:05,712 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 20:27:05,912 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 20:27:05,912 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:05,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:05,913 INFO L85 PathProgramCache]: Analyzing trace with hash -842586557, now seen corresponding path program 1 times [2024-11-05 20:27:05,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:05,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [800266545] [2024-11-05 20:27:05,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:05,913 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 20:27:05,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:05,916 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 20:27:05,917 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 20:27:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:05,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:27:05,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:05,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:06,020 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:06,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [800266545] [2024-11-05 20:27:06,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [800266545] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:06,020 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:06,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 20:27:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291100319] [2024-11-05 20:27:06,020 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:06,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:27:06,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:06,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:27:06,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:27:06,022 INFO L87 Difference]: Start difference. First operand 190 states and 313 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 20:27:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:06,213 INFO L93 Difference]: Finished difference Result 833 states and 1392 transitions. [2024-11-05 20:27:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 20:27:06,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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) Word has length 26 [2024-11-05 20:27:06,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:06,216 INFO L225 Difference]: With dead ends: 833 [2024-11-05 20:27:06,216 INFO L226 Difference]: Without dead ends: 668 [2024-11-05 20:27:06,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:27:06,218 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 215 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:06,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 127 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:27:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-05 20:27:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 419. [2024-11-05 20:27:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.5406698564593302) internal successors, (644), 418 states have internal predecessors, (644), 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 20:27:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 644 transitions. [2024-11-05 20:27:06,264 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 644 transitions. Word has length 26 [2024-11-05 20:27:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:06,265 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 644 transitions. [2024-11-05 20:27:06,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 20:27:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 644 transitions. [2024-11-05 20:27:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-05 20:27:06,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:06,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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 20:27:06,273 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 20:27:06,473 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 [2024-11-05 20:27:06,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:06,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:06,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1924928046, now seen corresponding path program 1 times [2024-11-05 20:27:06,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:06,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1759469826] [2024-11-05 20:27:06,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:06,474 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 20:27:06,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:06,476 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) [2024-11-05 20:27:06,477 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 [2024-11-05 20:27:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:06,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 20:27:06,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:06,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:06,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:06,711 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:06,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1759469826] [2024-11-05 20:27:06,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1759469826] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:06,711 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:06,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2024-11-05 20:27:06,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984703752] [2024-11-05 20:27:06,712 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:06,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-05 20:27:06,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:06,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-05 20:27:06,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-05 20:27:06,713 INFO L87 Difference]: Start difference. First operand 419 states and 644 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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 20:27:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:07,110 INFO L93 Difference]: Finished difference Result 1252 states and 1984 transitions. [2024-11-05 20:27:07,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-05 20:27:07,110 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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) Word has length 28 [2024-11-05 20:27:07,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:07,113 INFO L225 Difference]: With dead ends: 1252 [2024-11-05 20:27:07,113 INFO L226 Difference]: Without dead ends: 858 [2024-11-05 20:27:07,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-05 20:27:07,116 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 670 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:07,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 350 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 20:27:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2024-11-05 20:27:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 434. [2024-11-05 20:27:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 1.4942263279445727) internal successors, (647), 433 states have internal predecessors, (647), 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 20:27:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 647 transitions. [2024-11-05 20:27:07,131 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 647 transitions. Word has length 28 [2024-11-05 20:27:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:07,132 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 647 transitions. [2024-11-05 20:27:07,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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 20:27:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 647 transitions. [2024-11-05 20:27:07,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-05 20:27:07,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:07,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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 20:27:07,137 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 (6)] Ended with exit code 0 [2024-11-05 20:27:07,336 WARN L453 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 [2024-11-05 20:27:07,337 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:07,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1604924270, now seen corresponding path program 1 times [2024-11-05 20:27:07,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:07,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1677374491] [2024-11-05 20:27:07,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:07,337 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 20:27:07,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:07,339 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 20:27:07,340 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 20:27:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:07,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 20:27:07,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:07,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:07,465 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:07,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1677374491] [2024-11-05 20:27:07,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1677374491] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:07,465 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:07,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2024-11-05 20:27:07,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101531994] [2024-11-05 20:27:07,465 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:07,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 20:27:07,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:07,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 20:27:07,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-05 20:27:07,466 INFO L87 Difference]: Start difference. First operand 434 states and 647 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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 20:27:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:07,816 INFO L93 Difference]: Finished difference Result 1149 states and 1796 transitions. [2024-11-05 20:27:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 20:27:07,817 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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) Word has length 28 [2024-11-05 20:27:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:07,821 INFO L225 Difference]: With dead ends: 1149 [2024-11-05 20:27:07,821 INFO L226 Difference]: Without dead ends: 962 [2024-11-05 20:27:07,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-05 20:27:07,822 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 565 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:07,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 405 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 20:27:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-11-05 20:27:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 829. [2024-11-05 20:27:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 1.4516908212560387) internal successors, (1202), 828 states have internal predecessors, (1202), 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 20:27:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1202 transitions. [2024-11-05 20:27:07,847 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1202 transitions. Word has length 28 [2024-11-05 20:27:07,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:07,847 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1202 transitions. [2024-11-05 20:27:07,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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 20:27:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1202 transitions. [2024-11-05 20:27:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-05 20:27:07,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:07,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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 20:27:07,854 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 20:27:08,051 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 20:27:08,051 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:08,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:08,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1970910225, now seen corresponding path program 1 times [2024-11-05 20:27:08,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:08,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [52749219] [2024-11-05 20:27:08,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:08,052 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 20:27:08,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:08,055 INFO L229 MonitoredProcess]: Starting monitored process 8 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 20:27:08,055 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 (8)] Waiting until timeout for monitored process [2024-11-05 20:27:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:08,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:27:08,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:08,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:08,136 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:08,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [52749219] [2024-11-05 20:27:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [52749219] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:08,136 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:08,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:27:08,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916149377] [2024-11-05 20:27:08,136 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:08,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:27:08,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:08,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:27:08,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:27:08,137 INFO L87 Difference]: Start difference. First operand 829 states and 1202 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 20:27:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:08,247 INFO L93 Difference]: Finished difference Result 1774 states and 2591 transitions. [2024-11-05 20:27:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:27:08,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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) Word has length 31 [2024-11-05 20:27:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:08,250 INFO L225 Difference]: With dead ends: 1774 [2024-11-05 20:27:08,251 INFO L226 Difference]: Without dead ends: 1056 [2024-11-05 20:27:08,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:27:08,252 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:08,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 82 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:27:08,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2024-11-05 20:27:08,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 966. [2024-11-05 20:27:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 1.38860103626943) internal successors, (1340), 965 states have internal predecessors, (1340), 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 20:27:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1340 transitions. [2024-11-05 20:27:08,276 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1340 transitions. Word has length 31 [2024-11-05 20:27:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:08,276 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1340 transitions. [2024-11-05 20:27:08,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 20:27:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1340 transitions. [2024-11-05 20:27:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-05 20:27:08,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:08,277 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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 20:27:08,284 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 (8)] Forceful destruction successful, exit code 0 [2024-11-05 20:27:08,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 20:27:08,478 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:08,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:08,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2075339537, now seen corresponding path program 1 times [2024-11-05 20:27:08,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:08,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [480768790] [2024-11-05 20:27:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:08,479 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 20:27:08,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:08,481 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:08,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-05 20:27:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:08,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:27:08,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:08,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:08,538 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:08,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [480768790] [2024-11-05 20:27:08,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [480768790] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:08,538 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:08,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:27:08,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429253568] [2024-11-05 20:27:08,539 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:08,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:27:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:08,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:27:08,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:27:08,539 INFO L87 Difference]: Start difference. First operand 966 states and 1340 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 20:27:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:08,568 INFO L93 Difference]: Finished difference Result 1291 states and 1768 transitions. [2024-11-05 20:27:08,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:27:08,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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) Word has length 31 [2024-11-05 20:27:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:08,571 INFO L225 Difference]: With dead ends: 1291 [2024-11-05 20:27:08,571 INFO L226 Difference]: Without dead ends: 1275 [2024-11-05 20:27:08,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:27:08,572 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 4 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:08,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 180 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:27:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2024-11-05 20:27:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1205. [2024-11-05 20:27:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1204 states have (on average 1.3770764119601329) internal successors, (1658), 1204 states have internal predecessors, (1658), 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 20:27:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1658 transitions. [2024-11-05 20:27:08,600 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1658 transitions. Word has length 31 [2024-11-05 20:27:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:08,600 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1658 transitions. [2024-11-05 20:27:08,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 20:27:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1658 transitions. [2024-11-05 20:27:08,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-05 20:27:08,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:08,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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 20:27:08,604 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 (9)] Ended with exit code 0 [2024-11-05 20:27:08,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:08,804 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:08,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:08,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1961462321, now seen corresponding path program 1 times [2024-11-05 20:27:08,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:08,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1098832243] [2024-11-05 20:27:08,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:08,805 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 20:27:08,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:08,808 INFO L229 MonitoredProcess]: Starting monitored process 10 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 20:27:08,809 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 (10)] Waiting until timeout for monitored process [2024-11-05 20:27:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:08,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:27:08,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:08,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:08,992 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:08,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1098832243] [2024-11-05 20:27:08,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1098832243] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:27:08,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:27:08,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-05 20:27:08,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947333916] [2024-11-05 20:27:08,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:27:08,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 20:27:08,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:08,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 20:27:08,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:27:08,993 INFO L87 Difference]: Start difference. First operand 1205 states and 1658 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 20:27:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:09,436 INFO L93 Difference]: Finished difference Result 2859 states and 3977 transitions. [2024-11-05 20:27:09,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-05 20:27:09,437 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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) Word has length 31 [2024-11-05 20:27:09,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:09,443 INFO L225 Difference]: With dead ends: 2859 [2024-11-05 20:27:09,443 INFO L226 Difference]: Without dead ends: 2061 [2024-11-05 20:27:09,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2024-11-05 20:27:09,447 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 560 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:09,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 197 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 20:27:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2024-11-05 20:27:09,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1690. [2024-11-05 20:27:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1689 states have (on average 1.384251036116045) internal successors, (2338), 1689 states have internal predecessors, (2338), 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 20:27:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2338 transitions. [2024-11-05 20:27:09,495 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2338 transitions. Word has length 31 [2024-11-05 20:27:09,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:09,496 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 2338 transitions. [2024-11-05 20:27:09,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 20:27:09,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2338 transitions. [2024-11-05 20:27:09,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-05 20:27:09,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:09,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:09,499 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 (10)] Ended with exit code 0 [2024-11-05 20:27:09,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 20:27:09,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:09,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:09,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1135027793, now seen corresponding path program 1 times [2024-11-05 20:27:09,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:09,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [745794768] [2024-11-05 20:27:09,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:09,700 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 20:27:09,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:09,702 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:09,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-05 20:27:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:09,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:27:09,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:09,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:09,855 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:09,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [745794768] [2024-11-05 20:27:09,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [745794768] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:27:09,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:27:09,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-05 20:27:09,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254487469] [2024-11-05 20:27:09,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:09,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:27:09,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:09,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:27:09,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:27:09,856 INFO L87 Difference]: Start difference. First operand 1690 states and 2338 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 20:27:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:10,031 INFO L93 Difference]: Finished difference Result 2186 states and 3036 transitions. [2024-11-05 20:27:10,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:27:10,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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) Word has length 32 [2024-11-05 20:27:10,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:10,036 INFO L225 Difference]: With dead ends: 2186 [2024-11-05 20:27:10,036 INFO L226 Difference]: Without dead ends: 1723 [2024-11-05 20:27:10,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:27:10,038 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 92 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:10,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 227 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:27:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2024-11-05 20:27:10,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1699. [2024-11-05 20:27:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1698 states have (on average 1.3657243816254416) internal successors, (2319), 1698 states have internal predecessors, (2319), 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 20:27:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2319 transitions. [2024-11-05 20:27:10,078 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2319 transitions. Word has length 32 [2024-11-05 20:27:10,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:10,078 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2319 transitions. [2024-11-05 20:27:10,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 20:27:10,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2319 transitions. [2024-11-05 20:27:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-05 20:27:10,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:10,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:10,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-05 20:27:10,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:10,281 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:10,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:10,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2055171256, now seen corresponding path program 1 times [2024-11-05 20:27:10,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:10,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [943759805] [2024-11-05 20:27:10,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:10,282 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 20:27:10,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:10,285 INFO L229 MonitoredProcess]: Starting monitored process 12 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 20:27:10,286 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 (12)] Waiting until timeout for monitored process [2024-11-05 20:27:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:10,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:27:10,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:10,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:10,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:10,373 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:10,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [943759805] [2024-11-05 20:27:10,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [943759805] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:10,373 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:10,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 20:27:10,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889441848] [2024-11-05 20:27:10,373 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:10,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:27:10,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:10,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:27:10,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:27:10,374 INFO L87 Difference]: Start difference. First operand 1699 states and 2319 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 20:27:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:10,598 INFO L93 Difference]: Finished difference Result 4415 states and 6250 transitions. [2024-11-05 20:27:10,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:27:10,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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) Word has length 33 [2024-11-05 20:27:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:10,606 INFO L225 Difference]: With dead ends: 4415 [2024-11-05 20:27:10,606 INFO L226 Difference]: Without dead ends: 3007 [2024-11-05 20:27:10,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:27:10,608 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 185 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:10,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 67 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:27:10,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-11-05 20:27:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2669. [2024-11-05 20:27:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2668 states have (on average 1.3875562218890554) internal successors, (3702), 2668 states have internal predecessors, (3702), 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 20:27:10,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 3702 transitions. [2024-11-05 20:27:10,699 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 3702 transitions. Word has length 33 [2024-11-05 20:27:10,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:10,699 INFO L471 AbstractCegarLoop]: Abstraction has 2669 states and 3702 transitions. [2024-11-05 20:27:10,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 20:27:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 3702 transitions. [2024-11-05 20:27:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-05 20:27:10,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:10,702 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:10,708 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 (12)] Ended with exit code 0 [2024-11-05 20:27:10,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 20:27:10,902 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:10,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:10,903 INFO L85 PathProgramCache]: Analyzing trace with hash 945650591, now seen corresponding path program 1 times [2024-11-05 20:27:10,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:10,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1578106536] [2024-11-05 20:27:10,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:10,903 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 20:27:10,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:10,904 INFO L229 MonitoredProcess]: Starting monitored process 13 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 20:27:10,905 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 (13)] Waiting until timeout for monitored process [2024-11-05 20:27:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:10,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-05 20:27:10,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 20:27:12,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 20:27:13,753 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:13,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1578106536] [2024-11-05 20:27:13,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1578106536] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:27:13,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:27:13,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2024-11-05 20:27:13,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208721239] [2024-11-05 20:27:13,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:27:13,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-05 20:27:13,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:13,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-05 20:27:13,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2024-11-05 20:27:13,755 INFO L87 Difference]: Start difference. First operand 2669 states and 3702 transitions. Second operand has 38 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 38 states have internal predecessors, (100), 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 20:27:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:20,058 INFO L93 Difference]: Finished difference Result 4517 states and 6242 transitions. [2024-11-05 20:27:20,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-05 20:27:20,058 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 38 states have internal predecessors, (100), 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) Word has length 51 [2024-11-05 20:27:20,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:20,068 INFO L225 Difference]: With dead ends: 4517 [2024-11-05 20:27:20,069 INFO L226 Difference]: Without dead ends: 4203 [2024-11-05 20:27:20,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1921, Invalid=5911, Unknown=0, NotChecked=0, Total=7832 [2024-11-05 20:27:20,072 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 1529 mSDsluCounter, 5866 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 6232 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:20,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1529 Valid, 6232 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-05 20:27:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2024-11-05 20:27:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3228. [2024-11-05 20:27:20,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3228 states, 3227 states have (on average 1.3796095444685466) internal successors, (4452), 3227 states have internal predecessors, (4452), 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 20:27:20,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3228 states to 3228 states and 4452 transitions. [2024-11-05 20:27:20,216 INFO L78 Accepts]: Start accepts. Automaton has 3228 states and 4452 transitions. Word has length 51 [2024-11-05 20:27:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:20,217 INFO L471 AbstractCegarLoop]: Abstraction has 3228 states and 4452 transitions. [2024-11-05 20:27:20,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6315789473684212) internal successors, (100), 38 states have internal predecessors, (100), 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 20:27:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3228 states and 4452 transitions. [2024-11-05 20:27:20,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-05 20:27:20,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:20,219 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:20,222 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 (13)] Forceful destruction successful, exit code 0 [2024-11-05 20:27:20,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 20:27:20,420 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:20,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:20,420 INFO L85 PathProgramCache]: Analyzing trace with hash -65466659, now seen corresponding path program 1 times [2024-11-05 20:27:20,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:20,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [988630937] [2024-11-05 20:27:20,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:20,420 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 20:27:20,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:20,422 INFO L229 MonitoredProcess]: Starting monitored process 14 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 20:27:20,422 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 (14)] Waiting until timeout for monitored process [2024-11-05 20:27:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:20,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:27:20,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-05 20:27:20,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-05 20:27:20,515 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:20,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [988630937] [2024-11-05 20:27:20,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [988630937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:27:20,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:27:20,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-05 20:27:20,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221955047] [2024-11-05 20:27:20,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:27:20,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 20:27:20,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:20,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 20:27:20,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 20:27:20,516 INFO L87 Difference]: Start difference. First operand 3228 states and 4452 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 20:27:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:20,735 INFO L93 Difference]: Finished difference Result 6514 states and 8959 transitions. [2024-11-05 20:27:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:27:20,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) Word has length 51 [2024-11-05 20:27:20,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:20,743 INFO L225 Difference]: With dead ends: 6514 [2024-11-05 20:27:20,744 INFO L226 Difference]: Without dead ends: 3327 [2024-11-05 20:27:20,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 20:27:20,748 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 52 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:20,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 95 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:27:20,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3327 states. [2024-11-05 20:27:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3327 to 3050. [2024-11-05 20:27:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3050 states, 3049 states have (on average 1.337159724499836) internal successors, (4077), 3049 states have internal predecessors, (4077), 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 20:27:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 4077 transitions. [2024-11-05 20:27:20,867 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 4077 transitions. Word has length 51 [2024-11-05 20:27:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:20,867 INFO L471 AbstractCegarLoop]: Abstraction has 3050 states and 4077 transitions. [2024-11-05 20:27:20,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 20:27:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 4077 transitions. [2024-11-05 20:27:20,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-05 20:27:20,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:20,869 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:20,875 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 (14)] Forceful destruction successful, exit code 0 [2024-11-05 20:27:21,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 20:27:21,071 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:21,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:21,072 INFO L85 PathProgramCache]: Analyzing trace with hash 592562209, now seen corresponding path program 1 times [2024-11-05 20:27:21,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:21,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1319567655] [2024-11-05 20:27:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:21,072 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 20:27:21,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:21,073 INFO L229 MonitoredProcess]: Starting monitored process 15 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 20:27:21,074 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 (15)] Waiting until timeout for monitored process [2024-11-05 20:27:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:21,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 20:27:21,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-05 20:27:21,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-05 20:27:21,236 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:21,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1319567655] [2024-11-05 20:27:21,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1319567655] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:27:21,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:27:21,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-11-05 20:27:21,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170012540] [2024-11-05 20:27:21,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:21,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 20:27:21,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:21,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 20:27:21,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-05 20:27:21,237 INFO L87 Difference]: Start difference. First operand 3050 states and 4077 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 20:27:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:21,411 INFO L93 Difference]: Finished difference Result 3779 states and 5032 transitions. [2024-11-05 20:27:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 20:27:21,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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) Word has length 51 [2024-11-05 20:27:21,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:21,418 INFO L225 Difference]: With dead ends: 3779 [2024-11-05 20:27:21,418 INFO L226 Difference]: Without dead ends: 3052 [2024-11-05 20:27:21,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-05 20:27:21,419 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 146 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:21,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 396 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:27:21,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2024-11-05 20:27:21,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 3044. [2024-11-05 20:27:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 3043 states have (on average 1.3355241537955964) internal successors, (4064), 3043 states have internal predecessors, (4064), 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 20:27:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 4064 transitions. [2024-11-05 20:27:21,522 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 4064 transitions. Word has length 51 [2024-11-05 20:27:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:21,522 INFO L471 AbstractCegarLoop]: Abstraction has 3044 states and 4064 transitions. [2024-11-05 20:27:21,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 20:27:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 4064 transitions. [2024-11-05 20:27:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-05 20:27:21,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:21,525 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:27:21,533 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 (15)] Ended with exit code 0 [2024-11-05 20:27:21,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 20:27:21,730 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:21,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:21,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1950719985, now seen corresponding path program 1 times [2024-11-05 20:27:21,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:21,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1364926621] [2024-11-05 20:27:21,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:21,731 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 20:27:21,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:21,732 INFO L229 MonitoredProcess]: Starting monitored process 16 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 20:27:21,733 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 (16)] Waiting until timeout for monitored process [2024-11-05 20:27:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 20:27:21,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-05 20:27:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 20:27:21,809 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-05 20:27:21,809 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-05 20:27:21,810 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 20:27:21,813 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 (16)] Forceful destruction successful, exit code 0 [2024-11-05 20:27:22,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 20:27:22,014 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:22,066 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 20:27:22,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 08:27:22 BoogieIcfgContainer [2024-11-05 20:27:22,070 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 20:27:22,071 INFO L158 Benchmark]: Toolchain (without parser) took 18593.46ms. Allocated memory was 185.6MB in the beginning and 380.6MB in the end (delta: 195.0MB). Free memory was 141.8MB in the beginning and 344.7MB in the end (delta: -202.9MB). Peak memory consumption was 174.2MB. Max. memory is 8.0GB. [2024-11-05 20:27:22,071 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 20:27:22,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.55ms. Allocated memory is still 185.6MB. Free memory was 141.8MB in the beginning and 127.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-05 20:27:22,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.58ms. Allocated memory is still 185.6MB. Free memory was 126.8MB in the beginning and 125.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 20:27:22,071 INFO L158 Benchmark]: Boogie Preprocessor took 39.77ms. Allocated memory is still 185.6MB. Free memory was 125.0MB in the beginning and 122.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 20:27:22,072 INFO L158 Benchmark]: RCFGBuilder took 281.41ms. Allocated memory is still 185.6MB. Free memory was 122.6MB in the beginning and 105.4MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-05 20:27:22,072 INFO L158 Benchmark]: TraceAbstraction took 18001.71ms. Allocated memory was 185.6MB in the beginning and 380.6MB in the end (delta: 195.0MB). Free memory was 104.7MB in the beginning and 344.7MB in the end (delta: -240.0MB). Peak memory consumption was 137.5MB. Max. memory is 8.0GB. [2024-11-05 20:27:22,073 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.09ms. Allocated memory is still 185.6MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.55ms. Allocated memory is still 185.6MB. Free memory was 141.8MB in the beginning and 127.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.58ms. Allocated memory is still 185.6MB. Free memory was 126.8MB in the beginning and 125.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.77ms. Allocated memory is still 185.6MB. Free memory was 125.0MB in the beginning and 122.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 281.41ms. Allocated memory is still 185.6MB. Free memory was 122.6MB in the beginning and 105.4MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 18001.71ms. Allocated memory was 185.6MB in the beginning and 380.6MB in the end (delta: 195.0MB). Free memory was 104.7MB in the beginning and 344.7MB in the end (delta: -240.0MB). Peak memory consumption was 137.5MB. 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 - CounterExampleResult [Line: 25]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L124] unsigned int a, b, r; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [L129] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=1] [L68] nb = (unsigned char)4 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L89] COND TRUE i < nb VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L104] i = i + (unsigned char)1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=1, i=1, na=1, nb=1, partial_sum=255, r0=-1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L83] COND FALSE !(i < na) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L89] COND FALSE !(i < nb) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L104] i = i + (unsigned char)1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L107] COND TRUE i < (unsigned char)4 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L108] COND FALSE !(i == (unsigned char)0) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L109] COND FALSE !(i == (unsigned char)1) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L110] COND TRUE i == (unsigned char)2 [L110] r2 = (unsigned char)0 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1, r2=0] [L111] COND FALSE !(i == (unsigned char)3) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1, r2=0] [L113] i = i + (unsigned char)1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L107] COND TRUE i < (unsigned char)4 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L108] COND FALSE !(i == (unsigned char)0) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L109] COND FALSE !(i == (unsigned char)1) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L110] COND FALSE !(i == (unsigned char)2) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L111] COND TRUE i == (unsigned char)3 [L111] r3 = (unsigned char)0 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L113] i = i + (unsigned char)1 VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, i=4, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\result=511, a0=-1, a1=0, a2=0, a3=0, b0=0, b1=0, b2=0, b3=0, partial_sum=1] [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.9s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4990 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4990 mSDsluCounter, 8745 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7578 mSDsCounter, 477 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5914 IncrementalHoareTripleChecker+Invalid, 6391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 477 mSolverCounterUnsat, 1167 mSDtfsCounter, 5914 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 912 GetRequests, 723 SyntacticMatches, 4 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3228occurred in iteration=12, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 3010 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 834 ConstructedInterpolants, 9 QuantifiedInterpolants, 6242 SizeOfPredicates, 13 NumberOfNonLiveVariables, 935 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 28 InterpolantComputations, 20 PerfectInterpolantSequences, 115/148 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-05 20:27:22,093 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...