/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/loop-invariants/linear-inequality-inv-a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 23:57:04,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 23:57:04,989 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-24 23:57:04,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 23:57:04,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 23:57:05,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 23:57:05,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 23:57:05,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 23:57:05,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 23:57:05,020 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 23:57:05,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 23:57:05,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 23:57:05,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 23:57:05,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 23:57:05,023 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 23:57:05,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 23:57:05,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 23:57:05,023 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 23:57:05,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 23:57:05,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 23:57:05,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 23:57:05,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 23:57:05,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 23:57:05,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 23:57:05,025 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 23:57:05,026 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 23:57:05,026 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 23:57:05,026 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 23:57:05,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 23:57:05,026 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 23:57:05,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 23:57:05,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 23:57:05,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 23:57:05,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 23:57:05,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 23:57:05,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 23:57:05,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 23:57:05,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 23:57:05,028 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 23:57:05,028 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 23:57:05,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 23:57:05,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 23:57:05,028 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 23:57:05,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 23:57:05,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 23:57:05,029 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 23:57:05,029 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-24 23:57:05,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 23:57:05,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 23:57:05,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 23:57:05,255 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 23:57:05,255 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 23:57:05,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c [2023-12-24 23:57:06,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 23:57:06,477 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 23:57:06,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c [2023-12-24 23:57:06,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc532ef9e/15f97ca1978f4b958a466af2ed24c051/FLAGeca22f532 [2023-12-24 23:57:06,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc532ef9e/15f97ca1978f4b958a466af2ed24c051 [2023-12-24 23:57:06,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 23:57:06,502 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 23:57:06,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 23:57:06,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 23:57:06,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 23:57:06,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 11:57:06" (1/1) ... [2023-12-24 23:57:06,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cee475b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:57:06, skipping insertion in model container [2023-12-24 23:57:06,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 11:57:06" (1/1) ... [2023-12-24 23:57:06,523 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 23:57:06,664 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c[860,873] [2023-12-24 23:57:06,667 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c[916,929] [2023-12-24 23:57:06,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 23:57:06,677 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 23:57:06,687 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c[860,873] [2023-12-24 23:57:06,688 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-a.c[916,929] [2023-12-24 23:57:06,688 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 23:57:06,702 INFO L206 MainTranslator]: Completed translation [2023-12-24 23:57:06,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:57:06 WrapperNode [2023-12-24 23:57:06,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 23:57:06,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 23:57:06,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 23:57:06,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 23:57:06,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:57:06" (1/1) ... [2023-12-24 23:57:06,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:57:06" (1/1) ... [2023-12-24 23:57:06,730 INFO L138 Inliner]: procedures = 11, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2023-12-24 23:57:06,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 23:57:06,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 23:57:06,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 23:57:06,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 23:57:06,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:57:06" (1/1) ... [2023-12-24 23:57:06,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:57:06" (1/1) ... [2023-12-24 23:57:06,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:57:06" (1/1) ... [2023-12-24 23:57:06,746 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-24 23:57:06,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:57:06" (1/1) ... [2023-12-24 23:57:06,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:57:06" (1/1) ... [2023-12-24 23:57:06,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:57:06" (1/1) ... [2023-12-24 23:57:06,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:57:06" (1/1) ... [2023-12-24 23:57:06,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:57:06" (1/1) ... [2023-12-24 23:57:06,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:57:06" (1/1) ... [2023-12-24 23:57:06,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 23:57:06,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 23:57:06,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 23:57:06,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 23:57:06,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:57:06" (1/1) ... [2023-12-24 23:57:06,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 23:57:06,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 23:57:06,813 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-24 23:57:06,862 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-24 23:57:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 23:57:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 23:57:06,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 23:57:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 23:57:06,949 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 23:57:06,951 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 23:57:07,071 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 23:57:07,091 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 23:57:07,091 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 23:57:07,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 11:57:07 BoogieIcfgContainer [2023-12-24 23:57:07,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 23:57:07,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 23:57:07,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 23:57:07,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 23:57:07,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 11:57:06" (1/3) ... [2023-12-24 23:57:07,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456f50fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 11:57:07, skipping insertion in model container [2023-12-24 23:57:07,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:57:06" (2/3) ... [2023-12-24 23:57:07,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456f50fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 11:57:07, skipping insertion in model container [2023-12-24 23:57:07,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 11:57:07" (3/3) ... [2023-12-24 23:57:07,114 INFO L112 eAbstractionObserver]: Analyzing ICFG linear-inequality-inv-a.c [2023-12-24 23:57:07,125 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 23:57:07,126 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-24 23:57:07,162 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 23:57:07,168 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;@2f60a69a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 23:57:07,169 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-24 23:57:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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-24 23:57:07,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-24 23:57:07,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:57:07,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-24 23:57:07,180 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:57:07,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:57:07,185 INFO L85 PathProgramCache]: Analyzing trace with hash 63025968, now seen corresponding path program 1 times [2023-12-24 23:57:07,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:57:07,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975907942] [2023-12-24 23:57:07,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:57:07,194 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-24 23:57:07,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:57:07,196 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-24 23:57:07,203 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-24 23:57:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:57:07,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 23:57:07,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:57:07,258 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-24 23:57:07,258 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 23:57:07,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:57:07,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975907942] [2023-12-24 23:57:07,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975907942] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 23:57:07,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 23:57:07,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 23:57:07,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539338424] [2023-12-24 23:57:07,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 23:57:07,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 23:57:07,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:57:07,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 23:57:07,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 23:57:07,280 INFO L87 Difference]: Start difference. First operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-24 23:57:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:57:07,291 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2023-12-24 23:57:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 23:57:07,293 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-24 23:57:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:57:07,297 INFO L225 Difference]: With dead ends: 19 [2023-12-24 23:57:07,297 INFO L226 Difference]: Without dead ends: 9 [2023-12-24 23:57:07,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-24 23:57:07,301 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 23:57:07,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 23:57:07,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-24 23:57:07,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-12-24 23:57:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 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-24 23:57:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-12-24 23:57:07,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2023-12-24 23:57:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:57:07,319 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-12-24 23:57:07,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-24 23:57:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-12-24 23:57:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-24 23:57:07,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:57:07,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-24 23:57:07,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 23:57:07,522 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-24 23:57:07,523 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:57:07,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:57:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash 63022124, now seen corresponding path program 1 times [2023-12-24 23:57:07,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:57:07,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320902542] [2023-12-24 23:57:07,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:57:07,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:57:07,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:57:07,525 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-24 23:57:07,527 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-24 23:57:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:57:07,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 23:57:07,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:57:07,587 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-24 23:57:07,588 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 23:57:07,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:57:07,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320902542] [2023-12-24 23:57:07,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320902542] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 23:57:07,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 23:57:07,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 23:57:07,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10996183] [2023-12-24 23:57:07,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 23:57:07,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 23:57:07,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:57:07,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 23:57:07,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 23:57:07,590 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-24 23:57:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:57:07,606 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2023-12-24 23:57:07,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 23:57:07,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-24 23:57:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:57:07,608 INFO L225 Difference]: With dead ends: 16 [2023-12-24 23:57:07,609 INFO L226 Difference]: Without dead ends: 14 [2023-12-24 23:57:07,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-24 23:57:07,610 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 23:57:07,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 23:57:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-24 23:57:07,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2023-12-24 23:57:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:57:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-12-24 23:57:07,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 5 [2023-12-24 23:57:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:57:07,613 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-12-24 23:57:07,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-24 23:57:07,613 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-12-24 23:57:07,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-24 23:57:07,613 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:57:07,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-24 23:57:07,617 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-24 23:57:07,816 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-24 23:57:07,817 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:57:07,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:57:07,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1953737730, now seen corresponding path program 1 times [2023-12-24 23:57:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:57:07,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823250594] [2023-12-24 23:57:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:57:07,819 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-24 23:57:07,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:57:07,820 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-24 23:57:07,823 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-24 23:57:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:57:07,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 23:57:07,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:57:07,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:57:07,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:57:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:57:07,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:57:07,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823250594] [2023-12-24 23:57:07,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823250594] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:57:07,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:57:07,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-24 23:57:07,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205907663] [2023-12-24 23:57:07,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:57:07,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 23:57:07,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:57:07,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 23:57:07,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 23:57:07,949 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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-24 23:57:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:57:08,033 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-12-24 23:57:08,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 23:57:08,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 6 [2023-12-24 23:57:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:57:08,034 INFO L225 Difference]: With dead ends: 26 [2023-12-24 23:57:08,034 INFO L226 Difference]: Without dead ends: 18 [2023-12-24 23:57:08,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-12-24 23:57:08,035 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 23:57:08,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 15 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 23:57:08,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-24 23:57:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2023-12-24 23:57:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:57:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-12-24 23:57:08,040 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 6 [2023-12-24 23:57:08,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:57:08,040 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-12-24 23:57:08,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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-24 23:57:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-12-24 23:57:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-24 23:57:08,041 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:57:08,041 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-12-24 23:57:08,043 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-24 23:57:08,243 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-24 23:57:08,243 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:57:08,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:57:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash 642862704, now seen corresponding path program 1 times [2023-12-24 23:57:08,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:57:08,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406080591] [2023-12-24 23:57:08,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:57:08,251 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-24 23:57:08,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:57:08,260 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-24 23:57:08,262 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-24 23:57:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:57:08,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 23:57:08,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:57:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:57:08,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:57:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:57:08,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:57:08,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406080591] [2023-12-24 23:57:08,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406080591] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:57:08,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:57:08,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-24 23:57:08,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610434094] [2023-12-24 23:57:08,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:57:08,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 23:57:08,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:57:08,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 23:57:08,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-12-24 23:57:08,454 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-24 23:57:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:57:09,533 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2023-12-24 23:57:09,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 23:57:09,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 8 [2023-12-24 23:57:09,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:57:09,534 INFO L225 Difference]: With dead ends: 25 [2023-12-24 23:57:09,534 INFO L226 Difference]: Without dead ends: 17 [2023-12-24 23:57:09,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-12-24 23:57:09,535 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-24 23:57:09,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 14 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-24 23:57:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-24 23:57:09,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2023-12-24 23:57:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:57:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2023-12-24 23:57:09,539 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 8 [2023-12-24 23:57:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:57:09,539 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2023-12-24 23:57:09,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-24 23:57:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2023-12-24 23:57:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 23:57:09,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:57:09,539 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2023-12-24 23:57:09,548 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-24 23:57:09,741 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-24 23:57:09,742 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:57:09,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:57:09,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1544558164, now seen corresponding path program 2 times [2023-12-24 23:57:09,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:57:09,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716438358] [2023-12-24 23:57:09,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 23:57:09,743 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-24 23:57:09,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:57:09,744 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-24 23:57:09,748 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-24 23:57:09,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 23:57:09,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 23:57:09,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 23:57:09,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:57:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:57:11,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:57:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:57:11,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:57:11,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716438358] [2023-12-24 23:57:11,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716438358] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:57:11,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:57:11,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-24 23:57:11,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51283442] [2023-12-24 23:57:11,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:57:11,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 23:57:11,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:57:11,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 23:57:11,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2023-12-24 23:57:11,391 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:57:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:57:12,808 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2023-12-24 23:57:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 23:57:12,808 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-24 23:57:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:57:12,809 INFO L225 Difference]: With dead ends: 36 [2023-12-24 23:57:12,809 INFO L226 Difference]: Without dead ends: 32 [2023-12-24 23:57:12,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=150, Invalid=230, Unknown=0, NotChecked=0, Total=380 [2023-12-24 23:57:12,815 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 34 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-24 23:57:12,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 20 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-24 23:57:12,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-24 23:57:12,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2023-12-24 23:57:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:57:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-24 23:57:12,820 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 9 [2023-12-24 23:57:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:57:12,820 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-24 23:57:12,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:57:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-24 23:57:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 23:57:12,821 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:57:12,821 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2023-12-24 23:57:12,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 23:57:13,027 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-24 23:57:13,028 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:57:13,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:57:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1896146704, now seen corresponding path program 2 times [2023-12-24 23:57:13,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:57:13,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536075355] [2023-12-24 23:57:13,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 23:57:13,029 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-24 23:57:13,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:57:13,030 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-24 23:57:13,031 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-24 23:57:13,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 23:57:13,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 23:57:13,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 23:57:13,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:57:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:57:30,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:57:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:57:31,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:57:31,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536075355] [2023-12-24 23:57:31,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536075355] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:57:31,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:57:31,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-24 23:57:31,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963685077] [2023-12-24 23:57:31,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:57:31,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 23:57:31,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:57:31,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 23:57:31,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=120, Unknown=3, NotChecked=0, Total=240 [2023-12-24 23:57:31,717 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 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-24 23:57:44,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 23:57:45,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 23:57:52,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:57:52,049 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2023-12-24 23:57:52,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 23:57:52,049 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-24 23:57:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:57:52,051 INFO L225 Difference]: With dead ends: 41 [2023-12-24 23:57:52,051 INFO L226 Difference]: Without dead ends: 27 [2023-12-24 23:57:52,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=146, Invalid=154, Unknown=6, NotChecked=0, Total=306 [2023-12-24 23:57:52,052 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2023-12-24 23:57:52,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 18 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 11.6s Time] [2023-12-24 23:57:52,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-24 23:57:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2023-12-24 23:57:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 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-24 23:57:52,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-12-24 23:57:52,059 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 12 [2023-12-24 23:57:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:57:52,059 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-12-24 23:57:52,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 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-24 23:57:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-12-24 23:57:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-24 23:57:52,060 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:57:52,060 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2023-12-24 23:57:52,065 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-24 23:57:52,260 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-24 23:57:52,260 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:57:52,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:57:52,261 INFO L85 PathProgramCache]: Analyzing trace with hash 779725292, now seen corresponding path program 3 times [2023-12-24 23:57:52,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:57:52,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123870594] [2023-12-24 23:57:52,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 23:57:52,261 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-24 23:57:52,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:57:52,263 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-24 23:57:52,263 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-24 23:57:52,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-24 23:57:52,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 23:57:52,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 23:57:52,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:59:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 54 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:59:17,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:59:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:59:23,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:59:23,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123870594] [2023-12-24 23:59:23,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123870594] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:59:23,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:59:23,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-12-24 23:59:23,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134316161] [2023-12-24 23:59:23,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:59:23,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 23:59:23,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:59:23,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 23:59:23,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=305, Unknown=17, NotChecked=0, Total=552 [2023-12-24 23:59:23,319 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 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-25 00:00:02,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:00:33,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:00:50,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:00:53,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:00:57,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:01:03,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-25 00:01:12,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:01:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:12,513 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2023-12-25 00:01:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-25 00:01:12,521 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 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 15 [2023-12-25 00:01:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:12,522 INFO L225 Difference]: With dead ends: 66 [2023-12-25 00:01:12,522 INFO L226 Difference]: Without dead ends: 60 [2023-12-25 00:01:12,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 176.6s TimeCoverageRelationStatistics Valid=698, Invalid=1161, Unknown=33, NotChecked=0, Total=1892 [2023-12-25 00:01:12,523 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 71 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:12,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 39 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 23.3s Time] [2023-12-25 00:01:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-25 00:01:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2023-12-25 00:01:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 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-25 00:01:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2023-12-25 00:01:12,545 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 15 [2023-12-25 00:01:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:12,546 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-12-25 00:01:12,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 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-25 00:01:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2023-12-25 00:01:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-25 00:01:12,546 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:12,546 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1] [2023-12-25 00:01:12,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 00:01:12,751 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-25 00:01:12,751 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:12,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:12,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1915940336, now seen corresponding path program 3 times [2023-12-25 00:01:12,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:12,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259658690] [2023-12-25 00:01:12,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 00:01:12,757 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-25 00:01:12,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:12,760 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-25 00:01:12,767 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-25 00:01:12,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-12-25 00:01:12,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:01:12,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 00:01:12,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:07:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 87 refuted. 18 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:07:33,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:08:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:08:09,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:08:09,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259658690] [2023-12-25 00:08:09,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259658690] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:08:09,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:08:09,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-12-25 00:08:09,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193165103] [2023-12-25 00:08:09,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:08:09,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 00:08:09,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:08:09,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 00:08:09,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=478, Unknown=85, NotChecked=0, Total=992 [2023-12-25 00:08:09,832 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:08:34,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:08:51,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:09:06,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:09:23,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:09:37,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:09:49,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:10:03,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:10:25,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:10:29,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:10:57,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:11:01,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:11:39,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:11:42,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:11:46,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:11:50,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:11:54,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] Received shutdown request... [2023-12-25 00:11:56,289 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-25 00:11:56,289 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 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 00:11:57,295 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-25 00:11:57,490 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 00:11:57,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-25 00:11:57,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 585.9s TimeCoverageRelationStatistics Valid=802, Invalid=980, Unknown=110, NotChecked=0, Total=1892 [2023-12-25 00:11:57,505 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.8s IncrementalHoareTripleChecker+Time [2023-12-25 00:11:57,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 54.8s Time] [2023-12-25 00:11:57,506 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-25 00:11:57,506 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-25 00:11:57,507 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-25 00:11:57,509 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1] [2023-12-25 00:11:57,511 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 00:11:57,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 12:11:57 BoogieIcfgContainer [2023-12-25 00:11:57,512 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 00:11:57,513 INFO L158 Benchmark]: Toolchain (without parser) took 891011.12ms. Allocated memory is still 282.1MB. Free memory was 239.0MB in the beginning and 115.2MB in the end (delta: 123.8MB). Peak memory consumption was 124.9MB. Max. memory is 8.0GB. [2023-12-25 00:11:57,513 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 215.0MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 00:11:57,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.36ms. Allocated memory is still 282.1MB. Free memory was 238.4MB in the beginning and 227.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 00:11:57,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.09ms. Allocated memory is still 282.1MB. Free memory was 227.4MB in the beginning and 226.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 00:11:57,514 INFO L158 Benchmark]: Boogie Preprocessor took 26.23ms. Allocated memory is still 282.1MB. Free memory was 226.4MB in the beginning and 224.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 00:11:57,514 INFO L158 Benchmark]: RCFGBuilder took 350.62ms. Allocated memory is still 282.1MB. Free memory was 224.3MB in the beginning and 214.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 00:11:57,515 INFO L158 Benchmark]: TraceAbstraction took 890402.72ms. Allocated memory is still 282.1MB. Free memory was 213.3MB in the beginning and 115.2MB in the end (delta: 98.1MB). Peak memory consumption was 98.6MB. Max. memory is 8.0GB. [2023-12-25 00:11:57,515 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.50ms. Allocated memory is still 215.0MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.36ms. Allocated memory is still 282.1MB. Free memory was 238.4MB in the beginning and 227.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.09ms. Allocated memory is still 282.1MB. Free memory was 227.4MB in the beginning and 226.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.23ms. Allocated memory is still 282.1MB. Free memory was 226.4MB in the beginning and 224.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 350.62ms. Allocated memory is still 282.1MB. Free memory was 224.3MB in the beginning and 214.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 890402.72ms. Allocated memory is still 282.1MB. Free memory was 213.3MB in the beginning and 115.2MB in the end (delta: 98.1MB). Peak memory consumption was 98.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: 29]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 29). Cancelled while executing Executor. - TimeoutResultAtElement [Line: 25]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 25). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 890.4s, OverallIterations: 8, TraceHistogramMax: 14, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 359.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 92.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 91.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 197 IncrementalHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 44 mSDtfsCounter, 197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 791.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=7, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 51 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 528.6s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 136 ConstructedInterpolants, 81 QuantifiedInterpolants, 1430 SizeOfPredicates, 45 NumberOfNonLiveVariables, 266 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 0/390 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