/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 07:57:12,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 07:57:12,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 07:57:12,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 07:57:12,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 07:57:12,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 07:57:12,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 07:57:12,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 07:57:12,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 07:57:12,469 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 07:57:12,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 07:57:12,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 07:57:12,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 07:57:12,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 07:57:12,472 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 07:57:12,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 07:57:12,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 07:57:12,472 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 07:57:12,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 07:57:12,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 07:57:12,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 07:57:12,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 07:57:12,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 07:57:12,474 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 07:57:12,474 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 07:57:12,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 07:57:12,475 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 07:57:12,475 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 07:57:12,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 07:57:12,475 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 07:57:12,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 07:57:12,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 07:57:12,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 07:57:12,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 07:57:12,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:57:12,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 07:57:12,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 07:57:12,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 07:57:12,477 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 07:57:12,477 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 07:57:12,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 07:57:12,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 07:57:12,477 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 07:57:12,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 07:57:12,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 07:57:12,478 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 07:57:12,478 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 [2023-12-16 07:57:12,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 07:57:12,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 07:57:12,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 07:57:12,684 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 07:57:12,685 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 07:57:12,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2023-12-16 07:57:13,687 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 07:57:14,018 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 07:57:14,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2023-12-16 07:57:14,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951967fac/f32ffd138eee492aa28e7e3776d95f8b/FLAG64e3f28bd [2023-12-16 07:57:14,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951967fac/f32ffd138eee492aa28e7e3776d95f8b [2023-12-16 07:57:14,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 07:57:14,067 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 07:57:14,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 07:57:14,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 07:57:14,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 07:57:14,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:57:14" (1/1) ... [2023-12-16 07:57:14,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@656944d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:57:14, skipping insertion in model container [2023-12-16 07:57:14,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:57:14" (1/1) ... [2023-12-16 07:57:14,182 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 07:57:14,458 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[11742,11755] [2023-12-16 07:57:14,531 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[19490,19503] [2023-12-16 07:57:15,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:57:15,027 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 07:57:15,062 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[11742,11755] [2023-12-16 07:57:15,071 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[19490,19503] [2023-12-16 07:57:15,403 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:57:15,422 INFO L206 MainTranslator]: Completed translation [2023-12-16 07:57:15,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:57:15 WrapperNode [2023-12-16 07:57:15,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 07:57:15,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 07:57:15,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 07:57:15,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 07:57:15,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:57:15" (1/1) ... [2023-12-16 07:57:15,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:57:15" (1/1) ... [2023-12-16 07:57:15,573 INFO L138 Inliner]: procedures = 38, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5066 [2023-12-16 07:57:15,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 07:57:15,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 07:57:15,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 07:57:15,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 07:57:15,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:57:15" (1/1) ... [2023-12-16 07:57:15,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:57:15" (1/1) ... [2023-12-16 07:57:15,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:57:15" (1/1) ... [2023-12-16 07:57:15,757 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]. [2023-12-16 07:57:15,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:57:15" (1/1) ... [2023-12-16 07:57:15,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:57:15" (1/1) ... [2023-12-16 07:57:15,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:57:15" (1/1) ... [2023-12-16 07:57:15,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:57:15" (1/1) ... [2023-12-16 07:57:15,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:57:15" (1/1) ... [2023-12-16 07:57:15,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:57:15" (1/1) ... [2023-12-16 07:57:15,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 07:57:15,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 07:57:15,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 07:57:15,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 07:57:15,993 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:57:15" (1/1) ... [2023-12-16 07:57:15,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:57:16,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 07:57:16,024 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) [2023-12-16 07:57:16,033 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 [2023-12-16 07:57:16,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 07:57:16,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 07:57:16,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 07:57:16,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 07:57:16,128 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 07:57:16,129 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 07:57:40,067 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 07:57:40,111 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 07:57:40,111 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 07:57:40,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:57:40 BoogieIcfgContainer [2023-12-16 07:57:40,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 07:57:40,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 07:57:40,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 07:57:40,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 07:57:40,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:57:14" (1/3) ... [2023-12-16 07:57:40,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64aedc3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:57:40, skipping insertion in model container [2023-12-16 07:57:40,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:57:15" (2/3) ... [2023-12-16 07:57:40,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64aedc3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:57:40, skipping insertion in model container [2023-12-16 07:57:40,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:57:40" (3/3) ... [2023-12-16 07:57:40,117 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2023-12-16 07:57:40,128 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 07:57:40,128 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-16 07:57:40,182 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 07:57:40,187 INFO L357 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, mHoare=true, 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;@23e3e77c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 07:57:40,188 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-16 07:57:40,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 834 states, 831 states have (on average 1.9759326113116726) internal successors, (1642), 833 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 07:57:40,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:57:40,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:57:40,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:57:40,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:57:40,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1603356568, now seen corresponding path program 1 times [2023-12-16 07:57:40,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:57:40,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86845628] [2023-12-16 07:57:40,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:57:40,219 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 [2023-12-16 07:57:40,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:57:40,221 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) [2023-12-16 07:57:40,267 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 [2023-12-16 07:57:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:57:40,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 07:57:40,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:57:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:57:40,359 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:57:40,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:57:40,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86845628] [2023-12-16 07:57:40,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86845628] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:57:40,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:57:40,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:57:40,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120545533] [2023-12-16 07:57:40,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:57:40,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 07:57:40,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:57:40,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 07:57:40,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 07:57:40,386 INFO L87 Difference]: Start difference. First operand has 834 states, 831 states have (on average 1.9759326113116726) internal successors, (1642), 833 states have internal predecessors, (1642), 0 states have call successors, (0), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:57:40,458 INFO L93 Difference]: Finished difference Result 1632 states and 3215 transitions. [2023-12-16 07:57:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 07:57:40,460 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-12-16 07:57:40,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:57:40,477 INFO L225 Difference]: With dead ends: 1632 [2023-12-16 07:57:40,477 INFO L226 Difference]: Without dead ends: 830 [2023-12-16 07:57:40,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 07:57:40,484 INFO L413 NwaCegarLoop]: 1570 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1570 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 [2023-12-16 07:57:40,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1570 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:57:40,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2023-12-16 07:57:40,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2023-12-16 07:57:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 1.8973429951690821) internal successors, (1571), 829 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) [2023-12-16 07:57:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1571 transitions. [2023-12-16 07:57:40,543 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1571 transitions. Word has length 21 [2023-12-16 07:57:40,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:57:40,543 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 1571 transitions. [2023-12-16 07:57:40,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:40,544 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1571 transitions. [2023-12-16 07:57:40,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 07:57:40,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:57:40,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:57:40,559 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 [2023-12-16 07:57:40,752 WARN L477 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 [2023-12-16 07:57:40,753 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:57:40,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:57:40,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1103262826, now seen corresponding path program 1 times [2023-12-16 07:57:40,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:57:40,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627479267] [2023-12-16 07:57:40,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:57:40,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:57:40,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:57:40,755 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) [2023-12-16 07:57:40,761 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 [2023-12-16 07:57:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:57:40,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 07:57:40,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:57:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:57:40,844 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:57:40,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:57:40,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627479267] [2023-12-16 07:57:40,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627479267] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:57:40,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:57:40,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:57:40,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548941029] [2023-12-16 07:57:40,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:57:40,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:57:40,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:57:40,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:57:40,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:57:40,847 INFO L87 Difference]: Start difference. First operand 830 states and 1571 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:57:40,915 INFO L93 Difference]: Finished difference Result 874 states and 1640 transitions. [2023-12-16 07:57:40,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:57:40,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-12-16 07:57:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:57:40,918 INFO L225 Difference]: With dead ends: 874 [2023-12-16 07:57:40,918 INFO L226 Difference]: Without dead ends: 830 [2023-12-16 07:57:40,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:57:40,919 INFO L413 NwaCegarLoop]: 1568 mSDtfsCounter, 0 mSDsluCounter, 3101 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4669 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:57:40,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4669 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:57:40,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2023-12-16 07:57:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2023-12-16 07:57:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 1.8599033816425121) internal successors, (1540), 829 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1540 transitions. [2023-12-16 07:57:40,936 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1540 transitions. Word has length 21 [2023-12-16 07:57:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:57:40,936 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 1540 transitions. [2023-12-16 07:57:40,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1540 transitions. [2023-12-16 07:57:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-16 07:57:40,937 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:57:40,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:57:40,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 07:57:41,140 WARN L477 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 [2023-12-16 07:57:41,142 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:57:41,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:57:41,143 INFO L85 PathProgramCache]: Analyzing trace with hash 51546625, now seen corresponding path program 1 times [2023-12-16 07:57:41,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:57:41,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363007569] [2023-12-16 07:57:41,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:57:41,144 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 [2023-12-16 07:57:41,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:57:41,145 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) [2023-12-16 07:57:41,151 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 [2023-12-16 07:57:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:57:41,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 07:57:41,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:57:41,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:57:41,836 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:57:41,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:57:41,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363007569] [2023-12-16 07:57:41,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363007569] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:57:41,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:57:41,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 07:57:41,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311926936] [2023-12-16 07:57:41,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:57:41,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 07:57:41,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:57:41,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 07:57:41,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-16 07:57:41,839 INFO L87 Difference]: Start difference. First operand 830 states and 1540 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:42,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:57:42,082 INFO L93 Difference]: Finished difference Result 1076 states and 1936 transitions. [2023-12-16 07:57:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 07:57:42,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-12-16 07:57:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:57:42,087 INFO L225 Difference]: With dead ends: 1076 [2023-12-16 07:57:42,087 INFO L226 Difference]: Without dead ends: 1035 [2023-12-16 07:57:42,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-16 07:57:42,088 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 3234 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3234 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:57:42,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3234 Valid, 1997 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:57:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2023-12-16 07:57:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 908. [2023-12-16 07:57:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 906 states have (on average 1.8399558498896247) internal successors, (1667), 907 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1667 transitions. [2023-12-16 07:57:42,105 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1667 transitions. Word has length 51 [2023-12-16 07:57:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:57:42,106 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1667 transitions. [2023-12-16 07:57:42,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1667 transitions. [2023-12-16 07:57:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 07:57:42,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:57:42,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:57:42,120 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 [2023-12-16 07:57:42,310 WARN L477 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 [2023-12-16 07:57:42,313 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:57:42,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:57:42,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2145916561, now seen corresponding path program 1 times [2023-12-16 07:57:42,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:57:42,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766051710] [2023-12-16 07:57:42,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:57:42,314 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 [2023-12-16 07:57:42,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:57:42,315 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) [2023-12-16 07:57:42,317 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 [2023-12-16 07:57:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:57:42,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:57:42,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:57:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:57:42,465 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:57:42,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:57:42,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766051710] [2023-12-16 07:57:42,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766051710] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:57:42,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:57:42,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:57:42,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920846327] [2023-12-16 07:57:42,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:57:42,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:57:42,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:57:42,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:57:42,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:57:42,467 INFO L87 Difference]: Start difference. First operand 908 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:57:42,509 INFO L93 Difference]: Finished difference Result 1130 states and 2025 transitions. [2023-12-16 07:57:42,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:57:42,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-12-16 07:57:42,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:57:42,514 INFO L225 Difference]: With dead ends: 1130 [2023-12-16 07:57:42,514 INFO L226 Difference]: Without dead ends: 1011 [2023-12-16 07:57:42,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:57:42,518 INFO L413 NwaCegarLoop]: 1536 mSDtfsCounter, 1480 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:57:42,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1596 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:57:42,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2023-12-16 07:57:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1009. [2023-12-16 07:57:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1007 states have (on average 1.8133068520357498) internal successors, (1826), 1008 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1826 transitions. [2023-12-16 07:57:42,541 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1826 transitions. Word has length 53 [2023-12-16 07:57:42,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:57:42,541 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1826 transitions. [2023-12-16 07:57:42,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1826 transitions. [2023-12-16 07:57:42,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-16 07:57:42,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:57:42,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:57:42,551 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 (5)] Forceful destruction successful, exit code 0 [2023-12-16 07:57:42,748 WARN L477 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 [2023-12-16 07:57:42,750 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:57:42,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:57:42,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2036322024, now seen corresponding path program 1 times [2023-12-16 07:57:42,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:57:42,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925640929] [2023-12-16 07:57:42,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:57:42,751 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 [2023-12-16 07:57:42,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:57:42,752 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) [2023-12-16 07:57:42,775 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 [2023-12-16 07:57:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:57:42,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 07:57:42,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:57:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:57:42,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:57:42,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:57:42,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925640929] [2023-12-16 07:57:42,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925640929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:57:42,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:57:42,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:57:42,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357001079] [2023-12-16 07:57:42,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:57:42,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:57:42,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:57:42,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:57:42,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:57:42,835 INFO L87 Difference]: Start difference. First operand 1009 states and 1826 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:57:42,880 INFO L93 Difference]: Finished difference Result 1023 states and 1843 transitions. [2023-12-16 07:57:42,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:57:42,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2023-12-16 07:57:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:57:42,884 INFO L225 Difference]: With dead ends: 1023 [2023-12-16 07:57:42,884 INFO L226 Difference]: Without dead ends: 1021 [2023-12-16 07:57:42,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:57:42,884 INFO L413 NwaCegarLoop]: 1536 mSDtfsCounter, 1 mSDsluCounter, 3064 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4600 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:57:42,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4600 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:57:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2023-12-16 07:57:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1017. [2023-12-16 07:57:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1015 states have (on average 1.805911330049261) internal successors, (1833), 1016 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1833 transitions. [2023-12-16 07:57:42,899 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1833 transitions. Word has length 54 [2023-12-16 07:57:42,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:57:42,899 INFO L495 AbstractCegarLoop]: Abstraction has 1017 states and 1833 transitions. [2023-12-16 07:57:42,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1833 transitions. [2023-12-16 07:57:42,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 07:57:42,900 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:57:42,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:57:42,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-16 07:57:43,102 WARN L477 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 [2023-12-16 07:57:43,103 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:57:43,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:57:43,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1922958665, now seen corresponding path program 1 times [2023-12-16 07:57:43,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:57:43,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400367219] [2023-12-16 07:57:43,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:57:43,104 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 [2023-12-16 07:57:43,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:57:43,105 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) [2023-12-16 07:57:43,105 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 [2023-12-16 07:57:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:57:43,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:57:43,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:57:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:57:43,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:57:43,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:57:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400367219] [2023-12-16 07:57:43,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400367219] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:57:43,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:57:43,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:57:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722642048] [2023-12-16 07:57:43,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:57:43,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:57:43,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:57:43,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:57:43,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:57:43,232 INFO L87 Difference]: Start difference. First operand 1017 states and 1833 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:57:43,262 INFO L93 Difference]: Finished difference Result 1257 states and 2213 transitions. [2023-12-16 07:57:43,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:57:43,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2023-12-16 07:57:43,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:57:43,265 INFO L225 Difference]: With dead ends: 1257 [2023-12-16 07:57:43,265 INFO L226 Difference]: Without dead ends: 1132 [2023-12-16 07:57:43,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:57:43,268 INFO L413 NwaCegarLoop]: 1587 mSDtfsCounter, 1494 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:57:43,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1653 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:57:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2023-12-16 07:57:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1130. [2023-12-16 07:57:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1128 states have (on average 1.7810283687943262) internal successors, (2009), 1129 states have internal predecessors, (2009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:43,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 2009 transitions. [2023-12-16 07:57:43,285 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 2009 transitions. Word has length 55 [2023-12-16 07:57:43,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:57:43,285 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 2009 transitions. [2023-12-16 07:57:43,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:43,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 2009 transitions. [2023-12-16 07:57:43,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 07:57:43,286 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:57:43,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:57:43,291 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 [2023-12-16 07:57:43,489 WARN L477 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 [2023-12-16 07:57:43,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:57:43,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:57:43,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1694319433, now seen corresponding path program 1 times [2023-12-16 07:57:43,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:57:43,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387487672] [2023-12-16 07:57:43,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:57:43,490 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 [2023-12-16 07:57:43,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:57:43,491 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) [2023-12-16 07:57:43,492 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 [2023-12-16 07:57:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:57:43,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:57:43,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:57:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:57:43,647 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:57:43,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:57:43,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387487672] [2023-12-16 07:57:43,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387487672] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:57:43,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:57:43,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:57:43,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307583387] [2023-12-16 07:57:43,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:57:43,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:57:43,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:57:43,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:57:43,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:57:43,648 INFO L87 Difference]: Start difference. First operand 1130 states and 2009 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:43,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:57:43,677 INFO L93 Difference]: Finished difference Result 1772 states and 3012 transitions. [2023-12-16 07:57:43,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:57:43,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2023-12-16 07:57:43,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:57:43,682 INFO L225 Difference]: With dead ends: 1772 [2023-12-16 07:57:43,682 INFO L226 Difference]: Without dead ends: 1433 [2023-12-16 07:57:43,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:57:43,683 INFO L413 NwaCegarLoop]: 1579 mSDtfsCounter, 1490 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:57:43,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1653 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:57:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2023-12-16 07:57:43,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1431. [2023-12-16 07:57:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1429 states have (on average 1.72778166550035) internal successors, (2469), 1430 states have internal predecessors, (2469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2469 transitions. [2023-12-16 07:57:43,702 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2469 transitions. Word has length 55 [2023-12-16 07:57:43,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:57:43,702 INFO L495 AbstractCegarLoop]: Abstraction has 1431 states and 2469 transitions. [2023-12-16 07:57:43,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:43,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2469 transitions. [2023-12-16 07:57:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 07:57:43,702 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:57:43,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:57:43,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-16 07:57:43,905 WARN L477 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 [2023-12-16 07:57:43,906 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:57:43,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:57:43,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1068663369, now seen corresponding path program 1 times [2023-12-16 07:57:43,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:57:43,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188729317] [2023-12-16 07:57:43,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:57:43,907 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 [2023-12-16 07:57:43,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:57:43,908 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) [2023-12-16 07:57:43,909 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 [2023-12-16 07:57:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:57:43,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:57:43,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:57:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:57:44,012 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:57:44,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:57:44,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188729317] [2023-12-16 07:57:44,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188729317] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:57:44,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:57:44,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:57:44,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627257425] [2023-12-16 07:57:44,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:57:44,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:57:44,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:57:44,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:57:44,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:57:44,013 INFO L87 Difference]: Start difference. First operand 1431 states and 2469 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:57:44,052 INFO L93 Difference]: Finished difference Result 2639 states and 4329 transitions. [2023-12-16 07:57:44,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:57:44,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2023-12-16 07:57:44,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:57:44,058 INFO L225 Difference]: With dead ends: 2639 [2023-12-16 07:57:44,058 INFO L226 Difference]: Without dead ends: 1999 [2023-12-16 07:57:44,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:57:44,060 INFO L413 NwaCegarLoop]: 1577 mSDtfsCounter, 1488 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:57:44,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1655 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:57:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2023-12-16 07:57:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1997. [2023-12-16 07:57:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1995 states have (on average 1.66265664160401) internal successors, (3317), 1996 states have internal predecessors, (3317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 3317 transitions. [2023-12-16 07:57:44,090 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 3317 transitions. Word has length 55 [2023-12-16 07:57:44,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:57:44,091 INFO L495 AbstractCegarLoop]: Abstraction has 1997 states and 3317 transitions. [2023-12-16 07:57:44,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 3317 transitions. [2023-12-16 07:57:44,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 07:57:44,092 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:57:44,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:57:44,098 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 [2023-12-16 07:57:44,298 WARN L477 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 [2023-12-16 07:57:44,299 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:57:44,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:57:44,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1957396809, now seen corresponding path program 1 times [2023-12-16 07:57:44,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:57:44,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126719140] [2023-12-16 07:57:44,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:57:44,300 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 [2023-12-16 07:57:44,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:57:44,301 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) [2023-12-16 07:57:44,336 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 [2023-12-16 07:57:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:57:44,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:57:44,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:57:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:57:44,420 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:57:44,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:57:44,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126719140] [2023-12-16 07:57:44,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126719140] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:57:44,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:57:44,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:57:44,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642606731] [2023-12-16 07:57:44,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:57:44,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:57:44,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:57:44,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:57:44,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:57:44,421 INFO L87 Difference]: Start difference. First operand 1997 states and 3317 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:44,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:57:44,468 INFO L93 Difference]: Finished difference Result 4265 states and 6747 transitions. [2023-12-16 07:57:44,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:57:44,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2023-12-16 07:57:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:57:44,477 INFO L225 Difference]: With dead ends: 4265 [2023-12-16 07:57:44,477 INFO L226 Difference]: Without dead ends: 3059 [2023-12-16 07:57:44,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:57:44,482 INFO L413 NwaCegarLoop]: 1575 mSDtfsCounter, 1486 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:57:44,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1657 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:57:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2023-12-16 07:57:44,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 3057. [2023-12-16 07:57:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3057 states, 3055 states have (on average 1.5937806873977087) internal successors, (4869), 3056 states have internal predecessors, (4869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 4869 transitions. [2023-12-16 07:57:44,534 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 4869 transitions. Word has length 55 [2023-12-16 07:57:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:57:44,534 INFO L495 AbstractCegarLoop]: Abstraction has 3057 states and 4869 transitions. [2023-12-16 07:57:44,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:44,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 4869 transitions. [2023-12-16 07:57:44,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 07:57:44,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:57:44,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:57:44,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 07:57:44,738 WARN L477 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 [2023-12-16 07:57:44,739 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:57:44,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:57:44,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1654375497, now seen corresponding path program 1 times [2023-12-16 07:57:44,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:57:44,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912612634] [2023-12-16 07:57:44,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:57:44,740 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 [2023-12-16 07:57:44,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:57:44,741 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) [2023-12-16 07:57:44,756 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 [2023-12-16 07:57:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:57:44,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:57:44,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:57:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:57:44,856 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:57:44,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:57:44,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912612634] [2023-12-16 07:57:44,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912612634] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:57:44,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:57:44,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:57:44,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916388016] [2023-12-16 07:57:44,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:57:44,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:57:44,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:57:44,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:57:44,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:57:44,857 INFO L87 Difference]: Start difference. First operand 3057 states and 4869 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:57:44,931 INFO L93 Difference]: Finished difference Result 7301 states and 11151 transitions. [2023-12-16 07:57:44,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:57:44,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2023-12-16 07:57:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:57:44,945 INFO L225 Difference]: With dead ends: 7301 [2023-12-16 07:57:44,945 INFO L226 Difference]: Without dead ends: 5035 [2023-12-16 07:57:44,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:57:44,949 INFO L413 NwaCegarLoop]: 1589 mSDtfsCounter, 1492 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:57:44,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1659 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:57:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5035 states. [2023-12-16 07:57:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5035 to 5033. [2023-12-16 07:57:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5033 states, 5031 states have (on average 1.5275293182269927) internal successors, (7685), 5032 states have internal predecessors, (7685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5033 states to 5033 states and 7685 transitions. [2023-12-16 07:57:45,042 INFO L78 Accepts]: Start accepts. Automaton has 5033 states and 7685 transitions. Word has length 55 [2023-12-16 07:57:45,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:57:45,042 INFO L495 AbstractCegarLoop]: Abstraction has 5033 states and 7685 transitions. [2023-12-16 07:57:45,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:57:45,042 INFO L276 IsEmpty]: Start isEmpty. Operand 5033 states and 7685 transitions. [2023-12-16 07:57:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-16 07:57:45,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:57:45,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:57:45,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 07:57:45,249 WARN L477 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 [2023-12-16 07:57:45,249 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:57:45,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:57:45,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1483191019, now seen corresponding path program 1 times [2023-12-16 07:57:45,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:57:45,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523554364] [2023-12-16 07:57:45,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:57:45,250 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 [2023-12-16 07:57:45,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:57:45,252 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) [2023-12-16 07:57:45,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 07:57:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:57:45,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:57:45,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:57:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:57:45,411 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:57:45,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:57:45,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523554364] [2023-12-16 07:57:45,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523554364] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:57:45,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:57:45,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:57:45,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132932198] [2023-12-16 07:57:45,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:57:45,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:57:45,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:57:45,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:57:45,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:57:45,413 INFO L87 Difference]: Start difference. First operand 5033 states and 7685 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:58:16,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:58:16,520 INFO L93 Difference]: Finished difference Result 6537 states and 10558 transitions. [2023-12-16 07:58:16,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:58:16,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2023-12-16 07:58:16,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:58:16,533 INFO L225 Difference]: With dead ends: 6537 [2023-12-16 07:58:16,533 INFO L226 Difference]: Without dead ends: 5784 [2023-12-16 07:58:16,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:58:16,535 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 831 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.9s IncrementalHoareTripleChecker+Time [2023-12-16 07:58:16,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 645 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 30.9s Time] [2023-12-16 07:58:16,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2023-12-16 07:58:16,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 5784. [2023-12-16 07:58:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5784 states, 5782 states have (on average 1.4859910065721205) internal successors, (8592), 5783 states have internal predecessors, (8592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:58:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 8592 transitions. [2023-12-16 07:58:16,643 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 8592 transitions. Word has length 66 [2023-12-16 07:58:16,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:58:16,643 INFO L495 AbstractCegarLoop]: Abstraction has 5784 states and 8592 transitions. [2023-12-16 07:58:16,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:58:16,643 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 8592 transitions. [2023-12-16 07:58:16,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-16 07:58:16,647 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:58:16,647 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:58:16,652 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 [2023-12-16 07:58:16,850 WARN L477 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 [2023-12-16 07:58:16,850 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:58:16,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:58:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash 285878162, now seen corresponding path program 1 times [2023-12-16 07:58:16,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:58:16,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061990983] [2023-12-16 07:58:16,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:58:16,851 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 [2023-12-16 07:58:16,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:58:16,852 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) [2023-12-16 07:58:16,872 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 [2023-12-16 07:58:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:58:16,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 07:58:16,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:58:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:58:17,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:58:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:58:17,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:58:17,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061990983] [2023-12-16 07:58:17,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061990983] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:58:17,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:58:17,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-16 07:58:17,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427235554] [2023-12-16 07:58:17,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:58:17,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 07:58:17,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:58:17,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 07:58:17,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-16 07:58:17,851 INFO L87 Difference]: Start difference. First operand 5784 states and 8592 transitions. Second operand has 16 states, 16 states have (on average 8.25) internal successors, (132), 16 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:58:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:58:19,626 INFO L93 Difference]: Finished difference Result 15122 states and 22101 transitions. [2023-12-16 07:58:19,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 07:58:19,627 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 16 states have internal predecessors, (132), 0 states have call successors, (0), 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 73 [2023-12-16 07:58:19,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:58:19,655 INFO L225 Difference]: With dead ends: 15122 [2023-12-16 07:58:19,656 INFO L226 Difference]: Without dead ends: 12144 [2023-12-16 07:58:19,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2023-12-16 07:58:19,662 INFO L413 NwaCegarLoop]: 1543 mSDtfsCounter, 3621 mSDsluCounter, 10849 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3621 SdHoareTripleChecker+Valid, 12392 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:58:19,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3621 Valid, 12392 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 07:58:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12144 states. [2023-12-16 07:58:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12144 to 10024. [2023-12-16 07:58:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10024 states, 10022 states have (on average 1.471961684294552) internal successors, (14752), 10023 states have internal predecessors, (14752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:58:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10024 states to 10024 states and 14752 transitions. [2023-12-16 07:58:19,947 INFO L78 Accepts]: Start accepts. Automaton has 10024 states and 14752 transitions. Word has length 73 [2023-12-16 07:58:19,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:58:19,947 INFO L495 AbstractCegarLoop]: Abstraction has 10024 states and 14752 transitions. [2023-12-16 07:58:19,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 16 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:58:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 10024 states and 14752 transitions. [2023-12-16 07:58:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-16 07:58:19,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:58:19,949 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:58:19,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-16 07:58:20,152 WARN L477 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 [2023-12-16 07:58:20,153 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:58:20,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:58:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash 57238930, now seen corresponding path program 1 times [2023-12-16 07:58:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:58:20,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780639083] [2023-12-16 07:58:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:58:20,154 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 [2023-12-16 07:58:20,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:58:20,156 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) [2023-12-16 07:58:20,156 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 [2023-12-16 07:58:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:58:20,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:58:20,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:58:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:58:20,261 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:58:20,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:58:20,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780639083] [2023-12-16 07:58:20,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780639083] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:58:20,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:58:20,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:58:20,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577117046] [2023-12-16 07:58:20,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:58:20,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:58:20,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:58:20,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:58:20,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:58:20,262 INFO L87 Difference]: Start difference. First operand 10024 states and 14752 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:58:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:58:20,370 INFO L93 Difference]: Finished difference Result 15998 states and 23557 transitions. [2023-12-16 07:58:20,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:58:20,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2023-12-16 07:58:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:58:20,382 INFO L225 Difference]: With dead ends: 15998 [2023-12-16 07:58:20,382 INFO L226 Difference]: Without dead ends: 7516 [2023-12-16 07:58:20,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:58:20,391 INFO L413 NwaCegarLoop]: 1577 mSDtfsCounter, 47 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3103 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:58:20,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3103 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:58:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7516 states. [2023-12-16 07:58:20,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7516 to 7509. [2023-12-16 07:58:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7509 states, 7507 states have (on average 1.4766218196350074) internal successors, (11085), 7508 states have internal predecessors, (11085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:58:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7509 states to 7509 states and 11085 transitions. [2023-12-16 07:58:20,521 INFO L78 Accepts]: Start accepts. Automaton has 7509 states and 11085 transitions. Word has length 73 [2023-12-16 07:58:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:58:20,521 INFO L495 AbstractCegarLoop]: Abstraction has 7509 states and 11085 transitions. [2023-12-16 07:58:20,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:58:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 7509 states and 11085 transitions. [2023-12-16 07:58:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-16 07:58:20,522 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:58:20,523 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:58:20,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-16 07:58:20,728 WARN L477 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 [2023-12-16 07:58:20,729 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:58:20,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:58:20,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1433078630, now seen corresponding path program 1 times [2023-12-16 07:58:20,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:58:20,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344381151] [2023-12-16 07:58:20,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:58:20,730 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 [2023-12-16 07:58:20,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:58:20,730 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) [2023-12-16 07:58:20,732 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 [2023-12-16 07:58:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:58:20,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:58:20,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:58:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:58:20,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:58:20,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:58:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344381151] [2023-12-16 07:58:20,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344381151] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:58:20,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:58:20,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:58:20,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685955701] [2023-12-16 07:58:20,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:58:20,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:58:20,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:58:20,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:58:20,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:58:20,840 INFO L87 Difference]: Start difference. First operand 7509 states and 11085 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:58:20,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:58:20,907 INFO L93 Difference]: Finished difference Result 10489 states and 15431 transitions. [2023-12-16 07:58:20,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:58:20,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2023-12-16 07:58:20,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:58:20,914 INFO L225 Difference]: With dead ends: 10489 [2023-12-16 07:58:20,914 INFO L226 Difference]: Without dead ends: 4535 [2023-12-16 07:58:20,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:58:20,919 INFO L413 NwaCegarLoop]: 1570 mSDtfsCounter, 43 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:58:20,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3088 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:58:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2023-12-16 07:58:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4533. [2023-12-16 07:58:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4533 states, 4531 states have (on average 1.4771573604060915) internal successors, (6693), 4532 states have internal predecessors, (6693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:58:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4533 states to 4533 states and 6693 transitions. [2023-12-16 07:58:21,034 INFO L78 Accepts]: Start accepts. Automaton has 4533 states and 6693 transitions. Word has length 75 [2023-12-16 07:58:21,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:58:21,035 INFO L495 AbstractCegarLoop]: Abstraction has 4533 states and 6693 transitions. [2023-12-16 07:58:21,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:58:21,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4533 states and 6693 transitions. [2023-12-16 07:58:21,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-16 07:58:21,035 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:58:21,036 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:58:21,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-16 07:58:21,238 WARN L477 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 [2023-12-16 07:58:21,239 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:58:21,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:58:21,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1221061864, now seen corresponding path program 1 times [2023-12-16 07:58:21,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:58:21,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485407309] [2023-12-16 07:58:21,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:58:21,240 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 [2023-12-16 07:58:21,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:58:21,241 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) [2023-12-16 07:58:21,241 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 [2023-12-16 07:58:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:58:21,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 07:58:21,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:58:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:58:22,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:58:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:58:22,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:58:22,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485407309] [2023-12-16 07:58:22,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485407309] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:58:22,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:58:22,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-16 07:58:22,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552522697] [2023-12-16 07:58:22,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:58:22,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 07:58:22,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:58:22,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 07:58:22,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-16 07:58:22,327 INFO L87 Difference]: Start difference. First operand 4533 states and 6693 transitions. Second operand has 16 states, 16 states have (on average 8.75) internal successors, (140), 16 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-16 07:58:22,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 07:58:22,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2023-12-16 07:58:22,496 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 53 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:58:22,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 410 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:58:22,497 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-16 07:58:22,499 WARN L340 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)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 07:58:22,504 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 [2023-12-16 07:58:22,527 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 07:58:22,701 WARN L477 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 [2023-12-16 07:58:22,702 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (4533states) and FLOYD_HOARE automaton (currently 7 states, 16 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-7-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-6-2-1 context. [2023-12-16 07:58:22,703 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-16 07:58:22,706 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:58:22,708 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 07:58:22,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:58:22 BoogieIcfgContainer [2023-12-16 07:58:22,712 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 07:58:22,713 INFO L158 Benchmark]: Toolchain (without parser) took 68645.78ms. Allocated memory was 292.6MB in the beginning and 811.6MB in the end (delta: 519.0MB). Free memory was 226.3MB in the beginning and 410.3MB in the end (delta: -184.0MB). Peak memory consumption was 335.8MB. Max. memory is 8.0GB. [2023-12-16 07:58:22,714 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 174.1MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 07:58:22,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1353.95ms. Allocated memory is still 292.6MB. Free memory was 226.3MB in the beginning and 202.4MB in the end (delta: 23.9MB). Peak memory consumption was 130.1MB. Max. memory is 8.0GB. [2023-12-16 07:58:22,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.64ms. Allocated memory is still 292.6MB. Free memory was 201.9MB in the beginning and 166.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-16 07:58:22,715 INFO L158 Benchmark]: Boogie Preprocessor took 417.38ms. Allocated memory was 292.6MB in the beginning and 439.4MB in the end (delta: 146.8MB). Free memory was 166.2MB in the beginning and 355.8MB in the end (delta: -189.5MB). Peak memory consumption was 42.2MB. Max. memory is 8.0GB. [2023-12-16 07:58:22,715 INFO L158 Benchmark]: RCFGBuilder took 24119.63ms. Allocated memory was 439.4MB in the beginning and 811.6MB in the end (delta: 372.2MB). Free memory was 355.8MB in the beginning and 651.0MB in the end (delta: -295.2MB). Peak memory consumption was 271.1MB. Max. memory is 8.0GB. [2023-12-16 07:58:22,716 INFO L158 Benchmark]: TraceAbstraction took 42599.19ms. Allocated memory is still 811.6MB. Free memory was 650.4MB in the beginning and 410.3MB in the end (delta: 240.1MB). Peak memory consumption was 239.6MB. Max. memory is 8.0GB. [2023-12-16 07:58:22,720 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 174.1MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1353.95ms. Allocated memory is still 292.6MB. Free memory was 226.3MB in the beginning and 202.4MB in the end (delta: 23.9MB). Peak memory consumption was 130.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 149.64ms. Allocated memory is still 292.6MB. Free memory was 201.9MB in the beginning and 166.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 417.38ms. Allocated memory was 292.6MB in the beginning and 439.4MB in the end (delta: 146.8MB). Free memory was 166.2MB in the beginning and 355.8MB in the end (delta: -189.5MB). Peak memory consumption was 42.2MB. Max. memory is 8.0GB. * RCFGBuilder took 24119.63ms. Allocated memory was 439.4MB in the beginning and 811.6MB in the end (delta: 372.2MB). Free memory was 355.8MB in the beginning and 651.0MB in the end (delta: -295.2MB). Peak memory consumption was 271.1MB. Max. memory is 8.0GB. * TraceAbstraction took 42599.19ms. Allocated memory is still 811.6MB. Free memory was 650.4MB in the beginning and 410.3MB in the end (delta: 240.1MB). Peak memory consumption was 239.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 436]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 436). Cancelled while NwaCegarLoop was constructing difference of abstraction (4533states) and FLOYD_HOARE automaton (currently 7 states, 16 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-7-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-6-2-1 context. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 652). Cancelled while NwaCegarLoop was constructing difference of abstraction (4533states) and FLOYD_HOARE automaton (currently 7 states, 16 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-7-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-6-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 834 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 42.5s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 34.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16760 SdHoareTripleChecker+Valid, 32.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16760 mSDsluCounter, 42347 SdHoareTripleChecker+Invalid, 26.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21307 mSDsCounter, 728 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3307 IncrementalHoareTripleChecker+Invalid, 4035 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 728 mSolverCounterUnsat, 21040 mSDtfsCounter, 3307 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 989 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10024occurred in iteration=12, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 2272 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 838 NumberOfCodeBlocks, 838 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 970 ConstructedInterpolants, 95 QuantifiedInterpolants, 5486 SizeOfPredicates, 25 NumberOfNonLiveVariables, 2383 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 74/86 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown