/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/byte_add_2-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:27:24,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:27:25,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 20:27:25,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:27:25,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:27:25,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:27:25,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:27:25,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:27:25,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:27:25,067 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:27:25,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:27:25,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:27:25,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:27:25,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:27:25,070 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:27:25,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:27:25,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:27:25,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:27:25,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:27:25,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:27:25,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:27:25,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:27:25,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:27:25,076 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:27:25,076 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:27:25,076 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:27:25,076 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:27:25,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:27:25,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:27:25,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:27:25,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:27:25,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:27:25,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:27:25,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:27:25,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:27:25,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:27:25,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:27:25,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:27:25,079 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:27:25,079 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:27:25,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:27:25,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:27:25,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:27:25,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:27:25,082 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:25,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:27:25,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:27:25,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:27:25,304 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:27:25,304 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:27:25,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add_2-2.i [2024-11-05 20:27:26,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:27:26,920 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:27:26,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_2-2.i [2024-11-05 20:27:26,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f73989fc/52ff76f949aa455294d169a0d92fe9d1/FLAG9e9cd7c39 [2024-11-05 20:27:26,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f73989fc/52ff76f949aa455294d169a0d92fe9d1 [2024-11-05 20:27:26,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:27:26,943 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:27:26,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:27:26,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:27:26,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:27:26,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:27:26" (1/1) ... [2024-11-05 20:27:26,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dcba422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:26, skipping insertion in model container [2024-11-05 20:27:26,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:27:26" (1/1) ... [2024-11-05 20:27:26,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:27:27,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_2-2.i[1168,1181] [2024-11-05 20:27:27,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:27:27,187 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:27:27,197 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_2-2.i[1168,1181] [2024-11-05 20:27:27,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:27:27,241 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:27:27,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:27 WrapperNode [2024-11-05 20:27:27,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:27:27,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:27:27,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:27:27,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:27:27,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:27" (1/1) ... [2024-11-05 20:27:27,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:27" (1/1) ... [2024-11-05 20:27:27,284 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2024-11-05 20:27:27,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:27:27,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:27:27,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:27:27,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:27:27,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:27" (1/1) ... [2024-11-05 20:27:27,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:27" (1/1) ... [2024-11-05 20:27:27,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:27" (1/1) ... [2024-11-05 20:27:27,309 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-05 20:27:27,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:27" (1/1) ... [2024-11-05 20:27:27,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:27" (1/1) ... [2024-11-05 20:27:27,315 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:27" (1/1) ... [2024-11-05 20:27:27,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:27" (1/1) ... [2024-11-05 20:27:27,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:27" (1/1) ... [2024-11-05 20:27:27,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:27" (1/1) ... [2024-11-05 20:27:27,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:27:27,325 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:27:27,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:27:27,325 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:27:27,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:27" (1/1) ... [2024-11-05 20:27:27,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:27:27,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:27:27,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 20:27:27,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 20:27:27,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:27:27,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:27:27,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:27:27,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:27:27,473 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:27:27,475 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:27:27,792 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-05 20:27:27,792 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:27:27,806 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:27:27,807 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-05 20:27:27,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:27:27 BoogieIcfgContainer [2024-11-05 20:27:27,808 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:27:27,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:27:27,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:27:27,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:27:27,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:27:26" (1/3) ... [2024-11-05 20:27:27,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278cdd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:27:27, skipping insertion in model container [2024-11-05 20:27:27,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:27:27" (2/3) ... [2024-11-05 20:27:27,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278cdd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:27:27, skipping insertion in model container [2024-11-05 20:27:27,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:27:27" (3/3) ... [2024-11-05 20:27:27,817 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i [2024-11-05 20:27:27,834 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:27:27,835 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:27:27,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:27:27,908 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;@59b3386a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:27:27,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:27:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-05 20:27:27,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:27,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:27,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:27,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:27,923 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2024-11-05 20:27:27,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:27,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1807549349] [2024-11-05 20:27:27,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:27,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:27,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:27,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:27,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 (2)] Waiting until timeout for monitored process [2024-11-05 20:27:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:28,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 20:27:28,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:28,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:28,041 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:28,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1807549349] [2024-11-05 20:27:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1807549349] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:28,046 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:28,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-05 20:27:28,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529607586] [2024-11-05 20:27:28,049 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:28,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 20:27:28,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:28,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 20:27:28,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 20:27:28,080 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:28,095 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2024-11-05 20:27:28,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 20:27:28,097 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-05 20:27:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:28,103 INFO L225 Difference]: With dead ends: 57 [2024-11-05 20:27:28,103 INFO L226 Difference]: Without dead ends: 38 [2024-11-05 20:27:28,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 20:27:28,108 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:28,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:27:28,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-05 20:27:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-05 20:27:28,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2024-11-05 20:27:28,143 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2024-11-05 20:27:28,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:28,143 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2024-11-05 20:27:28,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:28,144 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2024-11-05 20:27:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-05 20:27:28,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:28,145 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:28,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-05 20:27:28,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:28,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:28,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:28,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2024-11-05 20:27:28,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:28,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2014073693] [2024-11-05 20:27:28,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:28,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:28,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:28,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:28,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 20:27:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:28,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:27:28,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:28,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:28,502 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:28,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2014073693] [2024-11-05 20:27:28,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2014073693] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:28,503 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:28,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 20:27:28,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807818623] [2024-11-05 20:27:28,503 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:28,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:27:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:28,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:27:28,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:27:28,506 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:28,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:28,865 INFO L93 Difference]: Finished difference Result 141 states and 255 transitions. [2024-11-05 20:27:28,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 20:27:28,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-05 20:27:28,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:28,868 INFO L225 Difference]: With dead ends: 141 [2024-11-05 20:27:28,868 INFO L226 Difference]: Without dead ends: 113 [2024-11-05 20:27:28,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:27:28,870 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 154 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:28,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 150 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 20:27:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-05 20:27:28,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2024-11-05 20:27:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.67) internal successors, (167), 100 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:28,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 167 transitions. [2024-11-05 20:27:28,892 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 167 transitions. Word has length 12 [2024-11-05 20:27:28,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:28,892 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 167 transitions. [2024-11-05 20:27:28,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:28,893 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 167 transitions. [2024-11-05 20:27:28,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-05 20:27:28,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:28,894 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:28,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 20:27:29,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:29,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:29,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:29,101 INFO L85 PathProgramCache]: Analyzing trace with hash 583572890, now seen corresponding path program 1 times [2024-11-05 20:27:29,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:29,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1380917866] [2024-11-05 20:27:29,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:29,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:29,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:29,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:29,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 20:27:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:29,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:27:29,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:29,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:29,213 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:29,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1380917866] [2024-11-05 20:27:29,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1380917866] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:29,213 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:29,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 20:27:29,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988007166] [2024-11-05 20:27:29,214 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:29,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 20:27:29,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:29,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 20:27:29,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:27:29,216 INFO L87 Difference]: Start difference. First operand 101 states and 167 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:29,234 INFO L93 Difference]: Finished difference Result 112 states and 182 transitions. [2024-11-05 20:27:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 20:27:29,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-05 20:27:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:29,237 INFO L225 Difference]: With dead ends: 112 [2024-11-05 20:27:29,237 INFO L226 Difference]: Without dead ends: 60 [2024-11-05 20:27:29,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 20:27:29,241 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 52 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:29,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 63 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:27:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-05 20:27:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-05 20:27:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 59 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2024-11-05 20:27:29,253 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 14 [2024-11-05 20:27:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:29,254 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2024-11-05 20:27:29,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2024-11-05 20:27:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-05 20:27:29,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:29,255 INFO L215 NwaCegarLoop]: trace histogram [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:27:29,259 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:27:29,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:29,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:29,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:29,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1444715377, now seen corresponding path program 1 times [2024-11-05 20:27:29,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:29,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1280875810] [2024-11-05 20:27:29,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:29,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:29,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:29,461 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:29,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 20:27:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:29,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:27:29,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 20:27:29,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 20:27:29,598 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:29,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1280875810] [2024-11-05 20:27:29,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1280875810] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:29,598 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:29,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 20:27:29,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590909227] [2024-11-05 20:27:29,599 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:29,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:27:29,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:29,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:27:29,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:27:29,602 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:29,897 INFO L93 Difference]: Finished difference Result 208 states and 322 transitions. [2024-11-05 20:27:29,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 20:27:29,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-05 20:27:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:29,901 INFO L225 Difference]: With dead ends: 208 [2024-11-05 20:27:29,901 INFO L226 Difference]: Without dead ends: 159 [2024-11-05 20:27:29,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:27:29,904 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 134 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:29,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 133 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 20:27:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-05 20:27:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 109. [2024-11-05 20:27:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.4814814814814814) internal successors, (160), 108 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2024-11-05 20:27:29,930 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 38 [2024-11-05 20:27:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:29,930 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2024-11-05 20:27:29,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2024-11-05 20:27:29,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-05 20:27:29,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:29,932 INFO L215 NwaCegarLoop]: trace histogram [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:27:29,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 20:27:30,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:30,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:30,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:30,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1716518620, now seen corresponding path program 1 times [2024-11-05 20:27:30,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:30,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1790846535] [2024-11-05 20:27:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:30,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:30,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:30,140 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:30,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-05 20:27:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:30,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 20:27:30,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-05 20:27:30,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-05 20:27:30,498 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:30,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1790846535] [2024-11-05 20:27:30,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1790846535] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:27:30,500 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:27:30,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2024-11-05 20:27:30,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530403835] [2024-11-05 20:27:30,500 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:30,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-05 20:27:30,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:30,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-05 20:27:30,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-05 20:27:30,503 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 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:27:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:31,029 INFO L93 Difference]: Finished difference Result 289 states and 437 transitions. [2024-11-05 20:27:31,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-05 20:27:31,029 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 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 40 [2024-11-05 20:27:31,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:31,031 INFO L225 Difference]: With dead ends: 289 [2024-11-05 20:27:31,031 INFO L226 Difference]: Without dead ends: 198 [2024-11-05 20:27:31,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-05 20:27:31,032 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 335 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:31,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 417 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 20:27:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-05 20:27:31,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 106. [2024-11-05 20:27:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.457142857142857) internal successors, (153), 105 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 153 transitions. [2024-11-05 20:27:31,053 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 153 transitions. Word has length 40 [2024-11-05 20:27:31,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:31,053 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 153 transitions. [2024-11-05 20:27:31,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 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:27:31,054 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 153 transitions. [2024-11-05 20:27:31,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-05 20:27:31,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:31,055 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-05 20:27:31,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-05 20:27:31,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:31,256 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:31,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1078176807, now seen corresponding path program 1 times [2024-11-05 20:27:31,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:31,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [696838374] [2024-11-05 20:27:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:31,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:31,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:31,258 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:31,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-05 20:27:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:31,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:27:31,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:31,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:31,470 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:31,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [696838374] [2024-11-05 20:27:31,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [696838374] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:27:31,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:27:31,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-05 20:27:31,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982950420] [2024-11-05 20:27:31,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:31,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:27:31,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:31,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:27:31,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:27:31,472 INFO L87 Difference]: Start difference. First operand 106 states and 153 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:31,605 INFO L93 Difference]: Finished difference Result 213 states and 313 transitions. [2024-11-05 20:27:31,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 20:27:31,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2024-11-05 20:27:31,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:31,606 INFO L225 Difference]: With dead ends: 213 [2024-11-05 20:27:31,607 INFO L226 Difference]: Without dead ends: 162 [2024-11-05 20:27:31,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:27:31,608 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 95 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:31,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 188 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:27:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-05 20:27:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2024-11-05 20:27:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.40625) internal successors, (225), 160 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:31,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 225 transitions. [2024-11-05 20:27:31,620 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 225 transitions. Word has length 43 [2024-11-05 20:27:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:31,620 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 225 transitions. [2024-11-05 20:27:31,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:31,621 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 225 transitions. [2024-11-05 20:27:31,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-05 20:27:31,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:31,622 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:31,626 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:27:31,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:31,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:31,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:31,826 INFO L85 PathProgramCache]: Analyzing trace with hash -353022256, now seen corresponding path program 1 times [2024-11-05 20:27:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:31,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1457346139] [2024-11-05 20:27:31,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:31,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:31,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:31,827 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:31,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-05 20:27:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:31,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:27:31,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:31,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:31,968 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:31,968 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:31,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1457346139] [2024-11-05 20:27:31,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1457346139] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:27:31,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:27:31,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-05 20:27:31,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240477901] [2024-11-05 20:27:31,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:27:31,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:27:31,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:31,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:27:31,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:27:31,971 INFO L87 Difference]: Start difference. First operand 161 states and 225 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:32,224 INFO L93 Difference]: Finished difference Result 411 states and 617 transitions. [2024-11-05 20:27:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 20:27:32,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 44 [2024-11-05 20:27:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:32,226 INFO L225 Difference]: With dead ends: 411 [2024-11-05 20:27:32,226 INFO L226 Difference]: Without dead ends: 273 [2024-11-05 20:27:32,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:27:32,228 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 66 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:32,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 65 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:27:32,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-05 20:27:32,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 188. [2024-11-05 20:27:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.3368983957219251) internal successors, (250), 187 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:32,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 250 transitions. [2024-11-05 20:27:32,242 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 250 transitions. Word has length 44 [2024-11-05 20:27:32,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:32,242 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 250 transitions. [2024-11-05 20:27:32,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:32,243 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 250 transitions. [2024-11-05 20:27:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-05 20:27:32,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:32,244 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:32,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-05 20:27:32,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:32,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:32,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2080233776, now seen corresponding path program 1 times [2024-11-05 20:27:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:32,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1414882178] [2024-11-05 20:27:32,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:32,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:32,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:32,452 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:32,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-05 20:27:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:32,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 20:27:32,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:32,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:32,730 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:32,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1414882178] [2024-11-05 20:27:32,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1414882178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:27:32,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:27:32,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-05 20:27:32,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631206626] [2024-11-05 20:27:32,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:27:32,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 20:27:32,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:32,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 20:27:32,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:27:32,736 INFO L87 Difference]: Start difference. First operand 188 states and 250 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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:27:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:33,040 INFO L93 Difference]: Finished difference Result 671 states and 905 transitions. [2024-11-05 20:27:33,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-05 20:27:33,041 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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 44 [2024-11-05 20:27:33,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:33,043 INFO L225 Difference]: With dead ends: 671 [2024-11-05 20:27:33,043 INFO L226 Difference]: Without dead ends: 500 [2024-11-05 20:27:33,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2024-11-05 20:27:33,044 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 331 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:33,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 401 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:27:33,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-11-05 20:27:33,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 279. [2024-11-05 20:27:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.341726618705036) internal successors, (373), 278 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:33,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 373 transitions. [2024-11-05 20:27:33,065 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 373 transitions. Word has length 44 [2024-11-05 20:27:33,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:33,066 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 373 transitions. [2024-11-05 20:27:33,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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:27:33,066 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 373 transitions. [2024-11-05 20:27:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-05 20:27:33,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:33,068 INFO L215 NwaCegarLoop]: trace histogram [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:27:33,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-05 20:27:33,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:33,269 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:33,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1822068338, now seen corresponding path program 1 times [2024-11-05 20:27:33,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:33,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1310403317] [2024-11-05 20:27:33,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:33,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:27:33,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:33,273 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:33,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-05 20:27:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:33,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:27:33,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:33,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:33,579 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:33,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1310403317] [2024-11-05 20:27:33,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1310403317] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:27:33,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:27:33,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-05 20:27:33,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325881525] [2024-11-05 20:27:33,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:27:33,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 20:27:33,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:33,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 20:27:33,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:27:33,581 INFO L87 Difference]: Start difference. First operand 279 states and 373 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:33,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:33,860 INFO L93 Difference]: Finished difference Result 703 states and 965 transitions. [2024-11-05 20:27:33,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 20:27:33,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 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 44 [2024-11-05 20:27:33,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:33,864 INFO L225 Difference]: With dead ends: 703 [2024-11-05 20:27:33,864 INFO L226 Difference]: Without dead ends: 389 [2024-11-05 20:27:33,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2024-11-05 20:27:33,867 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 164 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:33,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 111 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:27:33,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-05 20:27:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 314. [2024-11-05 20:27:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 1.2747603833865815) internal successors, (399), 313 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 399 transitions. [2024-11-05 20:27:33,890 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 399 transitions. Word has length 44 [2024-11-05 20:27:33,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:33,891 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 399 transitions. [2024-11-05 20:27:33,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 399 transitions. [2024-11-05 20:27:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-05 20:27:33,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:33,892 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2024-11-05 20:27:33,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-05 20:27:34,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:34,095 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:34,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:34,096 INFO L85 PathProgramCache]: Analyzing trace with hash 343661932, now seen corresponding path program 1 times [2024-11-05 20:27:34,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:34,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [891334836] [2024-11-05 20:27:34,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:34,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:34,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:34,100 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:34,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-05 20:27:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:34,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 20:27:34,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-05 20:27:34,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-05 20:27:34,405 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:34,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [891334836] [2024-11-05 20:27:34,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [891334836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:27:34,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:27:34,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2024-11-05 20:27:34,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465102136] [2024-11-05 20:27:34,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:27:34,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 20:27:34,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:34,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 20:27:34,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-05 20:27:34,407 INFO L87 Difference]: Start difference. First operand 314 states and 399 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:34,659 INFO L93 Difference]: Finished difference Result 871 states and 1083 transitions. [2024-11-05 20:27:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 20:27:34,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 70 [2024-11-05 20:27:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:34,661 INFO L225 Difference]: With dead ends: 871 [2024-11-05 20:27:34,661 INFO L226 Difference]: Without dead ends: 574 [2024-11-05 20:27:34,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2024-11-05 20:27:34,662 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 221 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:34,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 303 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 20:27:34,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-05 20:27:34,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 330. [2024-11-05 20:27:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 1.2553191489361701) internal successors, (413), 329 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 413 transitions. [2024-11-05 20:27:34,683 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 413 transitions. Word has length 70 [2024-11-05 20:27:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:34,683 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 413 transitions. [2024-11-05 20:27:34,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 413 transitions. [2024-11-05 20:27:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-05 20:27:34,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:34,684 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:34,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-05 20:27:34,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:34,885 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:34,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:34,885 INFO L85 PathProgramCache]: Analyzing trace with hash 484210542, now seen corresponding path program 2 times [2024-11-05 20:27:34,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:34,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [194176858] [2024-11-05 20:27:34,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:34,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:34,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:34,887 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:34,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-05 20:27:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:34,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-05 20:27:34,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:37,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:39,793 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:39,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [194176858] [2024-11-05 20:27:39,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [194176858] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:27:39,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:27:39,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2024-11-05 20:27:39,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447186872] [2024-11-05 20:27:39,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:27:39,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-05 20:27:39,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:39,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-05 20:27:39,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1750, Unknown=0, NotChecked=0, Total=1892 [2024-11-05 20:27:39,796 INFO L87 Difference]: Start difference. First operand 330 states and 413 transitions. Second operand has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:49,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:49,657 INFO L93 Difference]: Finished difference Result 1822 states and 2269 transitions. [2024-11-05 20:27:49,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-11-05 20:27:49,658 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-05 20:27:49,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:49,663 INFO L225 Difference]: With dead ends: 1822 [2024-11-05 20:27:49,663 INFO L226 Difference]: Without dead ends: 1643 [2024-11-05 20:27:49,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2659 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2132, Invalid=11440, Unknown=0, NotChecked=0, Total=13572 [2024-11-05 20:27:49,669 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1606 mSDsluCounter, 5902 mSDsCounter, 0 mSdLazyCounter, 3182 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 6218 SdHoareTripleChecker+Invalid, 3314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 3182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:49,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 6218 Invalid, 3314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 3182 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-05 20:27:49,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2024-11-05 20:27:49,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 820. [2024-11-05 20:27:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 819 states have (on average 1.2503052503052503) internal successors, (1024), 819 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1024 transitions. [2024-11-05 20:27:49,733 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1024 transitions. Word has length 70 [2024-11-05 20:27:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:49,733 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1024 transitions. [2024-11-05 20:27:49,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1024 transitions. [2024-11-05 20:27:49,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-05 20:27:49,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:49,736 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:27:49,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-05 20:27:49,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:49,939 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:49,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:49,939 INFO L85 PathProgramCache]: Analyzing trace with hash -247756884, now seen corresponding path program 1 times [2024-11-05 20:27:49,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:49,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1116791754] [2024-11-05 20:27:49,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:49,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:49,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:49,940 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:49,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-05 20:27:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:49,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 20:27:49,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-05 20:27:50,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-05 20:27:50,134 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:50,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1116791754] [2024-11-05 20:27:50,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1116791754] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:27:50,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:27:50,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-11-05 20:27:50,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400647260] [2024-11-05 20:27:50,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:27:50,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 20:27:50,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:50,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 20:27:50,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-05 20:27:50,135 INFO L87 Difference]: Start difference. First operand 820 states and 1024 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:50,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:50,393 INFO L93 Difference]: Finished difference Result 1140 states and 1424 transitions. [2024-11-05 20:27:50,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 20:27:50,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 70 [2024-11-05 20:27:50,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:50,396 INFO L225 Difference]: With dead ends: 1140 [2024-11-05 20:27:50,396 INFO L226 Difference]: Without dead ends: 970 [2024-11-05 20:27:50,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-05 20:27:50,397 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 117 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:50,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 389 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:27:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-11-05 20:27:50,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 671. [2024-11-05 20:27:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 670 states have (on average 1.2507462686567163) internal successors, (838), 670 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 838 transitions. [2024-11-05 20:27:50,445 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 838 transitions. Word has length 70 [2024-11-05 20:27:50,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:50,445 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 838 transitions. [2024-11-05 20:27:50,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 838 transitions. [2024-11-05 20:27:50,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-05 20:27:50,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:50,446 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-05 20:27:50,452 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:27:50,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:50,647 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:50,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:50,647 INFO L85 PathProgramCache]: Analyzing trace with hash 946149333, now seen corresponding path program 1 times [2024-11-05 20:27:50,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:50,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [72067318] [2024-11-05 20:27:50,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:50,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:50,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:50,649 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:50,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-05 20:27:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:50,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:27:50,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 20:27:50,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 20:27:50,899 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:50,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [72067318] [2024-11-05 20:27:50,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [72067318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:27:50,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:27:50,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-05 20:27:50,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385438967] [2024-11-05 20:27:50,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:27:50,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 20:27:50,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:50,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 20:27:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-05 20:27:50,901 INFO L87 Difference]: Start difference. First operand 671 states and 838 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:27:51,341 INFO L93 Difference]: Finished difference Result 2156 states and 2681 transitions. [2024-11-05 20:27:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-05 20:27:51,341 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-05 20:27:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:27:51,345 INFO L225 Difference]: With dead ends: 2156 [2024-11-05 20:27:51,345 INFO L226 Difference]: Without dead ends: 1483 [2024-11-05 20:27:51,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2024-11-05 20:27:51,347 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 219 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:27:51,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 160 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 20:27:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2024-11-05 20:27:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1259. [2024-11-05 20:27:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1258 states have (on average 1.2488076311605723) internal successors, (1571), 1258 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1571 transitions. [2024-11-05 20:27:51,440 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1571 transitions. Word has length 72 [2024-11-05 20:27:51,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:27:51,441 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 1571 transitions. [2024-11-05 20:27:51,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:27:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1571 transitions. [2024-11-05 20:27:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-05 20:27:51,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:27:51,446 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-05 20:27:51,450 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:27:51,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:51,652 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:27:51,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:27:51,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1135042114, now seen corresponding path program 1 times [2024-11-05 20:27:51,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:27:51,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [997346152] [2024-11-05 20:27:51,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:27:51,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:27:51,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:27:51,655 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:27:51,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-05 20:27:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:27:51,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-05 20:27:51,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:27:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:54,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:27:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:27:56,391 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:27:56,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [997346152] [2024-11-05 20:27:56,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [997346152] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:27:56,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:27:56,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2024-11-05 20:27:56,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383380796] [2024-11-05 20:27:56,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:27:56,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-05 20:27:56,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:27:56,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-05 20:27:56,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2024-11-05 20:27:56,394 INFO L87 Difference]: Start difference. First operand 1259 states and 1571 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:31,771 INFO L93 Difference]: Finished difference Result 6595 states and 8032 transitions. [2024-11-05 20:28:31,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2024-11-05 20:28:31,772 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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 74 [2024-11-05 20:28:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:31,790 INFO L225 Difference]: With dead ends: 6595 [2024-11-05 20:28:31,790 INFO L226 Difference]: Without dead ends: 5810 [2024-11-05 20:28:31,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17458 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=6889, Invalid=49517, Unknown=0, NotChecked=0, Total=56406 [2024-11-05 20:28:31,801 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 2118 mSDsluCounter, 13120 mSDsCounter, 0 mSdLazyCounter, 7066 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2118 SdHoareTripleChecker+Valid, 13720 SdHoareTripleChecker+Invalid, 7349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 7066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:31,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2118 Valid, 13720 Invalid, 7349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 7066 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-05 20:28:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5810 states. [2024-11-05 20:28:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5810 to 3481. [2024-11-05 20:28:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3481 states, 3480 states have (on average 1.2494252873563219) internal successors, (4348), 3480 states have internal predecessors, (4348), 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:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 4348 transitions. [2024-11-05 20:28:32,154 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 4348 transitions. Word has length 74 [2024-11-05 20:28:32,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:32,155 INFO L471 AbstractCegarLoop]: Abstraction has 3481 states and 4348 transitions. [2024-11-05 20:28:32,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 4348 transitions. [2024-11-05 20:28:32,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-05 20:28:32,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:32,159 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-05 20:28:32,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-05 20:28:32,359 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:32,360 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:32,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:32,361 INFO L85 PathProgramCache]: Analyzing trace with hash -777616002, now seen corresponding path program 1 times [2024-11-05 20:28:32,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:32,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1831854025] [2024-11-05 20:28:32,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:32,361 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:32,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:32,362 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:32,363 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:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:32,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-05 20:28:32,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:28:35,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:28:37,048 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:37,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1831854025] [2024-11-05 20:28:37,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1831854025] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:28:37,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:28:37,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2024-11-05 20:28:37,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814752548] [2024-11-05 20:28:37,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:28:37,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-05 20:28:37,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:37,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-05 20:28:37,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1933, Unknown=0, NotChecked=0, Total=2070 [2024-11-05 20:28:37,050 INFO L87 Difference]: Start difference. First operand 3481 states and 4348 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:54,129 INFO L93 Difference]: Finished difference Result 7767 states and 9535 transitions. [2024-11-05 20:28:54,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-11-05 20:28:54,130 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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 74 [2024-11-05 20:28:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:54,144 INFO L225 Difference]: With dead ends: 7767 [2024-11-05 20:28:54,145 INFO L226 Difference]: Without dead ends: 6135 [2024-11-05 20:28:54,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4526 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=2278, Invalid=16904, Unknown=0, NotChecked=0, Total=19182 [2024-11-05 20:28:54,150 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 1284 mSDsluCounter, 7535 mSDsCounter, 0 mSdLazyCounter, 4210 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 7926 SdHoareTripleChecker+Invalid, 4316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 4210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:54,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 7926 Invalid, 4316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 4210 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-05 20:28:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6135 states. [2024-11-05 20:28:54,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6135 to 3863. [2024-11-05 20:28:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3863 states, 3862 states have (on average 1.2496116002071465) internal successors, (4826), 3862 states have internal predecessors, (4826), 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,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 4826 transitions. [2024-11-05 20:28:54,529 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 4826 transitions. Word has length 74 [2024-11-05 20:28:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:54,530 INFO L471 AbstractCegarLoop]: Abstraction has 3863 states and 4826 transitions. [2024-11-05 20:28:54,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 4826 transitions. [2024-11-05 20:28:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-05 20:28:54,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:54,534 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,538 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:54,734 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:54,735 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:54,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:54,735 INFO L85 PathProgramCache]: Analyzing trace with hash -325967649, now seen corresponding path program 1 times [2024-11-05 20:28:54,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:54,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [537156872] [2024-11-05 20:28:54,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:54,736 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,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:54,737 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:54,739 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:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:54,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 20:28:54,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 14 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:28:54,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:28:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 14 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:28:54,976 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:28:54,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [537156872] [2024-11-05 20:28:54,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [537156872] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:28:54,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:28:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-05 20:28:54,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042372130] [2024-11-05 20:28:54,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:28:54,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 20:28:54,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:28:54,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 20:28:54,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-05 20:28:54,977 INFO L87 Difference]: Start difference. First operand 3863 states and 4826 transitions. Second operand has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:28:56,095 INFO L93 Difference]: Finished difference Result 14410 states and 19233 transitions. [2024-11-05 20:28:56,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 20:28:56,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-05 20:28:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:28:56,114 INFO L225 Difference]: With dead ends: 14410 [2024-11-05 20:28:56,114 INFO L226 Difference]: Without dead ends: 7805 [2024-11-05 20:28:56,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2024-11-05 20:28:56,122 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 260 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 20:28:56,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 174 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 20:28:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7805 states. [2024-11-05 20:28:56,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7805 to 5200. [2024-11-05 20:28:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 5199 states have (on average 1.169070975187536) internal successors, (6078), 5199 states have internal predecessors, (6078), 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,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 6078 transitions. [2024-11-05 20:28:56,592 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 6078 transitions. Word has length 76 [2024-11-05 20:28:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:28:56,593 INFO L471 AbstractCegarLoop]: Abstraction has 5200 states and 6078 transitions. [2024-11-05 20:28:56,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 20:28:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 6078 transitions. [2024-11-05 20:28:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-05 20:28:56,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:28:56,595 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 20:28:56,598 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:56,796 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:56,796 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:28:56,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:28:56,797 INFO L85 PathProgramCache]: Analyzing trace with hash 881251465, now seen corresponding path program 1 times [2024-11-05 20:28:56,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:28:56,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1567183386] [2024-11-05 20:28:56,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:28:56,797 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,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:28:56,800 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:56,802 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:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:28:56,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-05 20:28:56,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:28:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 20:28:59,865 INFO L311 TraceCheckSpWp]: Computing backward predicates...