/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/s3_clnt_3.BV.c.cil-1a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 09:00:44,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 09:00:44,595 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-03 09:00:44,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 09:00:44,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 09:00:44,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 09:00:44,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 09:00:44,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 09:00:44,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 09:00:44,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 09:00:44,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 09:00:44,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 09:00:44,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 09:00:44,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 09:00:44,636 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 09:00:44,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 09:00:44,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 09:00:44,637 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 09:00:44,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 09:00:44,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 09:00:44,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 09:00:44,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 09:00:44,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 09:00:44,642 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 09:00:44,642 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 09:00:44,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 09:00:44,643 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 09:00:44,643 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 09:00:44,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 09:00:44,643 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 09:00:44,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 09:00:44,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 09:00:44,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 09:00:44,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 09:00:44,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 09:00:44,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 09:00:44,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 09:00:44,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 09:00:44,648 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 09:00:44,648 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 09:00:44,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 09:00:44,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 09:00:44,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 09:00:44,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 09:00:44,649 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-03 09:00:44,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 09:00:44,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 09:00:44,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 09:00:44,895 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 09:00:44,895 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 09:00:44,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-1a.c [2024-11-03 09:00:46,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 09:00:46,548 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 09:00:46,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-1a.c [2024-11-03 09:00:46,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70c811673/9d45a70132ea4da0bdc95edf5cd33a77/FLAG1d6e086a8 [2024-11-03 09:00:46,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70c811673/9d45a70132ea4da0bdc95edf5cd33a77 [2024-11-03 09:00:46,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 09:00:46,585 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 09:00:46,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 09:00:46,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 09:00:46,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 09:00:46,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:00:46" (1/1) ... [2024-11-03 09:00:46,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba983a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:46, skipping insertion in model container [2024-11-03 09:00:46,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:00:46" (1/1) ... [2024-11-03 09:00:46,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 09:00:46,857 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/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2024-11-03 09:00:46,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:00:46,880 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 09:00:46,918 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/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2024-11-03 09:00:46,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:00:46,947 INFO L204 MainTranslator]: Completed translation [2024-11-03 09:00:46,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:46 WrapperNode [2024-11-03 09:00:46,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 09:00:46,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 09:00:46,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 09:00:46,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 09:00:46,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:46" (1/1) ... [2024-11-03 09:00:46,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:46" (1/1) ... [2024-11-03 09:00:46,996 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 474 [2024-11-03 09:00:46,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 09:00:46,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 09:00:46,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 09:00:46,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 09:00:47,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:46" (1/1) ... [2024-11-03 09:00:47,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:46" (1/1) ... [2024-11-03 09:00:47,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:46" (1/1) ... [2024-11-03 09:00:47,053 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-03 09:00:47,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:46" (1/1) ... [2024-11-03 09:00:47,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:46" (1/1) ... [2024-11-03 09:00:47,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:46" (1/1) ... [2024-11-03 09:00:47,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:46" (1/1) ... [2024-11-03 09:00:47,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:46" (1/1) ... [2024-11-03 09:00:47,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:46" (1/1) ... [2024-11-03 09:00:47,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 09:00:47,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 09:00:47,077 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 09:00:47,077 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 09:00:47,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:46" (1/1) ... [2024-11-03 09:00:47,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 09:00:47,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 09:00:47,113 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-03 09:00:47,115 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-03 09:00:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 09:00:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 09:00:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 09:00:47,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 09:00:47,274 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 09:00:47,276 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 09:00:47,302 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-03 09:00:47,863 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2024-11-03 09:00:47,863 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2024-11-03 09:00:47,914 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-03 09:00:47,914 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 09:00:47,928 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 09:00:47,929 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 09:00:47,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:00:47 BoogieIcfgContainer [2024-11-03 09:00:47,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 09:00:47,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 09:00:47,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 09:00:47,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 09:00:47,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 09:00:46" (1/3) ... [2024-11-03 09:00:47,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344d5606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:00:47, skipping insertion in model container [2024-11-03 09:00:47,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:46" (2/3) ... [2024-11-03 09:00:47,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344d5606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:00:47, skipping insertion in model container [2024-11-03 09:00:47,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:00:47" (3/3) ... [2024-11-03 09:00:47,940 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2024-11-03 09:00:47,955 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 09:00:47,956 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 09:00:48,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 09:00:48,040 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;@19040542, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 09:00:48,040 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 09:00:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 125 states have internal predecessors, (215), 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-03 09:00:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-03 09:00:48,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:48,053 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] [2024-11-03 09:00:48,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:48,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:48,058 INFO L85 PathProgramCache]: Analyzing trace with hash 259999105, now seen corresponding path program 1 times [2024-11-03 09:00:48,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:48,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [901468197] [2024-11-03 09:00:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:48,067 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-03 09:00:48,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:48,068 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-03 09:00:48,070 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-03 09:00:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:48,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:48,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:48,195 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-03 09:00:48,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:48,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-03 09:00:48,225 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:48,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [901468197] [2024-11-03 09:00:48,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [901468197] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:48,226 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:48,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:48,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946704169] [2024-11-03 09:00:48,230 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:48,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:48,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:48,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:48,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:48,253 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 125 states have internal predecessors, (215), 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 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-03 09:00:48,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:48,434 INFO L93 Difference]: Finished difference Result 247 states and 423 transitions. [2024-11-03 09:00:48,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:48,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2024-11-03 09:00:48,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:48,447 INFO L225 Difference]: With dead ends: 247 [2024-11-03 09:00:48,448 INFO L226 Difference]: Without dead ends: 113 [2024-11-03 09:00:48,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:48,457 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 7 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:48,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 320 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:00:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-03 09:00:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-03 09:00:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.5267857142857142) internal successors, (171), 112 states have internal predecessors, (171), 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-03 09:00:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2024-11-03 09:00:48,499 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 25 [2024-11-03 09:00:48,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:48,499 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 171 transitions. [2024-11-03 09:00:48,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-03 09:00:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 171 transitions. [2024-11-03 09:00:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-03 09:00:48,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:48,501 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-03 09:00:48,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:48,704 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-03 09:00:48,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:48,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1138040513, now seen corresponding path program 1 times [2024-11-03 09:00:48,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:48,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [646868447] [2024-11-03 09:00:48,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:48,706 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-03 09:00:48,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:48,709 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-03 09:00:48,711 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-03 09:00:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:48,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:48,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:48,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:48,854 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:48,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [646868447] [2024-11-03 09:00:48,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [646868447] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:48,854 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:48,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:48,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131775643] [2024-11-03 09:00:48,855 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:48,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:48,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:48,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:48,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:48,860 INFO L87 Difference]: Start difference. First operand 113 states and 171 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-03 09:00:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:49,050 INFO L93 Difference]: Finished difference Result 230 states and 352 transitions. [2024-11-03 09:00:49,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:49,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2024-11-03 09:00:49,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:49,052 INFO L225 Difference]: With dead ends: 230 [2024-11-03 09:00:49,052 INFO L226 Difference]: Without dead ends: 128 [2024-11-03 09:00:49,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:49,056 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 9 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:49,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 242 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:00:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-03 09:00:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-03 09:00:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.5039370078740157) internal successors, (191), 127 states have internal predecessors, (191), 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-03 09:00:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2024-11-03 09:00:49,076 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 37 [2024-11-03 09:00:49,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:49,076 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2024-11-03 09:00:49,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-03 09:00:49,076 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2024-11-03 09:00:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-03 09:00:49,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:49,078 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-03 09:00:49,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:49,281 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-03 09:00:49,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:49,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:49,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1126420040, now seen corresponding path program 1 times [2024-11-03 09:00:49,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:49,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2143564525] [2024-11-03 09:00:49,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:49,283 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-03 09:00:49,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:49,287 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-03 09:00:49,288 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-03 09:00:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:49,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:49,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-03 09:00:49,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-03 09:00:49,499 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:49,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2143564525] [2024-11-03 09:00:49,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2143564525] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:49,500 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:49,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:49,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084587825] [2024-11-03 09:00:49,500 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:49,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:49,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:49,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:49,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:49,502 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-03 09:00:49,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:49,525 INFO L93 Difference]: Finished difference Result 271 states and 400 transitions. [2024-11-03 09:00:49,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:49,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-03 09:00:49,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:49,529 INFO L225 Difference]: With dead ends: 271 [2024-11-03 09:00:49,529 INFO L226 Difference]: Without dead ends: 154 [2024-11-03 09:00:49,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:49,531 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 21 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 311 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-03 09:00:49,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 311 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-03 09:00:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-03 09:00:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 153 states have internal predecessors, (224), 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-03 09:00:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2024-11-03 09:00:49,542 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 51 [2024-11-03 09:00:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:49,542 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2024-11-03 09:00:49,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-03 09:00:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2024-11-03 09:00:49,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-03 09:00:49,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:49,544 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-03 09:00:49,547 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-03 09:00:49,746 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-03 09:00:49,747 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:49,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:49,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1260433546, now seen corresponding path program 1 times [2024-11-03 09:00:49,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:49,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [953074824] [2024-11-03 09:00:49,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:49,748 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-03 09:00:49,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:49,752 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-03 09:00:49,753 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-03 09:00:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:49,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:49,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-03 09:00:49,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-03 09:00:49,895 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:49,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [953074824] [2024-11-03 09:00:49,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [953074824] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:49,895 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:49,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:49,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103271289] [2024-11-03 09:00:49,896 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:49,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:49,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:49,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:49,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:49,898 INFO L87 Difference]: Start difference. First operand 154 states and 224 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-03 09:00:50,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:50,048 INFO L93 Difference]: Finished difference Result 288 states and 429 transitions. [2024-11-03 09:00:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:50,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-03 09:00:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:50,050 INFO L225 Difference]: With dead ends: 288 [2024-11-03 09:00:50,050 INFO L226 Difference]: Without dead ends: 171 [2024-11-03 09:00:50,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:50,052 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:50,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 255 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:00:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-03 09:00:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-03 09:00:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.4470588235294117) internal successors, (246), 170 states have internal predecessors, (246), 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-03 09:00:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 246 transitions. [2024-11-03 09:00:50,071 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 246 transitions. Word has length 51 [2024-11-03 09:00:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:50,071 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 246 transitions. [2024-11-03 09:00:50,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-03 09:00:50,072 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 246 transitions. [2024-11-03 09:00:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-03 09:00:50,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:50,075 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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-03 09:00:50,082 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-03 09:00:50,276 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-03 09:00:50,276 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:50,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:50,277 INFO L85 PathProgramCache]: Analyzing trace with hash -457628469, now seen corresponding path program 1 times [2024-11-03 09:00:50,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:50,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [216382871] [2024-11-03 09:00:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:50,278 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-03 09:00:50,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:50,281 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-03 09:00:50,282 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-03 09:00:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:50,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 09:00:50,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 09:00:50,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 09:00:50,796 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:50,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [216382871] [2024-11-03 09:00:50,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [216382871] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:00:50,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:00:50,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-03 09:00:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712041126] [2024-11-03 09:00:50,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:00:50,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 09:00:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:50,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 09:00:50,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-03 09:00:50,798 INFO L87 Difference]: Start difference. First operand 171 states and 246 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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-03 09:00:51,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:51,304 INFO L93 Difference]: Finished difference Result 556 states and 838 transitions. [2024-11-03 09:00:51,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-03 09:00:51,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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 68 [2024-11-03 09:00:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:51,307 INFO L225 Difference]: With dead ends: 556 [2024-11-03 09:00:51,307 INFO L226 Difference]: Without dead ends: 421 [2024-11-03 09:00:51,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-03 09:00:51,308 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 280 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:51,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 495 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-03 09:00:51,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-03 09:00:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 419. [2024-11-03 09:00:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.4521531100478469) internal successors, (607), 418 states have internal predecessors, (607), 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-03 09:00:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 607 transitions. [2024-11-03 09:00:51,340 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 607 transitions. Word has length 68 [2024-11-03 09:00:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:51,343 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 607 transitions. [2024-11-03 09:00:51,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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-03 09:00:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 607 transitions. [2024-11-03 09:00:51,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-03 09:00:51,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:51,346 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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-03 09:00:51,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:51,546 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-03 09:00:51,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:51,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:51,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2031900493, now seen corresponding path program 1 times [2024-11-03 09:00:51,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:51,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265302777] [2024-11-03 09:00:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:51,548 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-03 09:00:51,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:51,549 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-03 09:00:51,550 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-03 09:00:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:51,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:51,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 09:00:51,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:51,747 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 09:00:51,747 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:51,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265302777] [2024-11-03 09:00:51,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [265302777] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:51,748 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:51,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:51,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175618159] [2024-11-03 09:00:51,748 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:51,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:51,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:51,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:51,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:51,749 INFO L87 Difference]: Start difference. First operand 419 states and 607 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-03 09:00:51,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:51,777 INFO L93 Difference]: Finished difference Result 927 states and 1364 transitions. [2024-11-03 09:00:51,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:51,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 68 [2024-11-03 09:00:51,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:51,780 INFO L225 Difference]: With dead ends: 927 [2024-11-03 09:00:51,780 INFO L226 Difference]: Without dead ends: 574 [2024-11-03 09:00:51,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:51,782 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 124 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:51,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 323 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-03 09:00:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 572. [2024-11-03 09:00:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 1.4623467600700526) internal successors, (835), 571 states have internal predecessors, (835), 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-03 09:00:51,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 835 transitions. [2024-11-03 09:00:51,806 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 835 transitions. Word has length 68 [2024-11-03 09:00:51,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:51,806 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 835 transitions. [2024-11-03 09:00:51,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-03 09:00:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 835 transitions. [2024-11-03 09:00:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-03 09:00:51,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:51,809 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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-03 09:00:51,813 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 (7)] Ended with exit code 0 [2024-11-03 09:00:52,010 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-03 09:00:52,010 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:52,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:52,011 INFO L85 PathProgramCache]: Analyzing trace with hash -875025075, now seen corresponding path program 1 times [2024-11-03 09:00:52,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:52,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1664334778] [2024-11-03 09:00:52,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:52,011 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-03 09:00:52,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:52,012 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-03 09:00:52,013 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-03 09:00:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:52,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:52,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 09:00:52,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 09:00:52,214 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:52,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1664334778] [2024-11-03 09:00:52,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1664334778] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:52,215 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:52,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:52,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867170374] [2024-11-03 09:00:52,215 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:52,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:52,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:52,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:52,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:52,216 INFO L87 Difference]: Start difference. First operand 572 states and 835 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-03 09:00:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:52,239 INFO L93 Difference]: Finished difference Result 576 states and 837 transitions. [2024-11-03 09:00:52,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:52,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 68 [2024-11-03 09:00:52,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:52,241 INFO L225 Difference]: With dead ends: 576 [2024-11-03 09:00:52,241 INFO L226 Difference]: Without dead ends: 419 [2024-11-03 09:00:52,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:52,243 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 122 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:52,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 399 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-03 09:00:52,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2024-11-03 09:00:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.4375) internal successors, (598), 416 states have internal predecessors, (598), 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-03 09:00:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 598 transitions. [2024-11-03 09:00:52,258 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 598 transitions. Word has length 68 [2024-11-03 09:00:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:52,259 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 598 transitions. [2024-11-03 09:00:52,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-03 09:00:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 598 transitions. [2024-11-03 09:00:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-03 09:00:52,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:52,260 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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-03 09:00:52,264 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 (8)] Ended with exit code 0 [2024-11-03 09:00:52,463 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-03 09:00:52,464 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:52,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:52,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1614503887, now seen corresponding path program 1 times [2024-11-03 09:00:52,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:52,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1551723166] [2024-11-03 09:00:52,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:52,465 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-03 09:00:52,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:52,466 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-03 09:00:52,467 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-03 09:00:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:52,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 09:00:52,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-03 09:00:52,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-03 09:00:52,805 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:52,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1551723166] [2024-11-03 09:00:52,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1551723166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:00:52,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:00:52,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-03 09:00:52,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23245099] [2024-11-03 09:00:52,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:00:52,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-03 09:00:52,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:52,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-03 09:00:52,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-03 09:00:52,806 INFO L87 Difference]: Start difference. First operand 417 states and 598 transitions. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 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-03 09:00:53,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:53,289 INFO L93 Difference]: Finished difference Result 636 states and 943 transitions. [2024-11-03 09:00:53,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-03 09:00:53,290 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 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 68 [2024-11-03 09:00:53,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:53,292 INFO L225 Difference]: With dead ends: 636 [2024-11-03 09:00:53,292 INFO L226 Difference]: Without dead ends: 480 [2024-11-03 09:00:53,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-03 09:00:53,293 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 506 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:53,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1211 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-03 09:00:53,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-03 09:00:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2024-11-03 09:00:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.4042105263157896) internal successors, (667), 475 states have internal predecessors, (667), 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-03 09:00:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 667 transitions. [2024-11-03 09:00:53,306 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 667 transitions. Word has length 68 [2024-11-03 09:00:53,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:53,306 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 667 transitions. [2024-11-03 09:00:53,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 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-03 09:00:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 667 transitions. [2024-11-03 09:00:53,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-03 09:00:53,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:53,308 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2024-11-03 09:00:53,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:53,511 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-03 09:00:53,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:53,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:53,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1844660206, now seen corresponding path program 1 times [2024-11-03 09:00:53,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:53,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1042901054] [2024-11-03 09:00:53,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:53,513 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-03 09:00:53,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:53,514 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-03 09:00:53,515 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-03 09:00:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:53,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:53,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-03 09:00:53,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-03 09:00:53,622 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:53,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1042901054] [2024-11-03 09:00:53,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1042901054] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:53,622 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:53,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:53,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031460235] [2024-11-03 09:00:53,622 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:53,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:53,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:53,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:53,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:53,624 INFO L87 Difference]: Start difference. First operand 476 states and 667 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-03 09:00:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:53,750 INFO L93 Difference]: Finished difference Result 928 states and 1325 transitions. [2024-11-03 09:00:53,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:53,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 85 [2024-11-03 09:00:53,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:53,753 INFO L225 Difference]: With dead ends: 928 [2024-11-03 09:00:53,753 INFO L226 Difference]: Without dead ends: 518 [2024-11-03 09:00:53,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:53,754 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 9 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:53,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 259 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:00:53,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-03 09:00:53,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2024-11-03 09:00:53,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 1.390715667311412) internal successors, (719), 517 states have internal predecessors, (719), 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-03 09:00:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 719 transitions. [2024-11-03 09:00:53,780 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 719 transitions. Word has length 85 [2024-11-03 09:00:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:53,780 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 719 transitions. [2024-11-03 09:00:53,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-03 09:00:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 719 transitions. [2024-11-03 09:00:53,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-03 09:00:53,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:53,782 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1] [2024-11-03 09:00:53,786 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-03 09:00:53,985 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-03 09:00:53,986 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:53,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:53,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2022672797, now seen corresponding path program 1 times [2024-11-03 09:00:53,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:53,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [467066078] [2024-11-03 09:00:53,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:53,986 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-03 09:00:53,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:53,989 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-03 09:00:53,990 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-03 09:00:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:54,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:54,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-03 09:00:54,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-03 09:00:54,174 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:54,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [467066078] [2024-11-03 09:00:54,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [467066078] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:54,175 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:54,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:00:54,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470919701] [2024-11-03 09:00:54,175 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:54,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:00:54,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:54,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:00:54,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:54,176 INFO L87 Difference]: Start difference. First operand 518 states and 719 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-03 09:00:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:54,230 INFO L93 Difference]: Finished difference Result 1468 states and 2046 transitions. [2024-11-03 09:00:54,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:00:54,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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 104 [2024-11-03 09:00:54,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:54,239 INFO L225 Difference]: With dead ends: 1468 [2024-11-03 09:00:54,239 INFO L226 Difference]: Without dead ends: 1016 [2024-11-03 09:00:54,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 204 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-03 09:00:54,241 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 259 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:54,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 385 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-11-03 09:00:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2024-11-03 09:00:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1015 states have (on average 1.3773399014778325) internal successors, (1398), 1015 states have internal predecessors, (1398), 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-03 09:00:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1398 transitions. [2024-11-03 09:00:54,271 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1398 transitions. Word has length 104 [2024-11-03 09:00:54,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:54,271 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1398 transitions. [2024-11-03 09:00:54,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-03 09:00:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1398 transitions. [2024-11-03 09:00:54,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-03 09:00:54,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:54,273 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1] [2024-11-03 09:00:54,277 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 (11)] Ended with exit code 0 [2024-11-03 09:00:54,477 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-03 09:00:54,478 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:54,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:54,478 INFO L85 PathProgramCache]: Analyzing trace with hash -808954577, now seen corresponding path program 1 times [2024-11-03 09:00:54,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:54,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1693471958] [2024-11-03 09:00:54,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:54,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-03 09:00:54,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:54,482 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-03 09:00:54,483 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-03 09:00:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:54,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:54,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-03 09:00:54,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-03 09:00:54,593 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:54,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1693471958] [2024-11-03 09:00:54,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1693471958] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:54,593 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:54,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:54,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162071893] [2024-11-03 09:00:54,593 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:54,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:54,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:54,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:54,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:54,595 INFO L87 Difference]: Start difference. First operand 1016 states and 1398 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-03 09:00:54,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:54,627 INFO L93 Difference]: Finished difference Result 2008 states and 2767 transitions. [2024-11-03 09:00:54,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:54,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 105 [2024-11-03 09:00:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:54,633 INFO L225 Difference]: With dead ends: 2008 [2024-11-03 09:00:54,633 INFO L226 Difference]: Without dead ends: 1058 [2024-11-03 09:00:54,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:54,635 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 11 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 341 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-03 09:00:54,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 341 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-11-03 09:00:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1058. [2024-11-03 09:00:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1057 states have (on average 1.3736991485335857) internal successors, (1452), 1057 states have internal predecessors, (1452), 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-03 09:00:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1452 transitions. [2024-11-03 09:00:54,661 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1452 transitions. Word has length 105 [2024-11-03 09:00:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:54,662 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1452 transitions. [2024-11-03 09:00:54,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-03 09:00:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1452 transitions. [2024-11-03 09:00:54,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-03 09:00:54,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:54,664 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:54,667 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 (12)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:54,866 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-03 09:00:54,867 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:54,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:54,867 INFO L85 PathProgramCache]: Analyzing trace with hash 557006567, now seen corresponding path program 1 times [2024-11-03 09:00:54,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:54,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1853249601] [2024-11-03 09:00:54,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:54,868 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-03 09:00:54,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:54,869 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-03 09:00:54,870 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-03 09:00:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:54,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:54,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-03 09:00:54,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-03 09:00:55,018 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:55,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1853249601] [2024-11-03 09:00:55,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1853249601] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:55,018 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:55,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:00:55,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103553466] [2024-11-03 09:00:55,018 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:55,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:00:55,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:55,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:00:55,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:55,020 INFO L87 Difference]: Start difference. First operand 1058 states and 1452 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-03 09:00:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:55,101 INFO L93 Difference]: Finished difference Result 2883 states and 4003 transitions. [2024-11-03 09:00:55,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:00:55,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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 106 [2024-11-03 09:00:55,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:55,109 INFO L225 Difference]: With dead ends: 2883 [2024-11-03 09:00:55,109 INFO L226 Difference]: Without dead ends: 1891 [2024-11-03 09:00:55,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 208 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-03 09:00:55,112 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 260 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:55,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 593 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2024-11-03 09:00:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1891. [2024-11-03 09:00:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1890 states have (on average 1.3883597883597885) internal successors, (2624), 1890 states have internal predecessors, (2624), 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-03 09:00:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2624 transitions. [2024-11-03 09:00:55,174 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2624 transitions. Word has length 106 [2024-11-03 09:00:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:55,174 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 2624 transitions. [2024-11-03 09:00:55,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-03 09:00:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2624 transitions. [2024-11-03 09:00:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-03 09:00:55,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:55,178 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 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] [2024-11-03 09:00:55,182 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 (13)] Ended with exit code 0 [2024-11-03 09:00:55,381 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-03 09:00:55,381 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:55,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:55,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2116934414, now seen corresponding path program 1 times [2024-11-03 09:00:55,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:55,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1823538417] [2024-11-03 09:00:55,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:55,382 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-03 09:00:55,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:55,385 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-03 09:00:55,386 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-03 09:00:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:55,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:55,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:55,479 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-03 09:00:55,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-03 09:00:55,501 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:55,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1823538417] [2024-11-03 09:00:55,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1823538417] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:55,501 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:55,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:00:55,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205185068] [2024-11-03 09:00:55,502 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:55,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:00:55,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:55,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:00:55,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:55,504 INFO L87 Difference]: Start difference. First operand 1891 states and 2624 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-03 09:00:55,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:55,721 INFO L93 Difference]: Finished difference Result 3720 states and 5240 transitions. [2024-11-03 09:00:55,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:00:55,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 160 [2024-11-03 09:00:55,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:55,729 INFO L225 Difference]: With dead ends: 3720 [2024-11-03 09:00:55,729 INFO L226 Difference]: Without dead ends: 1895 [2024-11-03 09:00:55,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 316 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-03 09:00:55,733 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 69 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:55,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 255 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:00:55,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2024-11-03 09:00:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1895. [2024-11-03 09:00:55,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1894 states have (on average 1.3632523759239705) internal successors, (2582), 1894 states have internal predecessors, (2582), 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-03 09:00:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2582 transitions. [2024-11-03 09:00:55,790 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2582 transitions. Word has length 160 [2024-11-03 09:00:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:55,790 INFO L471 AbstractCegarLoop]: Abstraction has 1895 states and 2582 transitions. [2024-11-03 09:00:55,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-03 09:00:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2582 transitions. [2024-11-03 09:00:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-03 09:00:55,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:55,794 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 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] [2024-11-03 09:00:55,798 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 (14)] Ended with exit code 0 [2024-11-03 09:00:55,998 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-03 09:00:55,998 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:55,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:55,999 INFO L85 PathProgramCache]: Analyzing trace with hash 81799059, now seen corresponding path program 1 times [2024-11-03 09:00:55,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:55,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [426632266] [2024-11-03 09:00:56,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:56,000 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-03 09:00:56,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:56,003 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-03 09:00:56,005 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-03 09:00:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:56,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:56,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-11-03 09:00:56,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-11-03 09:00:56,135 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:56,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [426632266] [2024-11-03 09:00:56,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [426632266] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:56,135 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:56,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:00:56,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450118790] [2024-11-03 09:00:56,136 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:56,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:00:56,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:56,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:00:56,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:56,137 INFO L87 Difference]: Start difference. First operand 1895 states and 2582 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-03 09:00:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:56,375 INFO L93 Difference]: Finished difference Result 3874 states and 5343 transitions. [2024-11-03 09:00:56,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:00:56,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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 182 [2024-11-03 09:00:56,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:56,383 INFO L225 Difference]: With dead ends: 3874 [2024-11-03 09:00:56,383 INFO L226 Difference]: Without dead ends: 2045 [2024-11-03 09:00:56,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 360 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-03 09:00:56,387 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 72 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:56,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 253 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:00:56,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2024-11-03 09:00:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 2045. [2024-11-03 09:00:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2045 states, 2044 states have (on average 1.3478473581213308) internal successors, (2755), 2044 states have internal predecessors, (2755), 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-03 09:00:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 2755 transitions. [2024-11-03 09:00:56,447 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 2755 transitions. Word has length 182 [2024-11-03 09:00:56,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:56,447 INFO L471 AbstractCegarLoop]: Abstraction has 2045 states and 2755 transitions. [2024-11-03 09:00:56,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-03 09:00:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2755 transitions. [2024-11-03 09:00:56,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-03 09:00:56,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:56,452 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-03 09:00:56,457 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-03 09:00:56,656 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-03 09:00:56,656 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:56,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:56,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1975695098, now seen corresponding path program 1 times [2024-11-03 09:00:56,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:56,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1329708872] [2024-11-03 09:00:56,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:56,657 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-03 09:00:56,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:56,660 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-03 09:00:56,662 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-03 09:00:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:56,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:56,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 452 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-03 09:00:56,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 452 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-03 09:00:56,796 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:56,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1329708872] [2024-11-03 09:00:56,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1329708872] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:56,796 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:56,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:00:56,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542914231] [2024-11-03 09:00:56,796 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:56,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:00:56,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:56,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:00:56,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:56,798 INFO L87 Difference]: Start difference. First operand 2045 states and 2755 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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-03 09:00:57,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:57,010 INFO L93 Difference]: Finished difference Result 4220 states and 5761 transitions. [2024-11-03 09:00:57,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:00:57,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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 219 [2024-11-03 09:00:57,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:57,018 INFO L225 Difference]: With dead ends: 4220 [2024-11-03 09:00:57,018 INFO L226 Difference]: Without dead ends: 2241 [2024-11-03 09:00:57,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 434 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-03 09:00:57,023 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 80 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:57,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 278 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:00:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2024-11-03 09:00:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2241. [2024-11-03 09:00:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 2240 states have (on average 1.3299107142857143) internal successors, (2979), 2240 states have internal predecessors, (2979), 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-03 09:00:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 2979 transitions. [2024-11-03 09:00:57,098 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 2979 transitions. Word has length 219 [2024-11-03 09:00:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:57,099 INFO L471 AbstractCegarLoop]: Abstraction has 2241 states and 2979 transitions. [2024-11-03 09:00:57,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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-03 09:00:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 2979 transitions. [2024-11-03 09:00:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-03 09:00:57,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:57,104 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 09:00:57,108 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 (16)] Ended with exit code 0 [2024-11-03 09:00:57,304 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-03 09:00:57,304 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:57,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:57,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1092826197, now seen corresponding path program 1 times [2024-11-03 09:00:57,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:57,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [43021770] [2024-11-03 09:00:57,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:57,306 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-03 09:00:57,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:57,309 INFO L229 MonitoredProcess]: Starting monitored process 17 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-03 09:00:57,310 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 (17)] Waiting until timeout for monitored process [2024-11-03 09:00:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:57,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:57,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-03 09:00:57,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-03 09:00:57,450 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:57,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [43021770] [2024-11-03 09:00:57,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [43021770] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:57,450 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:57,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:00:57,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305543771] [2024-11-03 09:00:57,451 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:57,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:00:57,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:57,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:00:57,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:57,452 INFO L87 Difference]: Start difference. First operand 2241 states and 2979 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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-03 09:00:57,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:57,673 INFO L93 Difference]: Finished difference Result 4633 states and 6251 transitions. [2024-11-03 09:00:57,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:00:57,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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 220 [2024-11-03 09:00:57,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:57,682 INFO L225 Difference]: With dead ends: 4633 [2024-11-03 09:00:57,683 INFO L226 Difference]: Without dead ends: 2458 [2024-11-03 09:00:57,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 436 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-03 09:00:57,686 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 82 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:57,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 252 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:00:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2458 states. [2024-11-03 09:00:57,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2458 to 2458. [2024-11-03 09:00:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2458 states, 2457 states have (on average 1.312169312169312) internal successors, (3224), 2457 states have internal predecessors, (3224), 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-03 09:00:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 3224 transitions. [2024-11-03 09:00:57,741 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 3224 transitions. Word has length 220 [2024-11-03 09:00:57,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:57,741 INFO L471 AbstractCegarLoop]: Abstraction has 2458 states and 3224 transitions. [2024-11-03 09:00:57,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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-03 09:00:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 3224 transitions. [2024-11-03 09:00:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-03 09:00:57,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:57,747 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:00:57,751 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 (17)] Ended with exit code 0 [2024-11-03 09:00:57,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-03 09:00:57,951 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:57,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1378468762, now seen corresponding path program 1 times [2024-11-03 09:00:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2010816986] [2024-11-03 09:00:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:57,952 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-03 09:00:57,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:57,955 INFO L229 MonitoredProcess]: Starting monitored process 18 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-03 09:00:57,956 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 (18)] Waiting until timeout for monitored process [2024-11-03 09:00:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:58,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:58,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2024-11-03 09:00:58,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2024-11-03 09:00:58,202 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:58,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2010816986] [2024-11-03 09:00:58,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2010816986] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:58,203 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:58,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:00:58,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472865244] [2024-11-03 09:00:58,203 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:58,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:00:58,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:58,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:00:58,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:58,205 INFO L87 Difference]: Start difference. First operand 2458 states and 3224 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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-03 09:00:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:58,319 INFO L93 Difference]: Finished difference Result 9424 states and 12396 transitions. [2024-11-03 09:00:58,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:00:58,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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 261 [2024-11-03 09:00:58,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:58,342 INFO L225 Difference]: With dead ends: 9424 [2024-11-03 09:00:58,342 INFO L226 Difference]: Without dead ends: 7032 [2024-11-03 09:00:58,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 518 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-03 09:00:58,351 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 265 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:58,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 730 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:58,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7032 states. [2024-11-03 09:00:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7032 to 7028. [2024-11-03 09:00:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7028 states, 7027 states have (on average 1.3140742849010958) internal successors, (9234), 7027 states have internal predecessors, (9234), 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-03 09:00:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7028 states to 7028 states and 9234 transitions. [2024-11-03 09:00:58,539 INFO L78 Accepts]: Start accepts. Automaton has 7028 states and 9234 transitions. Word has length 261 [2024-11-03 09:00:58,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:58,539 INFO L471 AbstractCegarLoop]: Abstraction has 7028 states and 9234 transitions. [2024-11-03 09:00:58,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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-03 09:00:58,540 INFO L276 IsEmpty]: Start isEmpty. Operand 7028 states and 9234 transitions. [2024-11-03 09:00:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-03 09:00:58,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:58,551 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:00:58,556 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 (18)] Ended with exit code 0 [2024-11-03 09:00:58,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-03 09:00:58,752 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:58,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:58,753 INFO L85 PathProgramCache]: Analyzing trace with hash 883104488, now seen corresponding path program 1 times [2024-11-03 09:00:58,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:58,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1963023157] [2024-11-03 09:00:58,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:58,753 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-03 09:00:58,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:58,756 INFO L229 MonitoredProcess]: Starting monitored process 19 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-03 09:00:58,758 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 (19)] Waiting until timeout for monitored process [2024-11-03 09:00:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:58,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:58,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-11-03 09:00:58,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-11-03 09:00:58,888 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:58,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1963023157] [2024-11-03 09:00:58,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1963023157] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:58,889 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:58,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:00:58,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598133459] [2024-11-03 09:00:58,890 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:58,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:00:58,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:58,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:00:58,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:58,892 INFO L87 Difference]: Start difference. First operand 7028 states and 9234 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-03 09:00:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:59,171 INFO L93 Difference]: Finished difference Result 14725 states and 19664 transitions. [2024-11-03 09:00:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:00:59,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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 261 [2024-11-03 09:00:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:59,196 INFO L225 Difference]: With dead ends: 14725 [2024-11-03 09:00:59,196 INFO L226 Difference]: Without dead ends: 7763 [2024-11-03 09:00:59,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 518 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-03 09:00:59,205 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 88 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:59,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 266 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:00:59,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7763 states. [2024-11-03 09:00:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7763 to 7763. [2024-11-03 09:00:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7763 states, 7762 states have (on average 1.2951558876578202) internal successors, (10053), 7762 states have internal predecessors, (10053), 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-03 09:00:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7763 states to 7763 states and 10053 transitions. [2024-11-03 09:00:59,409 INFO L78 Accepts]: Start accepts. Automaton has 7763 states and 10053 transitions. Word has length 261 [2024-11-03 09:00:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:59,410 INFO L471 AbstractCegarLoop]: Abstraction has 7763 states and 10053 transitions. [2024-11-03 09:00:59,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-03 09:00:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 7763 states and 10053 transitions. [2024-11-03 09:00:59,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-03 09:00:59,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:59,423 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:00:59,428 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 (19)] Ended with exit code 0 [2024-11-03 09:00:59,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-03 09:00:59,626 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:59,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:59,627 INFO L85 PathProgramCache]: Analyzing trace with hash 991463410, now seen corresponding path program 1 times [2024-11-03 09:00:59,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:59,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [183627187] [2024-11-03 09:00:59,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:59,627 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-03 09:00:59,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:59,628 INFO L229 MonitoredProcess]: Starting monitored process 20 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-03 09:00:59,630 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 (20)] Waiting until timeout for monitored process [2024-11-03 09:00:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:59,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:59,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 639 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2024-11-03 09:00:59,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 639 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2024-11-03 09:00:59,779 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:59,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [183627187] [2024-11-03 09:00:59,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [183627187] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:59,779 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:59,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:00:59,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993764605] [2024-11-03 09:00:59,780 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:59,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:00:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:59,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:00:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:59,782 INFO L87 Difference]: Start difference. First operand 7763 states and 10053 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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-03 09:01:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:00,092 INFO L93 Difference]: Finished difference Result 15691 states and 20413 transitions. [2024-11-03 09:01:00,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:01:00,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 285 [2024-11-03 09:01:00,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:00,111 INFO L225 Difference]: With dead ends: 15691 [2024-11-03 09:01:00,111 INFO L226 Difference]: Without dead ends: 7994 [2024-11-03 09:01:00,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 566 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-03 09:01:00,120 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 94 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:00,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 251 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:01:00,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7994 states. [2024-11-03 09:01:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7994 to 7994. [2024-11-03 09:01:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7994 states, 7993 states have (on average 1.2883773301638934) internal successors, (10298), 7993 states have internal predecessors, (10298), 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-03 09:01:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7994 states to 7994 states and 10298 transitions. [2024-11-03 09:01:00,333 INFO L78 Accepts]: Start accepts. Automaton has 7994 states and 10298 transitions. Word has length 285 [2024-11-03 09:01:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:00,334 INFO L471 AbstractCegarLoop]: Abstraction has 7994 states and 10298 transitions. [2024-11-03 09:01:00,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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-03 09:01:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 7994 states and 10298 transitions. [2024-11-03 09:01:00,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-11-03 09:01:00,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:00,348 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:01:00,353 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 (20)] Ended with exit code 0 [2024-11-03 09:01:00,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-03 09:01:00,552 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:00,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:00,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1946480394, now seen corresponding path program 1 times [2024-11-03 09:01:00,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:00,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [198675566] [2024-11-03 09:01:00,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:00,553 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-03 09:01:00,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:00,554 INFO L229 MonitoredProcess]: Starting monitored process 21 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-03 09:01:00,555 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 (21)] Waiting until timeout for monitored process [2024-11-03 09:01:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:00,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:01:00,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1192 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-03 09:01:00,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1192 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-03 09:01:00,739 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:00,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [198675566] [2024-11-03 09:01:00,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [198675566] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:01:00,740 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:01:00,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:01:00,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415870399] [2024-11-03 09:01:00,740 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:00,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:01:00,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:00,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:01:00,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:01:00,741 INFO L87 Difference]: Start difference. First operand 7994 states and 10298 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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-03 09:01:01,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:01,025 INFO L93 Difference]: Finished difference Result 16699 states and 21834 transitions. [2024-11-03 09:01:01,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:01:01,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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 297 [2024-11-03 09:01:01,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:01,044 INFO L225 Difference]: With dead ends: 16699 [2024-11-03 09:01:01,044 INFO L226 Difference]: Without dead ends: 8771 [2024-11-03 09:01:01,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 590 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-03 09:01:01,055 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 95 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:01,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 203 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:01:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8771 states. [2024-11-03 09:01:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8771 to 8771. [2024-11-03 09:01:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8771 states, 8770 states have (on average 1.272405929304447) internal successors, (11159), 8770 states have internal predecessors, (11159), 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-03 09:01:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8771 states to 8771 states and 11159 transitions. [2024-11-03 09:01:01,284 INFO L78 Accepts]: Start accepts. Automaton has 8771 states and 11159 transitions. Word has length 297 [2024-11-03 09:01:01,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:01,285 INFO L471 AbstractCegarLoop]: Abstraction has 8771 states and 11159 transitions. [2024-11-03 09:01:01,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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-03 09:01:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 8771 states and 11159 transitions. [2024-11-03 09:01:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-03 09:01:01,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:01,295 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:01:01,299 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 (21)] Ended with exit code 0 [2024-11-03 09:01:01,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-03 09:01:01,499 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:01,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:01,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2037361951, now seen corresponding path program 1 times [2024-11-03 09:01:01,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:01,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1109386374] [2024-11-03 09:01:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:01,500 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-03 09:01:01,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:01,503 INFO L229 MonitoredProcess]: Starting monitored process 22 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-03 09:01:01,504 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 (22)] Waiting until timeout for monitored process [2024-11-03 09:01:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:01,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 09:01:01,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-03 09:01:01,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-03 09:01:01,774 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:01,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1109386374] [2024-11-03 09:01:01,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1109386374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:01,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:01,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-03 09:01:01,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213690360] [2024-11-03 09:01:01,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:01,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 09:01:01,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:01,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 09:01:01,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-03 09:01:01,776 INFO L87 Difference]: Start difference. First operand 8771 states and 11159 transitions. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 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-03 09:01:02,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:02,390 INFO L93 Difference]: Finished difference Result 19154 states and 24295 transitions. [2024-11-03 09:01:02,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-03 09:01:02,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 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 344 [2024-11-03 09:01:02,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:02,413 INFO L225 Difference]: With dead ends: 19154 [2024-11-03 09:01:02,414 INFO L226 Difference]: Without dead ends: 10449 [2024-11-03 09:01:02,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 685 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-03 09:01:02,425 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 333 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:02,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 786 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-03 09:01:02,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10449 states. [2024-11-03 09:01:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10449 to 8906. [2024-11-03 09:01:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8906 states, 8905 states have (on average 1.2527793374508702) internal successors, (11156), 8905 states have internal predecessors, (11156), 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-03 09:01:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8906 states to 8906 states and 11156 transitions. [2024-11-03 09:01:02,743 INFO L78 Accepts]: Start accepts. Automaton has 8906 states and 11156 transitions. Word has length 344 [2024-11-03 09:01:02,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:02,743 INFO L471 AbstractCegarLoop]: Abstraction has 8906 states and 11156 transitions. [2024-11-03 09:01:02,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 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-03 09:01:02,744 INFO L276 IsEmpty]: Start isEmpty. Operand 8906 states and 11156 transitions. [2024-11-03 09:01:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-03 09:01:02,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:02,755 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:01:02,760 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 (22)] Forceful destruction successful, exit code 0 [2024-11-03 09:01:02,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-03 09:01:02,956 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:02,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:02,956 INFO L85 PathProgramCache]: Analyzing trace with hash -143012591, now seen corresponding path program 1 times [2024-11-03 09:01:02,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:02,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [77629674] [2024-11-03 09:01:02,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:02,957 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-03 09:01:02,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:02,958 INFO L229 MonitoredProcess]: Starting monitored process 23 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-03 09:01:02,959 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 (23)] Waiting until timeout for monitored process [2024-11-03 09:01:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:03,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:01:03,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 899 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2024-11-03 09:01:03,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:03,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 899 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2024-11-03 09:01:03,133 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:03,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [77629674] [2024-11-03 09:01:03,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [77629674] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:01:03,133 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:01:03,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:01:03,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123718872] [2024-11-03 09:01:03,133 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:03,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:01:03,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:03,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:01:03,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:01:03,135 INFO L87 Difference]: Start difference. First operand 8906 states and 11156 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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-03 09:01:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:03,413 INFO L93 Difference]: Finished difference Result 16646 states and 21090 transitions. [2024-11-03 09:01:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:01:03,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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 410 [2024-11-03 09:01:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:03,426 INFO L225 Difference]: With dead ends: 16646 [2024-11-03 09:01:03,426 INFO L226 Difference]: Without dead ends: 4719 [2024-11-03 09:01:03,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 818 GetRequests, 816 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-03 09:01:03,438 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 101 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:03,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 209 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:01:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states. [2024-11-03 09:01:03,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 4719. [2024-11-03 09:01:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4719 states, 4718 states have (on average 1.2706655362441712) internal successors, (5995), 4718 states have internal predecessors, (5995), 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-03 09:01:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4719 states to 4719 states and 5995 transitions. [2024-11-03 09:01:03,543 INFO L78 Accepts]: Start accepts. Automaton has 4719 states and 5995 transitions. Word has length 410 [2024-11-03 09:01:03,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:03,544 INFO L471 AbstractCegarLoop]: Abstraction has 4719 states and 5995 transitions. [2024-11-03 09:01:03,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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-03 09:01:03,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4719 states and 5995 transitions. [2024-11-03 09:01:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2024-11-03 09:01:03,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:03,552 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 18, 16, 16, 14, 14, 13, 13, 12, 12, 11, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:01:03,558 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 (23)] Ended with exit code 0 [2024-11-03 09:01:03,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-03 09:01:03,753 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:03,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:03,753 INFO L85 PathProgramCache]: Analyzing trace with hash 810788447, now seen corresponding path program 1 times [2024-11-03 09:01:03,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:03,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [261365721] [2024-11-03 09:01:03,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:03,754 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-03 09:01:03,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:03,757 INFO L229 MonitoredProcess]: Starting monitored process 24 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-03 09:01:03,758 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 (24)] Waiting until timeout for monitored process [2024-11-03 09:01:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:03,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:01:03,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2960 backedges. 1450 proven. 0 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2024-11-03 09:01:03,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2960 backedges. 1450 proven. 0 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2024-11-03 09:01:03,961 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:03,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [261365721] [2024-11-03 09:01:03,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [261365721] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:01:03,962 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:01:03,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:01:03,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074188938] [2024-11-03 09:01:03,962 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:03,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:01:03,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:03,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:01:03,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:01:03,964 INFO L87 Difference]: Start difference. First operand 4719 states and 5995 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 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-03 09:01:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:04,214 INFO L93 Difference]: Finished difference Result 9617 states and 12362 transitions. [2024-11-03 09:01:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:01:04,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 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 521 [2024-11-03 09:01:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:04,222 INFO L225 Difference]: With dead ends: 9617 [2024-11-03 09:01:04,222 INFO L226 Difference]: Without dead ends: 4935 [2024-11-03 09:01:04,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1040 GetRequests, 1038 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-03 09:01:04,228 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 82 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:04,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 205 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:01:04,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4935 states. [2024-11-03 09:01:04,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4935 to 4923. [2024-11-03 09:01:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4923 states, 4922 states have (on average 1.2472572125152377) internal successors, (6139), 4922 states have internal predecessors, (6139), 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-03 09:01:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4923 states to 4923 states and 6139 transitions. [2024-11-03 09:01:04,333 INFO L78 Accepts]: Start accepts. Automaton has 4923 states and 6139 transitions. Word has length 521 [2024-11-03 09:01:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:04,333 INFO L471 AbstractCegarLoop]: Abstraction has 4923 states and 6139 transitions. [2024-11-03 09:01:04,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 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-03 09:01:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 4923 states and 6139 transitions. [2024-11-03 09:01:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2024-11-03 09:01:04,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:04,342 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 18, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:01:04,347 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 (24)] Forceful destruction successful, exit code 0 [2024-11-03 09:01:04,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-03 09:01:04,543 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:04,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:04,543 INFO L85 PathProgramCache]: Analyzing trace with hash 630701952, now seen corresponding path program 1 times [2024-11-03 09:01:04,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:04,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1331035253] [2024-11-03 09:01:04,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:04,544 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-03 09:01:04,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:04,547 INFO L229 MonitoredProcess]: Starting monitored process 25 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-03 09:01:04,548 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 (25)] Waiting until timeout for monitored process [2024-11-03 09:01:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:04,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 09:01:04,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3942 backedges. 2057 proven. 14 refuted. 0 times theorem prover too weak. 1871 trivial. 0 not checked. [2024-11-03 09:01:04,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3942 backedges. 2057 proven. 14 refuted. 0 times theorem prover too weak. 1871 trivial. 0 not checked. [2024-11-03 09:01:04,871 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:04,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1331035253] [2024-11-03 09:01:04,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1331035253] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:04,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:04,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-03 09:01:04,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11638039] [2024-11-03 09:01:04,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:04,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 09:01:04,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:04,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 09:01:04,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-03 09:01:04,873 INFO L87 Difference]: Start difference. First operand 4923 states and 6139 transitions. Second operand has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 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-03 09:01:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:05,100 INFO L93 Difference]: Finished difference Result 5158 states and 6438 transitions. [2024-11-03 09:01:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-03 09:01:05,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 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 606 [2024-11-03 09:01:05,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:05,102 INFO L225 Difference]: With dead ends: 5158 [2024-11-03 09:01:05,102 INFO L226 Difference]: Without dead ends: 0 [2024-11-03 09:01:05,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1214 GetRequests, 1208 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-03 09:01:05,106 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 94 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:05,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 279 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 09:01:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-03 09:01:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-03 09:01:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:01:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-03 09:01:05,107 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 606 [2024-11-03 09:01:05,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:05,108 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-03 09:01:05,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 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-03 09:01:05,108 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-03 09:01:05,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-03 09:01:05,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 09:01:05,115 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 (25)] Forceful destruction successful, exit code 0 [2024-11-03 09:01:05,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-03 09:01:05,315 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-03 09:01:05,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-03 09:01:07,381 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 09:01:07,403 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-03 09:01:07,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 09:01:07 BoogieIcfgContainer [2024-11-03 09:01:07,416 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 09:01:07,417 INFO L158 Benchmark]: Toolchain (without parser) took 20832.11ms. Allocated memory was 185.6MB in the beginning and 677.4MB in the end (delta: 491.8MB). Free memory was 147.8MB in the beginning and 292.7MB in the end (delta: -144.9MB). Peak memory consumption was 355.3MB. Max. memory is 8.0GB. [2024-11-03 09:01:07,417 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 09:01:07,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.30ms. Allocated memory is still 185.6MB. Free memory was 147.8MB in the beginning and 130.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-03 09:01:07,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.44ms. Allocated memory is still 185.6MB. Free memory was 130.0MB in the beginning and 127.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-03 09:01:07,417 INFO L158 Benchmark]: Boogie Preprocessor took 78.08ms. Allocated memory is still 185.6MB. Free memory was 127.2MB in the beginning and 124.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-03 09:01:07,418 INFO L158 Benchmark]: RCFGBuilder took 852.85ms. Allocated memory is still 185.6MB. Free memory was 124.1MB in the beginning and 151.0MB in the end (delta: -27.0MB). Peak memory consumption was 42.3MB. Max. memory is 8.0GB. [2024-11-03 09:01:07,418 INFO L158 Benchmark]: TraceAbstraction took 19485.35ms. Allocated memory was 185.6MB in the beginning and 677.4MB in the end (delta: 491.8MB). Free memory was 150.5MB in the beginning and 292.7MB in the end (delta: -142.2MB). Peak memory consumption was 356.9MB. Max. memory is 8.0GB. [2024-11-03 09:01:07,419 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 360.30ms. Allocated memory is still 185.6MB. Free memory was 147.8MB in the beginning and 130.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.44ms. Allocated memory is still 185.6MB. Free memory was 130.0MB in the beginning and 127.2MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 78.08ms. Allocated memory is still 185.6MB. Free memory was 127.2MB in the beginning and 124.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 852.85ms. Allocated memory is still 185.6MB. Free memory was 124.1MB in the beginning and 151.0MB in the end (delta: -27.0MB). Peak memory consumption was 42.3MB. Max. memory is 8.0GB. * TraceAbstraction took 19485.35ms. Allocated memory was 185.6MB in the beginning and 677.4MB in the end (delta: 491.8MB). Free memory was 150.5MB in the beginning and 292.7MB in the end (delta: -142.2MB). Peak memory consumption was 356.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 624]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 24, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3073 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3073 mSDsluCounter, 9101 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4898 mSDsCounter, 582 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4250 IncrementalHoareTripleChecker+Invalid, 4832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 582 mSolverCounterUnsat, 4203 mSDtfsCounter, 4250 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9172 GetRequests, 9110 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8906occurred in iteration=21, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 1569 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 4602 NumberOfCodeBlocks, 4602 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 9156 ConstructedInterpolants, 59 QuantifiedInterpolants, 12208 SizeOfPredicates, 7 NumberOfNonLiveVariables, 5644 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 48 InterpolantComputations, 40 PerfectInterpolantSequences, 35187/35352 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((48 == ag_Z) && (5 != blastFlag)) && (4528 == s__state)) && (0 == s__hit)) && (4352 == ag_X)) && (3 != blastFlag)) || (((208 == ag_Y) && (2 == blastFlag)) && (0 != s__hit))) || ((((48 == ag_Z) && (4368 == s__state)) && (0 == s__hit)) && (0 == blastFlag))) || ((((208 == ag_Y) && (4512 == s__state)) && (2 == blastFlag)) && (0 != s__hit))) || ((((48 == ag_Z) && (0 == s__hit)) && (0 == blastFlag)) && (12292 == s__state))) || (((((208 == ag_Y) && (4384 != s__s3__tmp__next_state___0)) && (0 != s__hit)) && (3 == s__state)) && (3 != blastFlag))) || ((((((4432 == s__state) && (48 == ag_Z)) && (5 != blastFlag)) && (0 == s__hit)) && (4352 == ag_X)) && (3 != blastFlag))) || (((((((48 == ag_Z) && (5 != blastFlag)) && (4560 == s__s3__tmp__next_state___0)) && (0 == s__hit)) && (4352 == ag_X)) && (4352 == s__state)) && (3 != blastFlag))) || ((((((4448 == s__state) && (48 == ag_Z)) && (5 != blastFlag)) && (0 == s__hit)) && (4352 == ag_X)) && (3 != blastFlag))) || ((((((48 == ag_Z) && (5 != blastFlag)) && (0 == s__hit)) && (4352 == ag_X)) && (4496 == s__state)) && (3 != blastFlag))) || (((((((48 == ag_Z) && (5 != blastFlag)) && (4560 == s__state)) && (4560 == s__s3__tmp__next_state___0)) && (0 == s__hit)) && (4352 == ag_X)) && (3 != blastFlag))) || ((((((48 == ag_Z) && (5 != blastFlag)) && (4512 == s__state)) && (0 == s__hit)) && (4352 == ag_X)) && (3 != blastFlag))) || ((((4368 == s__state) && (208 == ag_Y)) && (0 == blastFlag)) && (0 != s__hit))) || ((((4384 == s__state) && (1 == blastFlag)) && (208 == ag_Y)) && (0 != s__hit))) || ((((208 == ag_Y) && (0 == blastFlag)) && (0 != s__hit)) && (12292 == s__state))) || ((((208 == ag_Y) && (4528 == s__state)) && (2 == blastFlag)) && (0 != s__hit))) || (((((48 == ag_Z) && (4384 == s__state)) && (1 == blastFlag)) && (0 == s__hit)) && (4352 == ag_X))) || (((((((48 == ag_Z) && (5 != blastFlag)) && (4560 == s__s3__tmp__next_state___0)) && (0 == s__hit)) && (4352 == ag_X)) && (3 == s__state)) && (3 != blastFlag))) || (((((208 == ag_Y) && (2 == blastFlag)) && (0 != s__hit)) && (4352 == s__state)) && (3 == s__s3__tmp__next_state___0))) || ((((((48 == ag_Z) && (5 != blastFlag)) && (0 == s__hit)) && (4352 == ag_X)) && (4480 == s__state)) && (3 != blastFlag))) || ((((((48 == ag_Z) && (5 != blastFlag)) && (0 == s__hit)) && (4352 == ag_X)) && (4464 == s__state)) && (3 != blastFlag))) || (((((48 == ag_Z) && (4400 == s__state)) && (2 == blastFlag)) && (0 == s__hit)) && (4352 == ag_X))) || (((((48 == ag_Z) && (5 != blastFlag)) && (0 == s__hit)) && (4352 == ag_X)) && (4416 == s__state))) RESULT: Ultimate proved your program to be correct! [2024-11-03 09:01:07,450 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...