/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_2.BV.c.cil-1a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:28:37,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:28:37,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 20:28:37,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:28:37,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:28:37,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:28:37,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:28:37,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:28:37,795 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:28:37,798 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:28:37,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:28:37,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:28:37,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:28:37,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:28:37,800 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:28:37,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:28:37,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:28:37,801 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:28:37,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:28:37,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:28:37,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:28:37,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:28:37,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:28:37,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:28:37,804 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:28:37,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:28:37,804 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:28:37,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:28:37,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:28:37,805 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:28:37,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:28:37,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:28:37,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:28:37,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:28:37,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:28:37,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:28:37,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:28:37,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:28:37,808 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:28:37,808 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:28:37,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:28:37,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:28:37,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:28:37,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:28:37,809 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:38,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:28:38,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:28:38,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:28:38,060 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:28:38,060 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:28:38,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_clnt_2.BV.c.cil-1a.c [2024-11-05 20:28:39,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:28:39,589 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:28:39,590 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_2.BV.c.cil-1a.c [2024-11-05 20:28:39,603 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33eb849a0/ec53ff87529f4e2db9aec35f3ee4a146/FLAGd29d2f174 [2024-11-05 20:28:39,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33eb849a0/ec53ff87529f4e2db9aec35f3ee4a146 [2024-11-05 20:28:39,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:28:39,624 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:28:39,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:28:39,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:28:39,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:28:39,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:28:39" (1/1) ... [2024-11-05 20:28:39,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@684ab581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:39, skipping insertion in model container [2024-11-05 20:28:39,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:28:39" (1/1) ... [2024-11-05 20:28:39,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:28:39,917 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_2.BV.c.cil-1a.c[37676,37689] [2024-11-05 20:28:39,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:28:39,948 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:28:40,013 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_2.BV.c.cil-1a.c[37676,37689] [2024-11-05 20:28:40,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:28:40,036 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:28:40,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:40 WrapperNode [2024-11-05 20:28:40,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:28:40,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:28:40,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:28:40,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:28:40,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:40" (1/1) ... [2024-11-05 20:28:40,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:40" (1/1) ... [2024-11-05 20:28:40,096 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 470 [2024-11-05 20:28:40,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:28:40,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:28:40,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:28:40,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:28:40,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:40" (1/1) ... [2024-11-05 20:28:40,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:40" (1/1) ... [2024-11-05 20:28:40,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:40" (1/1) ... [2024-11-05 20:28:40,143 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-05 20:28:40,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:40" (1/1) ... [2024-11-05 20:28:40,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:40" (1/1) ... [2024-11-05 20:28:40,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:40" (1/1) ... [2024-11-05 20:28:40,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:40" (1/1) ... [2024-11-05 20:28:40,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:40" (1/1) ... [2024-11-05 20:28:40,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:40" (1/1) ... [2024-11-05 20:28:40,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:28:40,169 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:28:40,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:28:40,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:28:40,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:40" (1/1) ... [2024-11-05 20:28:40,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:28:40,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:28:40,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 20:28:40,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 20:28:40,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:28:40,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:28:40,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:28:40,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:28:40,348 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:28:40,350 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:28:40,372 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-05 20:28:40,826 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2024-11-05 20:28:40,826 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2024-11-05 20:28:40,879 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-05 20:28:40,879 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:28:40,895 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:28:40,896 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 20:28:40,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:28:40 BoogieIcfgContainer [2024-11-05 20:28:40,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:28:40,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:28:40,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:28:40,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:28:40,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:28:39" (1/3) ... [2024-11-05 20:28:40,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b91f0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:28:40, skipping insertion in model container [2024-11-05 20:28:40,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:28:40" (2/3) ... [2024-11-05 20:28:40,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b91f0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:28:40, skipping insertion in model container [2024-11-05 20:28:40,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:28:40" (3/3) ... [2024-11-05 20:28:40,907 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2024-11-05 20:28:40,923 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:28:40,924 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:28:40,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:28:40,998 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;@57ef2926, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:28:40,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:28:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-05 20:28:41,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:41,010 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] [2024-11-05 20:28:41,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:41,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:41,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1457697026, now seen corresponding path program 1 times [2024-11-05 20:28:41,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:41,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [613425901] [2024-11-05 20:28:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:41,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:41,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:41,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:28:41,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 20:28:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:41,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:41,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:28:41,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:28:41,197 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:41,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [613425901] [2024-11-05 20:28:41,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [613425901] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:41,198 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:41,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:28:41,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634551217] [2024-11-05 20:28:41,200 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:41,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:28:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:41,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:28:41,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:28:41,228 INFO L87 Difference]: Start difference. First operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 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.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:41,404 INFO L93 Difference]: Finished difference Result 246 states and 421 transitions. [2024-11-05 20:28:41,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:28:41,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2024-11-05 20:28:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:41,415 INFO L225 Difference]: With dead ends: 246 [2024-11-05 20:28:41,415 INFO L226 Difference]: Without dead ends: 112 [2024-11-05 20:28:41,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-05 20:28:41,422 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:41,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 319 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:28:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-05 20:28:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-05 20:28:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 111 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2024-11-05 20:28:41,471 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 24 [2024-11-05 20:28:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:41,472 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2024-11-05 20:28:41,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:41,473 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2024-11-05 20:28:41,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-05 20:28:41,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:41,475 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] [2024-11-05 20:28:41,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 20:28:41,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:41,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:41,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash -611475394, now seen corresponding path program 1 times [2024-11-05 20:28:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:41,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [367632427] [2024-11-05 20:28:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:41,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:41,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:41,681 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:28:41,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 20:28:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:41,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:41,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:41,771 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-05 20:28:41,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:41,796 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-05 20:28:41,796 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:41,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [367632427] [2024-11-05 20:28:41,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [367632427] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:41,797 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:41,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:28:41,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786178669] [2024-11-05 20:28:41,797 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:41,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:28:41,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:41,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:28:41,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:28:41,801 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:41,953 INFO L93 Difference]: Finished difference Result 229 states and 350 transitions. [2024-11-05 20:28:41,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:28:41,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2024-11-05 20:28:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:41,957 INFO L225 Difference]: With dead ends: 229 [2024-11-05 20:28:41,957 INFO L226 Difference]: Without dead ends: 127 [2024-11-05 20:28:41,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 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-05 20:28:41,960 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:41,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 239 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:28:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-05 20:28:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-05 20:28:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5) internal successors, (189), 126 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2024-11-05 20:28:41,978 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2024-11-05 20:28:41,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:41,979 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2024-11-05 20:28:41,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:41,981 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2024-11-05 20:28:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-05 20:28:41,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:41,983 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] [2024-11-05 20:28:41,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 20:28:42,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:42,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:42,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:42,185 INFO L85 PathProgramCache]: Analyzing trace with hash 213639527, now seen corresponding path program 1 times [2024-11-05 20:28:42,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:42,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1497287667] [2024-11-05 20:28:42,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:42,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:42,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:42,187 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:28:42,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 20:28:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:42,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:42,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:42,282 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-05 20:28:42,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:42,309 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-05 20:28:42,309 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:42,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1497287667] [2024-11-05 20:28:42,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1497287667] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:42,310 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:42,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:28:42,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634090623] [2024-11-05 20:28:42,310 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:42,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:28:42,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:42,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:28:42,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:28:42,312 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:42,425 INFO L93 Difference]: Finished difference Result 261 states and 394 transitions. [2024-11-05 20:28:42,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:28:42,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 50 [2024-11-05 20:28:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:42,427 INFO L225 Difference]: With dead ends: 261 [2024-11-05 20:28:42,428 INFO L226 Difference]: Without dead ends: 144 [2024-11-05 20:28:42,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 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-05 20:28:42,431 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:42,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 252 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:28:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-05 20:28:42,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-05 20:28:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2024-11-05 20:28:42,446 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2024-11-05 20:28:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:42,446 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2024-11-05 20:28:42,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2024-11-05 20:28:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-05 20:28:42,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:42,448 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] [2024-11-05 20:28:42,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-05 20:28:42,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:42,649 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:42,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:42,650 INFO L85 PathProgramCache]: Analyzing trace with hash 370823208, now seen corresponding path program 1 times [2024-11-05 20:28:42,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:42,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [496241346] [2024-11-05 20:28:42,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:42,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:42,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:42,654 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:28:42,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 20:28:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:42,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:42,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:42,752 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-05 20:28:42,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:42,789 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-05 20:28:42,790 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:42,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [496241346] [2024-11-05 20:28:42,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [496241346] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:42,790 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:42,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:28:42,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888490032] [2024-11-05 20:28:42,791 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:42,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:28:42,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:42,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:28:42,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:42,792 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:43,030 INFO L93 Difference]: Finished difference Result 341 states and 525 transitions. [2024-11-05 20:28:43,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:28:43,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 67 [2024-11-05 20:28:43,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:43,033 INFO L225 Difference]: With dead ends: 341 [2024-11-05 20:28:43,033 INFO L226 Difference]: Without dead ends: 207 [2024-11-05 20:28:43,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:43,034 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 74 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:43,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 249 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:28:43,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-05 20:28:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-05 20:28:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.441747572815534) internal successors, (297), 206 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 297 transitions. [2024-11-05 20:28:43,056 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 297 transitions. Word has length 67 [2024-11-05 20:28:43,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:43,058 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 297 transitions. [2024-11-05 20:28:43,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:43,058 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 297 transitions. [2024-11-05 20:28:43,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-05 20:28:43,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:43,060 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-05 20:28:43,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 20:28:43,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:43,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:43,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:43,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1528022105, now seen corresponding path program 1 times [2024-11-05 20:28:43,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:43,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [87515196] [2024-11-05 20:28:43,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:43,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:43,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:43,271 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:28:43,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-05 20:28:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:43,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:43,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:43,361 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-05 20:28:43,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:43,387 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-05 20:28:43,387 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:43,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [87515196] [2024-11-05 20:28:43,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [87515196] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:43,388 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:43,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:28:43,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869506000] [2024-11-05 20:28:43,388 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:43,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:28:43,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:43,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:28:43,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:28:43,390 INFO L87 Difference]: Start difference. First operand 207 states and 297 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-05 20:28:43,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:43,515 INFO L93 Difference]: Finished difference Result 423 states and 614 transitions. [2024-11-05 20:28:43,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:28:43,516 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-05 20:28:43,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:43,518 INFO L225 Difference]: With dead ends: 423 [2024-11-05 20:28:43,518 INFO L226 Difference]: Without dead ends: 226 [2024-11-05 20:28:43,519 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-05 20:28:43,523 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:43,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 257 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:28:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-05 20:28:43,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-11-05 20:28:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.4266666666666667) internal successors, (321), 225 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 321 transitions. [2024-11-05 20:28:43,542 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 321 transitions. Word has length 68 [2024-11-05 20:28:43,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:43,543 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 321 transitions. [2024-11-05 20:28:43,543 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-05 20:28:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 321 transitions. [2024-11-05 20:28:43,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 20:28:43,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:43,546 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] [2024-11-05 20:28:43,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-05 20:28:43,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:43,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:43,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:43,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1678422895, now seen corresponding path program 1 times [2024-11-05 20:28:43,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:43,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1717970739] [2024-11-05 20:28:43,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:43,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-05 20:28:43,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:43,756 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:28:43,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-05 20:28:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:43,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:43,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:43,871 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-05 20:28:43,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:43,902 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-05 20:28:43,903 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:43,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1717970739] [2024-11-05 20:28:43,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1717970739] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:43,903 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:43,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:28:43,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534328565] [2024-11-05 20:28:43,904 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:43,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:28:43,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:43,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:28:43,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:28:43,905 INFO L87 Difference]: Start difference. First operand 226 states and 321 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:44,049 INFO L93 Difference]: Finished difference Result 463 states and 666 transitions. [2024-11-05 20:28:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:28:44,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 84 [2024-11-05 20:28:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:44,052 INFO L225 Difference]: With dead ends: 463 [2024-11-05 20:28:44,052 INFO L226 Difference]: Without dead ends: 247 [2024-11-05 20:28:44,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 165 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-05 20:28:44,055 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:44,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 256 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:28:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-05 20:28:44,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-05 20:28:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.410569105691057) internal successors, (347), 246 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 347 transitions. [2024-11-05 20:28:44,066 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 347 transitions. Word has length 84 [2024-11-05 20:28:44,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:44,066 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 347 transitions. [2024-11-05 20:28:44,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 347 transitions. [2024-11-05 20:28:44,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-05 20:28:44,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:44,068 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] [2024-11-05 20:28:44,076 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-05 20:28:44,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:44,269 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:44,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:44,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1619803512, now seen corresponding path program 1 times [2024-11-05 20:28:44,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:44,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [978660270] [2024-11-05 20:28:44,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:44,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:44,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:44,272 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:28:44,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-05 20:28:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:44,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:44,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:44,407 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-05 20:28:44,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:44,480 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-05 20:28:44,481 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:44,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [978660270] [2024-11-05 20:28:44,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [978660270] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:44,481 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:44,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:28:44,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915886096] [2024-11-05 20:28:44,482 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:44,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:28:44,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:44,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:28:44,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:44,483 INFO L87 Difference]: Start difference. First operand 247 states and 347 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:44,528 INFO L93 Difference]: Finished difference Result 743 states and 1042 transitions. [2024-11-05 20:28:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:28:44,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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 103 [2024-11-05 20:28:44,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:44,532 INFO L225 Difference]: With dead ends: 743 [2024-11-05 20:28:44,532 INFO L226 Difference]: Without dead ends: 506 [2024-11-05 20:28:44,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:44,534 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 257 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:44,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 381 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:28:44,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-05 20:28:44,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2024-11-05 20:28:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.39009900990099) internal successors, (702), 505 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:44,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 702 transitions. [2024-11-05 20:28:44,556 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 702 transitions. Word has length 103 [2024-11-05 20:28:44,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:44,557 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 702 transitions. [2024-11-05 20:28:44,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:44,557 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 702 transitions. [2024-11-05 20:28:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-05 20:28:44,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:44,560 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] [2024-11-05 20:28:44,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-05 20:28:44,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:44,761 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:44,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:44,761 INFO L85 PathProgramCache]: Analyzing trace with hash -847602632, now seen corresponding path program 1 times [2024-11-05 20:28:44,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:44,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [962141769] [2024-11-05 20:28:44,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:44,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:44,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:44,765 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:28:44,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-05 20:28:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:44,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:44,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:44,872 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-05 20:28:44,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:44,901 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-05 20:28:44,901 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:44,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [962141769] [2024-11-05 20:28:44,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [962141769] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:44,902 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:44,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:28:44,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048742213] [2024-11-05 20:28:44,902 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:44,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:28:44,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:44,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:28:44,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:28:44,904 INFO L87 Difference]: Start difference. First operand 506 states and 702 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:44,929 INFO L93 Difference]: Finished difference Result 1023 states and 1418 transitions. [2024-11-05 20:28:44,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:28:44,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 103 [2024-11-05 20:28:44,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:44,932 INFO L225 Difference]: With dead ends: 1023 [2024-11-05 20:28:44,932 INFO L226 Difference]: Without dead ends: 527 [2024-11-05 20:28:44,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 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-05 20:28:44,934 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 11 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:44,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 337 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:28:44,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-05 20:28:44,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2024-11-05 20:28:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.3859315589353611) internal successors, (729), 526 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 729 transitions. [2024-11-05 20:28:44,947 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 729 transitions. Word has length 103 [2024-11-05 20:28:44,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:44,947 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 729 transitions. [2024-11-05 20:28:44,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 729 transitions. [2024-11-05 20:28:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-05 20:28:44,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:44,949 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-05 20:28:44,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-05 20:28:45,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:45,150 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:45,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:45,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1168582955, now seen corresponding path program 1 times [2024-11-05 20:28:45,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:45,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [966801533] [2024-11-05 20:28:45,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:45,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:45,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:45,152 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:28:45,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-05 20:28:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:45,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:45,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-05 20:28:45,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-05 20:28:45,296 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:45,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [966801533] [2024-11-05 20:28:45,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [966801533] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:45,296 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:45,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:28:45,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322122135] [2024-11-05 20:28:45,297 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:45,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:28:45,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:45,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:28:45,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:28:45,298 INFO L87 Difference]: Start difference. First operand 527 states and 729 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-05 20:28:45,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:45,319 INFO L93 Difference]: Finished difference Result 1070 states and 1478 transitions. [2024-11-05 20:28:45,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:28:45,320 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 104 [2024-11-05 20:28:45,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:45,322 INFO L225 Difference]: With dead ends: 1070 [2024-11-05 20:28:45,322 INFO L226 Difference]: Without dead ends: 553 [2024-11-05 20:28:45,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 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-05 20:28:45,323 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 20 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:45,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 309 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:28:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-05 20:28:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2024-11-05 20:28:45,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.3804347826086956) internal successors, (762), 552 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 762 transitions. [2024-11-05 20:28:45,335 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 762 transitions. Word has length 104 [2024-11-05 20:28:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:45,335 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 762 transitions. [2024-11-05 20:28:45,336 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-05 20:28:45,336 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 762 transitions. [2024-11-05 20:28:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-05 20:28:45,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:45,337 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-05 20:28:45,341 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 (10)] Forceful destruction successful, exit code 0 [2024-11-05 20:28:45,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:45,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:45,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:45,541 INFO L85 PathProgramCache]: Analyzing trace with hash -53319870, now seen corresponding path program 1 times [2024-11-05 20:28:45,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:45,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [499473553] [2024-11-05 20:28:45,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:45,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:45,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:45,544 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:28:45,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-05 20:28:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:45,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:45,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:45,646 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-05 20:28:45,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:45,681 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-05 20:28:45,682 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:45,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [499473553] [2024-11-05 20:28:45,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [499473553] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:45,682 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:45,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:28:45,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430028796] [2024-11-05 20:28:45,682 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:45,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:28:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:45,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:28:45,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:45,684 INFO L87 Difference]: Start difference. First operand 553 states and 762 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:45,736 INFO L93 Difference]: Finished difference Result 1520 states and 2113 transitions. [2024-11-05 20:28:45,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:28:45,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-05 20:28:45,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:45,740 INFO L225 Difference]: With dead ends: 1520 [2024-11-05 20:28:45,740 INFO L226 Difference]: Without dead ends: 1003 [2024-11-05 20:28:45,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:45,742 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 259 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 590 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-05 20:28:45,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 590 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:28:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2024-11-05 20:28:45,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2024-11-05 20:28:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 1.3892215568862276) internal successors, (1392), 1002 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1392 transitions. [2024-11-05 20:28:45,762 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1392 transitions. Word has length 105 [2024-11-05 20:28:45,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:45,762 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1392 transitions. [2024-11-05 20:28:45,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:45,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1392 transitions. [2024-11-05 20:28:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-05 20:28:45,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:45,765 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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] [2024-11-05 20:28:45,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-05 20:28:45,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:45,968 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:45,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:45,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1519363111, now seen corresponding path program 1 times [2024-11-05 20:28:45,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [540795710] [2024-11-05 20:28:45,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:45,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:45,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:45,970 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:28:45,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-05 20:28:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:46,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:46,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-05 20:28:46,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-05 20:28:46,092 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:46,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [540795710] [2024-11-05 20:28:46,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [540795710] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:46,092 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:46,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:28:46,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871659871] [2024-11-05 20:28:46,092 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:46,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:28:46,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:46,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:28:46,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:46,094 INFO L87 Difference]: Start difference. First operand 1003 states and 1392 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-05 20:28:46,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:46,276 INFO L93 Difference]: Finished difference Result 2062 states and 2905 transitions. [2024-11-05 20:28:46,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:28:46,276 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 173 [2024-11-05 20:28:46,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:46,281 INFO L225 Difference]: With dead ends: 2062 [2024-11-05 20:28:46,282 INFO L226 Difference]: Without dead ends: 1095 [2024-11-05 20:28:46,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:46,283 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 75 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:46,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 219 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:28:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2024-11-05 20:28:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1095. [2024-11-05 20:28:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 1.3711151736745886) internal successors, (1500), 1094 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:46,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1500 transitions. [2024-11-05 20:28:46,307 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1500 transitions. Word has length 173 [2024-11-05 20:28:46,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:46,307 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1500 transitions. [2024-11-05 20:28:46,308 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-05 20:28:46,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1500 transitions. [2024-11-05 20:28:46,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-05 20:28:46,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:46,311 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:28:46,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-05 20:28:46,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:46,514 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:46,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:46,514 INFO L85 PathProgramCache]: Analyzing trace with hash -759567935, now seen corresponding path program 1 times [2024-11-05 20:28:46,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:46,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [269555249] [2024-11-05 20:28:46,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:46,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:46,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:46,516 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:28:46,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-05 20:28:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:46,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 20:28:46,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 456 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-05 20:28:46,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 440 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-05 20:28:46,885 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:46,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [269555249] [2024-11-05 20:28:46,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [269555249] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:28:46,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:28:46,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 20:28:46,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32353023] [2024-11-05 20:28:46,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:28:46,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 20:28:46,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:46,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 20:28:46,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:28:46,887 INFO L87 Difference]: Start difference. First operand 1095 states and 1500 transitions. Second operand has 8 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:47,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:47,377 INFO L93 Difference]: Finished difference Result 2537 states and 3506 transitions. [2024-11-05 20:28:47,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 20:28:47,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 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 194 [2024-11-05 20:28:47,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:47,383 INFO L225 Difference]: With dead ends: 2537 [2024-11-05 20:28:47,383 INFO L226 Difference]: Without dead ends: 1478 [2024-11-05 20:28:47,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-05 20:28:47,387 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 673 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:47,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 721 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 20:28:47,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2024-11-05 20:28:47,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1404. [2024-11-05 20:28:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1403 states have (on average 1.3642195295794726) internal successors, (1914), 1403 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1914 transitions. [2024-11-05 20:28:47,420 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1914 transitions. Word has length 194 [2024-11-05 20:28:47,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:47,421 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1914 transitions. [2024-11-05 20:28:47,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:47,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1914 transitions. [2024-11-05 20:28:47,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-05 20:28:47,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:47,425 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] [2024-11-05 20:28:47,430 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-05 20:28:47,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:47,625 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:47,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1233429647, now seen corresponding path program 1 times [2024-11-05 20:28:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:47,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2082302406] [2024-11-05 20:28:47,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:47,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-05 20:28:47,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:47,629 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:28:47,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 (14)] Waiting until timeout for monitored process [2024-11-05 20:28:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:47,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:47,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:47,739 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-05 20:28:47,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:47,763 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-05 20:28:47,763 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:47,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2082302406] [2024-11-05 20:28:47,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2082302406] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:47,763 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:47,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:28:47,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002569718] [2024-11-05 20:28:47,764 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:47,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:28:47,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:47,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:28:47,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:47,765 INFO L87 Difference]: Start difference. First operand 1404 states and 1914 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:47,963 INFO L93 Difference]: Finished difference Result 2891 states and 3999 transitions. [2024-11-05 20:28:47,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:28:47,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-05 20:28:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:47,968 INFO L225 Difference]: With dead ends: 2891 [2024-11-05 20:28:47,968 INFO L226 Difference]: Without dead ends: 1544 [2024-11-05 20:28:47,969 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-05 20:28:47,970 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 77 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:47,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 248 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:28:47,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2024-11-05 20:28:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2024-11-05 20:28:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1543 states have (on average 1.3441348023331172) internal successors, (2074), 1543 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2074 transitions. [2024-11-05 20:28:48,006 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2074 transitions. Word has length 219 [2024-11-05 20:28:48,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:48,006 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2074 transitions. [2024-11-05 20:28:48,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2074 transitions. [2024-11-05 20:28:48,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-05 20:28:48,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:48,011 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 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, 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] [2024-11-05 20:28:48,015 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-05 20:28:48,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:48,212 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:48,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1201727504, now seen corresponding path program 1 times [2024-11-05 20:28:48,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:48,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1680870605] [2024-11-05 20:28:48,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:48,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:48,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:48,217 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:28:48,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-05 20:28:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:48,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:48,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-05 20:28:48,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-05 20:28:48,373 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:48,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1680870605] [2024-11-05 20:28:48,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1680870605] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:48,374 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:48,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:28:48,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759860943] [2024-11-05 20:28:48,374 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:48,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:28:48,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:48,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:28:48,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:48,375 INFO L87 Difference]: Start difference. First operand 1544 states and 2074 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:48,558 INFO L93 Difference]: Finished difference Result 3186 states and 4349 transitions. [2024-11-05 20:28:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:28:48,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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 230 [2024-11-05 20:28:48,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:48,564 INFO L225 Difference]: With dead ends: 3186 [2024-11-05 20:28:48,564 INFO L226 Difference]: Without dead ends: 1699 [2024-11-05 20:28:48,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:48,566 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 84 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:48,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 206 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:28:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-11-05 20:28:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1699. [2024-11-05 20:28:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1698 states have (on average 1.3244994110718493) internal successors, (2249), 1698 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2249 transitions. [2024-11-05 20:28:48,603 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2249 transitions. Word has length 230 [2024-11-05 20:28:48,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:48,603 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2249 transitions. [2024-11-05 20:28:48,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2249 transitions. [2024-11-05 20:28:48,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-05 20:28:48,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:48,608 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:28:48,612 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 (15)] Forceful destruction successful, exit code 0 [2024-11-05 20:28:48,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:48,809 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:48,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1748413006, now seen corresponding path program 1 times [2024-11-05 20:28:48,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:48,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1373144170] [2024-11-05 20:28:48,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:48,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:48,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:48,812 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:28:48,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-05 20:28:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:48,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:48,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-11-05 20:28:48,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-11-05 20:28:48,944 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:48,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1373144170] [2024-11-05 20:28:48,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1373144170] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:48,944 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:48,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:28:48,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48608765] [2024-11-05 20:28:48,945 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:48,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:28:48,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:48,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:28:48,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:48,946 INFO L87 Difference]: Start difference. First operand 1699 states and 2249 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-05 20:28:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:49,147 INFO L93 Difference]: Finished difference Result 3526 states and 4744 transitions. [2024-11-05 20:28:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:28:49,148 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 260 [2024-11-05 20:28:49,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:49,153 INFO L225 Difference]: With dead ends: 3526 [2024-11-05 20:28:49,153 INFO L226 Difference]: Without dead ends: 1884 [2024-11-05 20:28:49,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:49,157 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 96 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:49,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 249 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:28:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2024-11-05 20:28:49,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1884. [2024-11-05 20:28:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1883 states have (on average 1.30323951141795) internal successors, (2454), 1883 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2454 transitions. [2024-11-05 20:28:49,199 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2454 transitions. Word has length 260 [2024-11-05 20:28:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:49,199 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 2454 transitions. [2024-11-05 20:28:49,200 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-05 20:28:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2454 transitions. [2024-11-05 20:28:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-05 20:28:49,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:49,204 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:28:49,208 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-05 20:28:49,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:49,405 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:49,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:49,405 INFO L85 PathProgramCache]: Analyzing trace with hash -541056141, now seen corresponding path program 1 times [2024-11-05 20:28:49,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:49,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2068835278] [2024-11-05 20:28:49,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:49,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:49,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:49,407 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-05 20:28:49,408 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-05 20:28:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:49,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:49,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2024-11-05 20:28:49,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2024-11-05 20:28:49,590 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:49,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2068835278] [2024-11-05 20:28:49,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2068835278] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:49,590 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:49,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:28:49,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417362823] [2024-11-05 20:28:49,590 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:49,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:28:49,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:49,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:28:49,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:49,592 INFO L87 Difference]: Start difference. First operand 1884 states and 2454 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 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-05 20:28:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:49,686 INFO L93 Difference]: Finished difference Result 7200 states and 9404 transitions. [2024-11-05 20:28:49,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:28:49,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 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) Word has length 261 [2024-11-05 20:28:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:49,702 INFO L225 Difference]: With dead ends: 7200 [2024-11-05 20:28:49,702 INFO L226 Difference]: Without dead ends: 5373 [2024-11-05 20:28:49,705 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-05 20:28:49,705 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 262 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 734 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-05 20:28:49,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 734 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:28:49,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5373 states. [2024-11-05 20:28:49,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5373 to 5369. [2024-11-05 20:28:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5369 states, 5368 states have (on average 1.305327868852459) internal successors, (7007), 5368 states have internal predecessors, (7007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5369 states to 5369 states and 7007 transitions. [2024-11-05 20:28:49,826 INFO L78 Accepts]: Start accepts. Automaton has 5369 states and 7007 transitions. Word has length 261 [2024-11-05 20:28:49,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:49,826 INFO L471 AbstractCegarLoop]: Abstraction has 5369 states and 7007 transitions. [2024-11-05 20:28:49,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 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-05 20:28:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 5369 states and 7007 transitions. [2024-11-05 20:28:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-05 20:28:49,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:49,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:28:49,840 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 (17)] Forceful destruction successful, exit code 0 [2024-11-05 20:28:50,039 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-05 20:28:50,039 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:50,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:50,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1252386761, now seen corresponding path program 1 times [2024-11-05 20:28:50,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:50,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2035903429] [2024-11-05 20:28:50,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:50,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:50,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:50,042 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-05 20:28:50,042 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-05 20:28:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:50,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:50,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2024-11-05 20:28:50,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2024-11-05 20:28:50,180 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:50,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2035903429] [2024-11-05 20:28:50,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2035903429] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:50,180 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:50,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:28:50,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351943398] [2024-11-05 20:28:50,181 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:50,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:28:50,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:50,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:28:50,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:50,182 INFO L87 Difference]: Start difference. First operand 5369 states and 7007 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:50,444 INFO L93 Difference]: Finished difference Result 10846 states and 14225 transitions. [2024-11-05 20:28:50,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:28:50,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-05 20:28:50,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:50,463 INFO L225 Difference]: With dead ends: 10846 [2024-11-05 20:28:50,463 INFO L226 Difference]: Without dead ends: 5534 [2024-11-05 20:28:50,469 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-05 20:28:50,469 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 91 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:50,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 250 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:28:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5534 states. [2024-11-05 20:28:50,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5534 to 5534. [2024-11-05 20:28:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5534 states, 5533 states have (on average 1.2980300018073379) internal successors, (7182), 5533 states have internal predecessors, (7182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5534 states to 5534 states and 7182 transitions. [2024-11-05 20:28:50,646 INFO L78 Accepts]: Start accepts. Automaton has 5534 states and 7182 transitions. Word has length 285 [2024-11-05 20:28:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:50,647 INFO L471 AbstractCegarLoop]: Abstraction has 5534 states and 7182 transitions. [2024-11-05 20:28:50,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5534 states and 7182 transitions. [2024-11-05 20:28:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-11-05 20:28:50,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:50,659 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 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] [2024-11-05 20:28:50,664 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-05 20:28:50,860 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-05 20:28:50,860 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:50,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1370167796, now seen corresponding path program 1 times [2024-11-05 20:28:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:50,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1929908805] [2024-11-05 20:28:50,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:50,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:50,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:50,864 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-05 20:28:50,866 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-05 20:28:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:50,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:50,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:51,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 665 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-05 20:28:51,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 665 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-05 20:28:51,032 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:51,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1929908805] [2024-11-05 20:28:51,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1929908805] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:51,032 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:51,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:28:51,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888014660] [2024-11-05 20:28:51,033 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:51,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:28:51,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:51,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:28:51,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:51,036 INFO L87 Difference]: Start difference. First operand 5534 states and 7182 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:51,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:51,249 INFO L93 Difference]: Finished difference Result 11566 states and 15250 transitions. [2024-11-05 20:28:51,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:28:51,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-05 20:28:51,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:51,271 INFO L225 Difference]: With dead ends: 11566 [2024-11-05 20:28:51,272 INFO L226 Difference]: Without dead ends: 6089 [2024-11-05 20:28:51,279 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-05 20:28:51,280 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 92 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:51,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 201 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:28:51,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6089 states. [2024-11-05 20:28:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6089 to 6089. [2024-11-05 20:28:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6089 states, 6088 states have (on average 1.2807161629434953) internal successors, (7797), 6088 states have internal predecessors, (7797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6089 states to 6089 states and 7797 transitions. [2024-11-05 20:28:51,449 INFO L78 Accepts]: Start accepts. Automaton has 6089 states and 7797 transitions. Word has length 297 [2024-11-05 20:28:51,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:51,449 INFO L471 AbstractCegarLoop]: Abstraction has 6089 states and 7797 transitions. [2024-11-05 20:28:51,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:51,449 INFO L276 IsEmpty]: Start isEmpty. Operand 6089 states and 7797 transitions. [2024-11-05 20:28:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-05 20:28:51,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:51,461 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 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] [2024-11-05 20:28:51,465 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-05 20:28:51,661 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-05 20:28:51,662 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:51,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:51,662 INFO L85 PathProgramCache]: Analyzing trace with hash 814591708, now seen corresponding path program 1 times [2024-11-05 20:28:51,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:51,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [726739390] [2024-11-05 20:28:51,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:51,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:51,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:51,666 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-05 20:28:51,667 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-05 20:28:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:51,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:51,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2024-11-05 20:28:51,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2024-11-05 20:28:51,812 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:51,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [726739390] [2024-11-05 20:28:51,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [726739390] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:51,813 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:51,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:28:51,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453694192] [2024-11-05 20:28:51,813 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:51,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:28:51,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:51,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:28:51,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:51,814 INFO L87 Difference]: Start difference. First operand 6089 states and 7797 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:52,072 INFO L93 Difference]: Finished difference Result 12751 states and 16585 transitions. [2024-11-05 20:28:52,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:28:52,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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 334 [2024-11-05 20:28:52,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:52,087 INFO L225 Difference]: With dead ends: 12751 [2024-11-05 20:28:52,087 INFO L226 Difference]: Without dead ends: 6719 [2024-11-05 20:28:52,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:52,095 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 94 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:52,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 248 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:28:52,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6719 states. [2024-11-05 20:28:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6719 to 6704. [2024-11-05 20:28:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6704 states, 6703 states have (on average 1.2639116813367148) internal successors, (8472), 6703 states have internal predecessors, (8472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6704 states to 6704 states and 8472 transitions. [2024-11-05 20:28:52,274 INFO L78 Accepts]: Start accepts. Automaton has 6704 states and 8472 transitions. Word has length 334 [2024-11-05 20:28:52,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:52,275 INFO L471 AbstractCegarLoop]: Abstraction has 6704 states and 8472 transitions. [2024-11-05 20:28:52,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 6704 states and 8472 transitions. [2024-11-05 20:28:52,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-11-05 20:28:52,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:52,289 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 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, 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] [2024-11-05 20:28:52,293 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 (20)] Forceful destruction successful, exit code 0 [2024-11-05 20:28:52,489 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-05 20:28:52,490 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:52,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:52,490 INFO L85 PathProgramCache]: Analyzing trace with hash 562644076, now seen corresponding path program 1 times [2024-11-05 20:28:52,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:52,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1999484590] [2024-11-05 20:28:52,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:52,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:52,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:52,492 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-05 20:28:52,493 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-05 20:28:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:52,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:28:52,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 903 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-05 20:28:52,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 903 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-05 20:28:52,745 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:52,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1999484590] [2024-11-05 20:28:52,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1999484590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:28:52,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:28:52,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-05 20:28:52,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743237879] [2024-11-05 20:28:52,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:28:52,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:28:52,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:52,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:28:52,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:28:52,747 INFO L87 Difference]: Start difference. First operand 6704 states and 8472 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-05 20:28:53,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:53,407 INFO L93 Difference]: Finished difference Result 21706 states and 27475 transitions. [2024-11-05 20:28:53,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 20:28:53,408 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 357 [2024-11-05 20:28:53,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:53,433 INFO L225 Difference]: With dead ends: 21706 [2024-11-05 20:28:53,433 INFO L226 Difference]: Without dead ends: 15059 [2024-11-05 20:28:53,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 712 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:28:53,442 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 343 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:53,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1027 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 20:28:53,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15059 states. [2024-11-05 20:28:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15059 to 9232. [2024-11-05 20:28:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9232 states, 9231 states have (on average 1.2807929801754956) internal successors, (11823), 9231 states have internal predecessors, (11823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9232 states to 9232 states and 11823 transitions. [2024-11-05 20:28:53,715 INFO L78 Accepts]: Start accepts. Automaton has 9232 states and 11823 transitions. Word has length 357 [2024-11-05 20:28:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:53,715 INFO L471 AbstractCegarLoop]: Abstraction has 9232 states and 11823 transitions. [2024-11-05 20:28:53,715 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-05 20:28:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 9232 states and 11823 transitions. [2024-11-05 20:28:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-05 20:28:53,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:53,731 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 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, 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] [2024-11-05 20:28:53,736 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-05 20:28:53,931 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-05 20:28:53,932 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:53,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:53,933 INFO L85 PathProgramCache]: Analyzing trace with hash 78805813, now seen corresponding path program 1 times [2024-11-05 20:28:53,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:53,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1086947227] [2024-11-05 20:28:53,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:53,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:53,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:53,934 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-05 20:28:53,935 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-05 20:28:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:54,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:54,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 928 proven. 0 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2024-11-05 20:28:54,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 928 proven. 0 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2024-11-05 20:28:54,258 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:54,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1086947227] [2024-11-05 20:28:54,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1086947227] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:54,258 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:54,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:28:54,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266834150] [2024-11-05 20:28:54,259 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:54,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:28:54,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:54,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:28:54,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:28:54,261 INFO L87 Difference]: Start difference. First operand 9232 states and 11823 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:54,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:54,413 INFO L93 Difference]: Finished difference Result 19629 states and 24779 transitions. [2024-11-05 20:28:54,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:28:54,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 359 [2024-11-05 20:28:54,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:54,434 INFO L225 Difference]: With dead ends: 19629 [2024-11-05 20:28:54,434 INFO L226 Difference]: Without dead ends: 10454 [2024-11-05 20:28:54,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 715 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-05 20:28:54,446 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 100 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:54,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 385 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:28:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10454 states. [2024-11-05 20:28:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10454 to 10024. [2024-11-05 20:28:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10024 states, 10023 states have (on average 1.2466327446872194) internal successors, (12495), 10023 states have internal predecessors, (12495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10024 states to 10024 states and 12495 transitions. [2024-11-05 20:28:54,720 INFO L78 Accepts]: Start accepts. Automaton has 10024 states and 12495 transitions. Word has length 359 [2024-11-05 20:28:54,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:54,720 INFO L471 AbstractCegarLoop]: Abstraction has 10024 states and 12495 transitions. [2024-11-05 20:28:54,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:54,721 INFO L276 IsEmpty]: Start isEmpty. Operand 10024 states and 12495 transitions. [2024-11-05 20:28:54,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2024-11-05 20:28:54,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:54,736 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 14, 12, 12, 11, 11, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:28:54,741 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-05 20:28:54,936 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-05 20:28:54,937 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:54,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:54,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1396739116, now seen corresponding path program 1 times [2024-11-05 20:28:54,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:54,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [325413647] [2024-11-05 20:28:54,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:54,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:54,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:54,940 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-05 20:28:54,942 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-05 20:28:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:55,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:55,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-11-05 20:28:55,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-11-05 20:28:55,645 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:55,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [325413647] [2024-11-05 20:28:55,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [325413647] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:55,645 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:55,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 20:28:55,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031650520] [2024-11-05 20:28:55,645 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:55,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 20:28:55,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:55,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 20:28:55,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 20:28:55,647 INFO L87 Difference]: Start difference. First operand 10024 states and 12495 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:55,798 INFO L93 Difference]: Finished difference Result 15258 states and 19066 transitions. [2024-11-05 20:28:55,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:28:55,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 434 [2024-11-05 20:28:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:55,810 INFO L225 Difference]: With dead ends: 15258 [2024-11-05 20:28:55,810 INFO L226 Difference]: Without dead ends: 6496 [2024-11-05 20:28:55,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 865 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-05 20:28:55,820 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 41 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:55,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 410 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:28:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2024-11-05 20:28:55,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 6494. [2024-11-05 20:28:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6494 states, 6493 states have (on average 1.2590482057600494) internal successors, (8175), 6493 states have internal predecessors, (8175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6494 states to 6494 states and 8175 transitions. [2024-11-05 20:28:55,962 INFO L78 Accepts]: Start accepts. Automaton has 6494 states and 8175 transitions. Word has length 434 [2024-11-05 20:28:55,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:55,963 INFO L471 AbstractCegarLoop]: Abstraction has 6494 states and 8175 transitions. [2024-11-05 20:28:55,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 6494 states and 8175 transitions. [2024-11-05 20:28:55,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2024-11-05 20:28:55,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:55,973 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 17, 15, 15, 14, 14, 13, 13, 12, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:28:55,978 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-05 20:28:56,173 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-05 20:28:56,174 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:56,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:56,174 INFO L85 PathProgramCache]: Analyzing trace with hash -839302048, now seen corresponding path program 1 times [2024-11-05 20:28:56,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:56,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1642750812] [2024-11-05 20:28:56,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:56,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:56,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:56,176 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-05 20:28:56,177 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-05 20:28:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:56,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 20:28:56,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1527 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2024-11-05 20:28:56,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1527 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2024-11-05 20:28:56,371 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:56,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1642750812] [2024-11-05 20:28:56,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1642750812] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:28:56,372 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:28:56,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:28:56,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835071636] [2024-11-05 20:28:56,372 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:28:56,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:28:56,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:56,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:28:56,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:56,374 INFO L87 Difference]: Start difference. First operand 6494 states and 8175 transitions. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:56,627 INFO L93 Difference]: Finished difference Result 13201 states and 16801 transitions. [2024-11-05 20:28:56,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 20:28:56,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 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 544 [2024-11-05 20:28:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:56,639 INFO L225 Difference]: With dead ends: 13201 [2024-11-05 20:28:56,639 INFO L226 Difference]: Without dead ends: 6134 [2024-11-05 20:28:56,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1086 GetRequests, 1084 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:28:56,649 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 84 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:56,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 206 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:28:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6134 states. [2024-11-05 20:28:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6134 to 6134. [2024-11-05 20:28:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6134 states, 6133 states have (on average 1.2449046143812164) internal successors, (7635), 6133 states have internal predecessors, (7635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 7635 transitions. [2024-11-05 20:28:56,792 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 7635 transitions. Word has length 544 [2024-11-05 20:28:56,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:56,792 INFO L471 AbstractCegarLoop]: Abstraction has 6134 states and 7635 transitions. [2024-11-05 20:28:56,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:56,792 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 7635 transitions. [2024-11-05 20:28:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2024-11-05 20:28:56,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:56,803 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 19, 17, 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, 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-05 20:28:56,809 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-05 20:28:57,004 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-05 20:28:57,004 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:57,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:57,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1723660819, now seen corresponding path program 1 times [2024-11-05 20:28:57,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:57,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1171199513] [2024-11-05 20:28:57,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:57,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:28:57,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:57,009 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-05 20:28:57,009 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-05 20:28:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:57,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:28:57,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2024-11-05 20:28:57,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2024-11-05 20:28:57,301 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:57,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1171199513] [2024-11-05 20:28:57,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1171199513] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:28:57,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:28:57,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-05 20:28:57,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331108790] [2024-11-05 20:28:57,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:28:57,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:28:57,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:57,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:28:57,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:28:57,303 INFO L87 Difference]: Start difference. First operand 6134 states and 7635 transitions. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:57,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:57,510 INFO L93 Difference]: Finished difference Result 6347 states and 7905 transitions. [2024-11-05 20:28:57,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:28:57,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 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 619 [2024-11-05 20:28:57,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:57,512 INFO L225 Difference]: With dead ends: 6347 [2024-11-05 20:28:57,512 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 20:28:57,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1240 GetRequests, 1234 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-05 20:28:57,518 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 95 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:57,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 256 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:28:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 20:28:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 20:28:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 20:28:57,520 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 619 [2024-11-05 20:28:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:57,520 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 20:28:57,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 20:28:57,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 20:28:57,524 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 20:28:57,529 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 (25)] Ended with exit code 0 [2024-11-05 20:28:57,724 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-05 20:28:57,727 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-05 20:28:57,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 20:29:00,563 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 20:29:00,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 08:29:00 BoogieIcfgContainer [2024-11-05 20:29:00,592 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 20:29:00,592 INFO L158 Benchmark]: Toolchain (without parser) took 20968.42ms. Allocated memory was 346.0MB in the beginning and 720.4MB in the end (delta: 374.3MB). Free memory was 296.5MB in the beginning and 638.6MB in the end (delta: -342.0MB). Peak memory consumption was 440.4MB. Max. memory is 8.0GB. [2024-11-05 20:29:00,592 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 197.1MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 20:29:00,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.72ms. Allocated memory is still 346.0MB. Free memory was 296.5MB in the beginning and 278.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-05 20:29:00,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.58ms. Allocated memory is still 346.0MB. Free memory was 278.7MB in the beginning and 276.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-05 20:29:00,593 INFO L158 Benchmark]: Boogie Preprocessor took 68.20ms. Allocated memory is still 346.0MB. Free memory was 276.1MB in the beginning and 272.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-05 20:29:00,593 INFO L158 Benchmark]: RCFGBuilder took 728.95ms. Allocated memory is still 346.0MB. Free memory was 272.9MB in the beginning and 236.2MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2024-11-05 20:29:00,593 INFO L158 Benchmark]: TraceAbstraction took 19691.83ms. Allocated memory was 346.0MB in the beginning and 720.4MB in the end (delta: 374.3MB). Free memory was 235.7MB in the beginning and 638.6MB in the end (delta: -402.8MB). Peak memory consumption was 379.6MB. Max. memory is 8.0GB. [2024-11-05 20:29:00,594 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.12ms. Allocated memory is still 197.1MB. Free memory is still 144.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 410.72ms. Allocated memory is still 346.0MB. Free memory was 296.5MB in the beginning and 278.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.58ms. Allocated memory is still 346.0MB. Free memory was 278.7MB in the beginning and 276.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.20ms. Allocated memory is still 346.0MB. Free memory was 276.1MB in the beginning and 272.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 728.95ms. Allocated memory is still 346.0MB. Free memory was 272.9MB in the beginning and 236.2MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 19691.83ms. Allocated memory was 346.0MB in the beginning and 720.4MB in the end (delta: 374.3MB). Free memory was 235.7MB in the beginning and 638.6MB in the end (delta: -402.8MB). Peak memory consumption was 379.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 618]: 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, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 24, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2871 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2871 mSDsluCounter, 8549 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4244 mSDsCounter, 550 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4088 IncrementalHoareTripleChecker+Invalid, 4638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 550 mSolverCounterUnsat, 4305 mSDtfsCounter, 4088 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10590 GetRequests, 10534 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10024occurred in iteration=21, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 6352 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 5310 NumberOfCodeBlocks, 5310 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 10572 ConstructedInterpolants, 0 QuantifiedInterpolants, 14469 SizeOfPredicates, 4 NumberOfNonLiveVariables, 6400 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 48 InterpolantComputations, 42 PerfectInterpolantSequences, 43356/43460 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: 103]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((61087 == ag_Y) && (5 != blastFlag)) && (65535 == ag_X)) && (4528 == s__state)) && (0 == s__hit)) && (3 != blastFlag)) || (((((((61087 == ag_Y) && (5 != blastFlag)) && (4400 == s__state)) && (65535 == ag_X)) && (0 == s__hit)) && (4368 != s__s3__tmp__next_state___0)) && (3 != blastFlag))) || (((4512 == s__state) && (2 == blastFlag)) && (0 != s__hit))) || (((((((((((((61087 == ag_Y) && (5 != blastFlag)) && (65535 == ag_X)) && (16384 != s__state)) && (4560 == s__s3__tmp__next_state___0)) && (4368 != s__state)) && (4099 != s__state)) && (4096 != s__state)) && (0 == s__hit)) && (12292 != s__state)) && (20480 != s__state)) && (4369 != s__state)) && (3 != blastFlag))) || (((4560 == s__state) && (2 == blastFlag)) && (0 != s__hit))) || ((((2 == blastFlag) && (0 != s__hit)) && (4352 == s__state)) && (3 == s__s3__tmp__next_state___0))) || ((((((4432 == s__state) && (61087 == ag_Y)) && (5 != blastFlag)) && (65535 == ag_X)) && (0 == s__hit)) && (3 != blastFlag))) || ((((((61087 == ag_Y) && (5 != blastFlag)) && (65535 == ag_X)) && (0 == s__hit)) && (4480 == s__state)) && (3 != blastFlag))) || ((((((61087 == ag_Y) && (5 != blastFlag)) && (65535 == ag_X)) && (0 == s__hit)) && (4496 == s__state)) && (3 != blastFlag))) || (((4400 == s__state) && (2 == blastFlag)) && (0 == s__hit))) || ((4384 == s__state) && (1 == blastFlag))) || ((((((61087 == ag_Y) && (65535 == ag_X)) && (0 != s__hit)) && (3 == s__state)) && (4368 != s__s3__tmp__next_state___0)) && (3 != blastFlag))) || ((0 == blastFlag) && (12292 == s__state))) || ((((2 == blastFlag) && (0 != s__hit)) && (3 == s__state)) && (4368 != s__s3__tmp__next_state___0))) || ((((((4448 == s__state) && (61087 == ag_Y)) && (5 != blastFlag)) && (65535 == ag_X)) && (0 == s__hit)) && (3 != blastFlag))) || ((((((61087 == ag_Y) && (5 != blastFlag)) && (65535 == ag_X)) && (0 == s__hit)) && (4464 == s__state)) && (3 != blastFlag))) || ((((61087 == ag_Y) && (5 != blastFlag)) && (0 == s__hit)) && (4416 == s__state))) || (((4528 == s__state) && (2 == blastFlag)) && (0 != s__hit))) || ((4368 == s__state) && (0 == blastFlag))) || ((((((61087 == ag_Y) && (5 != blastFlag)) && (65535 == ag_X)) && (4512 == s__state)) && (0 == s__hit)) && (3 != blastFlag))) RESULT: Ultimate proved your program to be correct! [2024-11-05 20:29:00,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...