/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/array-tiling/rewnifrev.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 17:53:24,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 17:53:24,248 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-21 17:53:24,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 17:53:24,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 17:53:24,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 17:53:24,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 17:53:24,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 17:53:24,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 17:53:24,284 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 17:53:24,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 17:53:24,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 17:53:24,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 17:53:24,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 17:53:24,286 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 17:53:24,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 17:53:24,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 17:53:24,287 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 17:53:24,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 17:53:24,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 17:53:24,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 17:53:24,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 17:53:24,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 17:53:24,289 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 17:53:24,289 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 17:53:24,289 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 17:53:24,289 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 17:53:24,290 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 17:53:24,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 17:53:24,290 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 17:53:24,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 17:53:24,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 17:53:24,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 17:53:24,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 17:53:24,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 17:53:24,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 17:53:24,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 17:53:24,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 17:53:24,292 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 17:53:24,292 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 17:53:24,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 17:53:24,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 17:53:24,292 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 17:53:24,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 17:53:24,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 17:53:24,293 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 17:53:24,293 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-21 17:53:24,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 17:53:24,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 17:53:24,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 17:53:24,475 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 17:53:24,476 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 17:53:24,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewnifrev.c [2023-12-21 17:53:25,528 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 17:53:25,712 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 17:53:25,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewnifrev.c [2023-12-21 17:53:25,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73449ac6f/ddade817da294fb8a653e0f589586991/FLAGf1f559fd6 [2023-12-21 17:53:25,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73449ac6f/ddade817da294fb8a653e0f589586991 [2023-12-21 17:53:25,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 17:53:25,738 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 17:53:25,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 17:53:25,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 17:53:25,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 17:53:25,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:53:25" (1/1) ... [2023-12-21 17:53:25,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4639997b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:53:25, skipping insertion in model container [2023-12-21 17:53:25,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:53:25" (1/1) ... [2023-12-21 17:53:25,765 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 17:53:25,916 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewnifrev.c[400,413] [2023-12-21 17:53:25,934 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 17:53:25,948 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 17:53:25,958 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewnifrev.c[400,413] [2023-12-21 17:53:25,963 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 17:53:25,976 INFO L206 MainTranslator]: Completed translation [2023-12-21 17:53:25,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:53:25 WrapperNode [2023-12-21 17:53:25,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 17:53:25,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 17:53:25,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 17:53:25,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 17:53:25,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:53:25" (1/1) ... [2023-12-21 17:53:25,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:53:25" (1/1) ... [2023-12-21 17:53:26,012 INFO L138 Inliner]: procedures = 18, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2023-12-21 17:53:26,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 17:53:26,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 17:53:26,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 17:53:26,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 17:53:26,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:53:25" (1/1) ... [2023-12-21 17:53:26,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:53:25" (1/1) ... [2023-12-21 17:53:26,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:53:25" (1/1) ... [2023-12-21 17:53:26,037 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2023-12-21 17:53:26,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:53:25" (1/1) ... [2023-12-21 17:53:26,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:53:25" (1/1) ... [2023-12-21 17:53:26,043 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:53:25" (1/1) ... [2023-12-21 17:53:26,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:53:25" (1/1) ... [2023-12-21 17:53:26,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:53:25" (1/1) ... [2023-12-21 17:53:26,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:53:25" (1/1) ... [2023-12-21 17:53:26,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 17:53:26,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 17:53:26,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 17:53:26,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 17:53:26,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:53:25" (1/1) ... [2023-12-21 17:53:26,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 17:53:26,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 17:53:26,079 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-21 17:53:26,089 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-21 17:53:26,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 17:53:26,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 17:53:26,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 17:53:26,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 17:53:26,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 17:53:26,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 17:53:26,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 17:53:26,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 17:53:26,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 17:53:26,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 17:53:26,172 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 17:53:26,174 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 17:53:26,300 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 17:53:26,349 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 17:53:26,349 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-21 17:53:26,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:53:26 BoogieIcfgContainer [2023-12-21 17:53:26,350 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 17:53:26,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 17:53:26,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 17:53:26,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 17:53:26,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 05:53:25" (1/3) ... [2023-12-21 17:53:26,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff7314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:53:26, skipping insertion in model container [2023-12-21 17:53:26,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:53:25" (2/3) ... [2023-12-21 17:53:26,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff7314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:53:26, skipping insertion in model container [2023-12-21 17:53:26,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:53:26" (3/3) ... [2023-12-21 17:53:26,358 INFO L112 eAbstractionObserver]: Analyzing ICFG rewnifrev.c [2023-12-21 17:53:26,372 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 17:53:26,372 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 17:53:26,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 17:53:26,413 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;@268553ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 17:53:26,413 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 17:53:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 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-21 17:53:26,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-21 17:53:26,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:53:26,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:53:26,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:53:26,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:53:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1562928649, now seen corresponding path program 1 times [2023-12-21 17:53:26,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:53:26,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187278844] [2023-12-21 17:53:26,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:53:26,449 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-21 17:53:26,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:53:26,454 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-21 17:53:26,456 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-21 17:53:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:53:26,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 17:53:26,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:53:26,539 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-21 17:53:26,539 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:53:26,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:53:26,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187278844] [2023-12-21 17:53:26,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187278844] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:53:26,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:53:26,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 17:53:26,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403462794] [2023-12-21 17:53:26,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:53:26,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 17:53:26,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:53:26,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 17:53:26,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 17:53:26,579 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-21 17:53:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:53:26,598 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2023-12-21 17:53:26,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 17:53:26,601 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-12-21 17:53:26,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:53:26,606 INFO L225 Difference]: With dead ends: 23 [2023-12-21 17:53:26,606 INFO L226 Difference]: Without dead ends: 11 [2023-12-21 17:53:26,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-21 17:53:26,611 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:53:26,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:53:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-21 17:53:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-21 17:53:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 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-21 17:53:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-21 17:53:26,632 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2023-12-21 17:53:26,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:53:26,632 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-21 17:53:26,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-21 17:53:26,633 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-21 17:53:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-21 17:53:26,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:53:26,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:53:26,635 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-21 17:53:26,834 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-21 17:53:26,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:53:26,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:53:26,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1574934422, now seen corresponding path program 1 times [2023-12-21 17:53:26,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:53:26,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248510343] [2023-12-21 17:53:26,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:53:26,837 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-21 17:53:26,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:53:26,838 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-21 17:53:26,840 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-21 17:53:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:53:26,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 17:53:26,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:53:26,982 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-21 17:53:26,983 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:53:26,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:53:26,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248510343] [2023-12-21 17:53:26,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248510343] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:53:26,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:53:26,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 17:53:26,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707291336] [2023-12-21 17:53:26,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:53:26,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 17:53:26,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:53:26,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 17:53:26,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 17:53:26,986 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-21 17:53:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:53:27,042 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2023-12-21 17:53:27,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 17:53:27,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-12-21 17:53:27,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:53:27,044 INFO L225 Difference]: With dead ends: 23 [2023-12-21 17:53:27,044 INFO L226 Difference]: Without dead ends: 14 [2023-12-21 17:53:27,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 17:53:27,045 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:53:27,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 10 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:53:27,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-21 17:53:27,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2023-12-21 17:53:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 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-21 17:53:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-12-21 17:53:27,053 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2023-12-21 17:53:27,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:53:27,053 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-12-21 17:53:27,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-21 17:53:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-12-21 17:53:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 17:53:27,054 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:53:27,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:53:27,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-21 17:53:27,256 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-21 17:53:27,257 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:53:27,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:53:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash -994451034, now seen corresponding path program 1 times [2023-12-21 17:53:27,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:53:27,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721284011] [2023-12-21 17:53:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:53:27,259 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-21 17:53:27,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:53:27,260 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-21 17:53:27,268 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-21 17:53:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:53:27,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 17:53:27,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:53:27,386 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-21 17:53:27,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:53:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:53:27,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:53:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721284011] [2023-12-21 17:53:27,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721284011] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 17:53:27,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 17:53:27,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2023-12-21 17:53:27,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318032070] [2023-12-21 17:53:27,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:53:27,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 17:53:27,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:53:27,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 17:53:27,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 17:53:27,420 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-21 17:53:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:53:27,481 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-12-21 17:53:27,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 17:53:27,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 10 [2023-12-21 17:53:27,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:53:27,482 INFO L225 Difference]: With dead ends: 31 [2023-12-21 17:53:27,482 INFO L226 Difference]: Without dead ends: 25 [2023-12-21 17:53:27,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-21 17:53:27,484 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:53:27,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 15 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:53:27,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-21 17:53:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 15. [2023-12-21 17:53:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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-21 17:53:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-12-21 17:53:27,488 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2023-12-21 17:53:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:53:27,489 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-12-21 17:53:27,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-21 17:53:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-12-21 17:53:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 17:53:27,489 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:53:27,489 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:53:27,500 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-21 17:53:27,692 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-21 17:53:27,692 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:53:27,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:53:27,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1872132756, now seen corresponding path program 1 times [2023-12-21 17:53:27,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:53:27,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568950034] [2023-12-21 17:53:27,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:53:27,694 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-21 17:53:27,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:53:27,695 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-21 17:53:27,700 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-21 17:53:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:53:27,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-21 17:53:27,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:53:27,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-21 17:53:28,158 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 17:53:28,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:53:28,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 23 [2023-12-21 17:53:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:53:28,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:53:28,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-12-21 17:53:28,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-12-21 17:53:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 17:53:28,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:53:28,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568950034] [2023-12-21 17:53:28,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568950034] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 17:53:28,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 17:53:28,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2023-12-21 17:53:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543462239] [2023-12-21 17:53:28,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:53:28,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 17:53:28,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:53:28,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 17:53:28,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-12-21 17:53:28,371 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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-21 17:53:32,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:53:32,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:53:32,648 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2023-12-21 17:53:32,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 17:53:32,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-12-21 17:53:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:53:32,649 INFO L225 Difference]: With dead ends: 27 [2023-12-21 17:53:32,649 INFO L226 Difference]: Without dead ends: 25 [2023-12-21 17:53:32,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-12-21 17:53:32,650 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:53:32,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 20 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2023-12-21 17:53:32,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-21 17:53:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2023-12-21 17:53:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 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-21 17:53:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-12-21 17:53:32,655 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2023-12-21 17:53:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:53:32,655 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-12-21 17:53:32,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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-21 17:53:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-12-21 17:53:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-21 17:53:32,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:53:32,656 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:53:32,662 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-21 17:53:32,859 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-21 17:53:32,860 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:53:32,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:53:32,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1743708518, now seen corresponding path program 1 times [2023-12-21 17:53:32,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:53:32,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452568373] [2023-12-21 17:53:32,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:53:32,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:53:32,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:53:32,862 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-21 17:53:32,864 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-21 17:53:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:53:32,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 17:53:32,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:53:32,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-21 17:53:33,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-12-21 17:53:33,496 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 17:53:33,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:53:33,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 28 [2023-12-21 17:53:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:53:33,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:53:37,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-12-21 17:53:37,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 130 [2023-12-21 17:53:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:53:37,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:53:37,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452568373] [2023-12-21 17:53:37,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452568373] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:53:37,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:53:37,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-21 17:53:37,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940137984] [2023-12-21 17:53:37,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:53:37,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-21 17:53:37,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:53:37,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-21 17:53:37,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=206, Unknown=1, NotChecked=0, Total=272 [2023-12-21 17:53:37,892 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 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-21 17:53:51,337 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:53:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:53:52,923 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2023-12-21 17:53:52,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-21 17:53:52,923 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 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 16 [2023-12-21 17:53:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:53:52,924 INFO L225 Difference]: With dead ends: 54 [2023-12-21 17:53:52,924 INFO L226 Difference]: Without dead ends: 52 [2023-12-21 17:53:52,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=371, Invalid=1268, Unknown=1, NotChecked=0, Total=1640 [2023-12-21 17:53:52,926 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 125 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-21 17:53:52,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 35 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-21 17:53:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-21 17:53:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2023-12-21 17:53:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 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-21 17:53:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2023-12-21 17:53:52,933 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2023-12-21 17:53:52,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:53:52,934 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2023-12-21 17:53:52,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 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-21 17:53:52,934 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2023-12-21 17:53:52,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 17:53:52,934 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:53:52,934 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:53:52,937 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-21 17:53:53,147 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-21 17:53:53,147 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:53:53,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:53:53,148 INFO L85 PathProgramCache]: Analyzing trace with hash -803648724, now seen corresponding path program 2 times [2023-12-21 17:53:53,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:53:53,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292563445] [2023-12-21 17:53:53,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:53:53,148 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-21 17:53:53,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:53:53,150 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-21 17:53:53,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-21 17:53:53,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 17:53:53,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:53:53,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 17:53:53,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:53:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:53:53,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:53:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:53:53,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:53:53,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292563445] [2023-12-21 17:53:53,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292563445] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:53:53,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:53:53,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2023-12-21 17:53:53,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578792761] [2023-12-21 17:53:53,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:53:53,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 17:53:53,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:53:53,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 17:53:53,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2023-12-21 17:53:53,643 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:53:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:53:54,229 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2023-12-21 17:53:54,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-21 17:53:54,229 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-21 17:53:54,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:53:54,230 INFO L225 Difference]: With dead ends: 57 [2023-12-21 17:53:54,230 INFO L226 Difference]: Without dead ends: 25 [2023-12-21 17:53:54,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2023-12-21 17:53:54,231 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 17:53:54,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 40 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 17:53:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-21 17:53:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-12-21 17:53:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:53:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-12-21 17:53:54,241 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2023-12-21 17:53:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:53:54,241 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-12-21 17:53:54,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:53:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-12-21 17:53:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 17:53:54,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:53:54,242 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:53:54,247 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 (7)] Forceful destruction successful, exit code 0 [2023-12-21 17:53:54,442 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-21 17:53:54,442 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:53:54,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:53:54,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1443181976, now seen corresponding path program 3 times [2023-12-21 17:53:54,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:53:54,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322909554] [2023-12-21 17:53:54,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 17:53:54,444 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-21 17:53:54,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:53:54,445 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-21 17:53:54,448 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-21 17:53:54,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-21 17:53:54,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:53:54,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-21 17:53:54,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:53:54,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-21 17:53:54,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-21 17:53:54,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:53:54,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2023-12-21 17:53:54,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:53:54,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 47 [2023-12-21 17:53:55,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 17:53:55,587 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 17:53:55,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:53:55,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 33 [2023-12-21 17:53:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:53:55,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:54:04,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-21 17:54:04,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 134 [2023-12-21 17:54:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:54:04,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:54:04,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322909554] [2023-12-21 17:54:04,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322909554] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:54:04,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:54:04,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2023-12-21 17:54:04,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323677268] [2023-12-21 17:54:04,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:54:04,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-21 17:54:04,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:54:04,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-21 17:54:04,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=395, Unknown=2, NotChecked=0, Total=506 [2023-12-21 17:54:04,255 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:54:08,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:54:13,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:54:25,381 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:54:30,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:54:42,518 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:54:54,632 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:54:59,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:55:03,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:55:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:55:04,500 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2023-12-21 17:55:04,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-21 17:55:04,501 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-21 17:55:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:55:04,502 INFO L225 Difference]: With dead ends: 63 [2023-12-21 17:55:04,502 INFO L226 Difference]: Without dead ends: 61 [2023-12-21 17:55:04,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 47.0s TimeCoverageRelationStatistics Valid=570, Invalid=2290, Unknown=2, NotChecked=0, Total=2862 [2023-12-21 17:55:04,503 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 152 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 42 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2023-12-21 17:55:04,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 29 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 248 Invalid, 5 Unknown, 0 Unchecked, 22.2s Time] [2023-12-21 17:55:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-21 17:55:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 26. [2023-12-21 17:55:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 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-21 17:55:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-12-21 17:55:04,512 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2023-12-21 17:55:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:55:04,513 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-12-21 17:55:04,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:55:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2023-12-21 17:55:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 17:55:04,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:55:04,514 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:55:04,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-21 17:55:04,716 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-21 17:55:04,716 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:55:04,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:55:04,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1206277398, now seen corresponding path program 4 times [2023-12-21 17:55:04,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:55:04,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971627769] [2023-12-21 17:55:04,717 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 17:55:04,717 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-21 17:55:04,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:55:04,718 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-21 17:55:04,719 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-21 17:55:04,759 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 17:55:04,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:55:04,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 17:55:04,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:55:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:55:05,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:55:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:55:05,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:55:05,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971627769] [2023-12-21 17:55:05,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971627769] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:55:05,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:55:05,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-12-21 17:55:05,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160896087] [2023-12-21 17:55:05,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:55:05,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-21 17:55:05,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:55:05,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-21 17:55:05,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2023-12-21 17:55:05,465 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:55:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:55:06,460 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2023-12-21 17:55:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-21 17:55:06,460 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-21 17:55:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:55:06,461 INFO L225 Difference]: With dead ends: 74 [2023-12-21 17:55:06,461 INFO L226 Difference]: Without dead ends: 34 [2023-12-21 17:55:06,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=449, Invalid=1357, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 17:55:06,462 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 58 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 17:55:06,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 61 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 17:55:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-21 17:55:06,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2023-12-21 17:55:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 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-21 17:55:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-12-21 17:55:06,476 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2023-12-21 17:55:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:55:06,476 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-12-21 17:55:06,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:55:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-12-21 17:55:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 17:55:06,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:55:06,477 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:55:06,483 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-21 17:55:06,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:55:06,684 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:55:06,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:55:06,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2104111834, now seen corresponding path program 5 times [2023-12-21 17:55:06,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:55:06,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132235646] [2023-12-21 17:55:06,684 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 17:55:06,684 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-21 17:55:06,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:55:06,685 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:55:06,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-21 17:55:06,758 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-12-21 17:55:06,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:55:06,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 17:55:06,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:55:06,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-21 17:55:06,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-21 17:55:06,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:55:06,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2023-12-21 17:55:06,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:55:06,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 60 [2023-12-21 17:55:07,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:55:07,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 63 [2023-12-21 17:55:07,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:55:07,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 63 [2023-12-21 17:55:08,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 17:55:08,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 17:55:08,229 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 17:55:08,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 17:55:08,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:55:08,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 38 [2023-12-21 17:55:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:55:08,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:55:21,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2023-12-21 17:55:21,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19442 treesize of output 19186 [2023-12-21 17:55:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:55:21,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:55:21,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132235646] [2023-12-21 17:55:21,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132235646] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:55:21,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:55:21,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2023-12-21 17:55:21,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951034981] [2023-12-21 17:55:21,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:55:21,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 17:55:21,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:55:21,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 17:55:21,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=584, Unknown=3, NotChecked=0, Total=756 [2023-12-21 17:55:21,043 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:55:25,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:55:31,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:55:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:55:32,678 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2023-12-21 17:55:32,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-21 17:55:32,679 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-21 17:55:32,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:55:32,680 INFO L225 Difference]: With dead ends: 50 [2023-12-21 17:55:32,680 INFO L226 Difference]: Without dead ends: 48 [2023-12-21 17:55:32,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=549, Invalid=1898, Unknown=3, NotChecked=0, Total=2450 [2023-12-21 17:55:32,681 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 97 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 31 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2023-12-21 17:55:32,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 30 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 282 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2023-12-21 17:55:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-21 17:55:32,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2023-12-21 17:55:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 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-21 17:55:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2023-12-21 17:55:32,693 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2023-12-21 17:55:32,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:55:32,693 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2023-12-21 17:55:32,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:55:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2023-12-21 17:55:32,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-21 17:55:32,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:55:32,694 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:55:32,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-21 17:55:32,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:55:32,898 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:55:32,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:55:32,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1457375084, now seen corresponding path program 6 times [2023-12-21 17:55:32,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:55:32,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111955499] [2023-12-21 17:55:32,898 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 17:55:32,898 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-21 17:55:32,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:55:32,900 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:55:32,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-21 17:55:32,978 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-12-21 17:55:32,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:55:32,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 17:55:32,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:55:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:55:33,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:55:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:55:34,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:55:34,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111955499] [2023-12-21 17:55:34,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111955499] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:55:34,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:55:34,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 17:55:34,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090241074] [2023-12-21 17:55:34,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:55:34,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 17:55:34,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:55:34,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 17:55:34,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2023-12-21 17:55:34,041 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 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-21 17:55:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:55:35,627 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2023-12-21 17:55:35,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-21 17:55:35,627 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 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 31 [2023-12-21 17:55:35,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:55:35,627 INFO L225 Difference]: With dead ends: 95 [2023-12-21 17:55:35,627 INFO L226 Difference]: Without dead ends: 43 [2023-12-21 17:55:35,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=656, Invalid=2206, Unknown=0, NotChecked=0, Total=2862 [2023-12-21 17:55:35,629 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 67 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 17:55:35,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 86 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 17:55:35,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-21 17:55:35,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2023-12-21 17:55:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:55:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2023-12-21 17:55:35,638 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 31 [2023-12-21 17:55:35,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:55:35,639 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2023-12-21 17:55:35,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 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-21 17:55:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2023-12-21 17:55:35,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 17:55:35,639 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:55:35,640 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:55:35,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-21 17:55:35,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:55:35,843 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:55:35,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:55:35,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1311657128, now seen corresponding path program 7 times [2023-12-21 17:55:35,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:55:35,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101772795] [2023-12-21 17:55:35,843 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 17:55:35,844 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-21 17:55:35,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:55:35,844 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:55:35,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-21 17:55:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:55:35,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-21 17:55:35,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:55:35,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-21 17:55:36,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-21 17:55:36,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:55:36,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2023-12-21 17:55:36,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:55:36,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 60 [2023-12-21 17:55:36,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:55:36,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 63 [2023-12-21 17:55:36,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:55:36,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 76 [2023-12-21 17:55:36,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:55:36,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 79 [2023-12-21 17:55:37,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:55:37,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 79 [2023-12-21 17:55:38,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 17:55:38,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 17:55:38,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 17:55:38,594 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 17:55:38,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:55:38,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 43 [2023-12-21 17:55:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:55:38,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:55:56,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2023-12-21 17:55:56,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2418 treesize of output 2402 [2023-12-21 17:55:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 20 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:55:56,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:55:56,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101772795] [2023-12-21 17:55:56,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101772795] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:55:56,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:55:56,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 33 [2023-12-21 17:55:56,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216165598] [2023-12-21 17:55:56,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:55:56,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-21 17:55:56,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:55:56,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-21 17:55:56,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=844, Unknown=4, NotChecked=0, Total=1056 [2023-12-21 17:55:56,154 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 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-21 17:56:01,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:56:06,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:56:43,917 WARN L293 SmtUtils]: Spent 36.15s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:56:48,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:56:52,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:56:56,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:56:57,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:57:09,638 WARN L293 SmtUtils]: Spent 12.09s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:57:21,894 WARN L293 SmtUtils]: Spent 12.09s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:57:26,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:57:31,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:57:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:57:33,500 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2023-12-21 17:57:33,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-21 17:57:33,501 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 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 34 [2023-12-21 17:57:33,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:57:33,501 INFO L225 Difference]: With dead ends: 87 [2023-12-21 17:57:33,501 INFO L226 Difference]: Without dead ends: 85 [2023-12-21 17:57:33,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1546 ImplicationChecksByTransitivity, 83.6s TimeCoverageRelationStatistics Valid=1018, Invalid=4678, Unknown=4, NotChecked=0, Total=5700 [2023-12-21 17:57:33,504 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 201 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 52 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2023-12-21 17:57:33,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 55 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 594 Invalid, 7 Unknown, 0 Unchecked, 32.4s Time] [2023-12-21 17:57:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-21 17:57:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 38. [2023-12-21 17:57:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 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-21 17:57:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2023-12-21 17:57:33,537 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2023-12-21 17:57:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:57:33,538 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2023-12-21 17:57:33,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 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-21 17:57:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2023-12-21 17:57:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-21 17:57:33,538 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:57:33,538 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:57:33,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-21 17:57:33,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:57:33,740 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:57:33,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:57:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash -29622102, now seen corresponding path program 8 times [2023-12-21 17:57:33,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:57:33,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029945163] [2023-12-21 17:57:33,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:57:33,741 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-21 17:57:33,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:57:33,743 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:57:33,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-21 17:57:33,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 17:57:33,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:57:33,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-21 17:57:33,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:57:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 5 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:57:34,415 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:57:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 14 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:57:35,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:57:35,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029945163] [2023-12-21 17:57:35,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029945163] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:57:35,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:57:35,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-12-21 17:57:35,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20860716] [2023-12-21 17:57:35,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:57:35,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-21 17:57:35,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:57:35,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-21 17:57:35,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2023-12-21 17:57:35,139 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 29 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 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-21 17:57:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:57:37,602 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2023-12-21 17:57:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-21 17:57:37,602 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-12-21 17:57:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:57:37,603 INFO L225 Difference]: With dead ends: 116 [2023-12-21 17:57:37,603 INFO L226 Difference]: Without dead ends: 52 [2023-12-21 17:57:37,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=900, Invalid=3006, Unknown=0, NotChecked=0, Total=3906 [2023-12-21 17:57:37,605 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 85 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 17:57:37,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 95 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 17:57:37,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-21 17:57:37,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2023-12-21 17:57:37,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:57:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2023-12-21 17:57:37,623 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 37 [2023-12-21 17:57:37,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:57:37,624 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2023-12-21 17:57:37,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 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-21 17:57:37,624 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2023-12-21 17:57:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-21 17:57:37,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:57:37,625 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:57:37,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-21 17:57:37,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:57:37,831 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:57:37,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:57:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1011525862, now seen corresponding path program 9 times [2023-12-21 17:57:37,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:57:37,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461884141] [2023-12-21 17:57:37,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 17:57:37,832 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-21 17:57:37,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:57:37,833 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:57:37,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-21 17:57:38,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-12-21 17:57:38,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:57:38,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-21 17:57:38,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:57:38,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-21 17:57:38,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-21 17:57:38,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:57:38,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2023-12-21 17:57:38,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:57:38,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 60 [2023-12-21 17:57:38,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:57:38,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 63 [2023-12-21 17:57:38,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:57:38,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 76 [2023-12-21 17:57:38,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:57:38,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 79 [2023-12-21 17:57:38,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:57:38,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 92 [2023-12-21 17:57:39,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:57:39,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 95 [2023-12-21 17:57:39,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:57:39,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 90 treesize of output 95 [2023-12-21 17:57:42,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 17:57:42,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 17:57:42,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 17:57:42,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 17:57:42,233 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 17:57:42,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:57:42,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 99 treesize of output 48 [2023-12-21 17:57:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 4 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:57:42,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:58:04,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2023-12-21 17:58:04,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9714 treesize of output 9682 [2023-12-21 17:58:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 25 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:58:04,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:58:04,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461884141] [2023-12-21 17:58:04,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461884141] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:58:04,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:58:04,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 38 [2023-12-21 17:58:04,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677343224] [2023-12-21 17:58:04,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:58:04,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-21 17:58:04,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:58:04,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-21 17:58:04,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1133, Unknown=5, NotChecked=0, Total=1406 [2023-12-21 17:58:04,684 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 38 states have internal predecessors, (79), 0 states have call successors, (0), 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-21 17:58:10,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:58:12,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:58:16,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:59:06,789 WARN L293 SmtUtils]: Spent 48.46s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:59:10,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:59:12,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:59:16,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:59:20,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:59:24,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:59:36,620 WARN L293 SmtUtils]: Spent 12.19s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:59:49,063 WARN L293 SmtUtils]: Spent 12.13s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:59:54,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:59:59,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:00:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 18:00:03,148 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2023-12-21 18:00:03,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-21 18:00:03,149 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 38 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-12-21 18:00:03,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 18:00:03,149 INFO L225 Difference]: With dead ends: 99 [2023-12-21 18:00:03,149 INFO L226 Difference]: Without dead ends: 97 [2023-12-21 18:00:03,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2048 ImplicationChecksByTransitivity, 104.5s TimeCoverageRelationStatistics Valid=1287, Invalid=6190, Unknown=5, NotChecked=0, Total=7482 [2023-12-21 18:00:03,151 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 260 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 81 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.3s IncrementalHoareTripleChecker+Time [2023-12-21 18:00:03,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 62 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 616 Invalid, 8 Unknown, 0 Unchecked, 38.3s Time] [2023-12-21 18:00:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-21 18:00:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 44. [2023-12-21 18:00:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 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-21 18:00:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2023-12-21 18:00:03,171 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 40 [2023-12-21 18:00:03,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 18:00:03,171 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2023-12-21 18:00:03,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 38 states have internal predecessors, (79), 0 states have call successors, (0), 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-21 18:00:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2023-12-21 18:00:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-21 18:00:03,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 18:00:03,172 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 18:00:03,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-21 18:00:03,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 18:00:03,373 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 18:00:03,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 18:00:03,373 INFO L85 PathProgramCache]: Analyzing trace with hash 881742764, now seen corresponding path program 10 times [2023-12-21 18:00:03,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 18:00:03,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009393042] [2023-12-21 18:00:03,374 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 18:00:03,374 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-21 18:00:03,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 18:00:03,375 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 18:00:03,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-21 18:00:03,433 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 18:00:03,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 18:00:03,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 18:00:03,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 18:00:04,526 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 6 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 18:00:04,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 18:00:05,937 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 18:00:05,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 18:00:05,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009393042] [2023-12-21 18:00:05,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009393042] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 18:00:05,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 18:00:05,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2023-12-21 18:00:05,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813395782] [2023-12-21 18:00:05,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 18:00:05,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-21 18:00:05,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 18:00:05,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-21 18:00:05,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 18:00:05,940 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 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-21 18:00:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 18:00:10,274 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2023-12-21 18:00:10,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-21 18:00:10,274 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-12-21 18:00:10,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 18:00:10,275 INFO L225 Difference]: With dead ends: 137 [2023-12-21 18:00:10,275 INFO L226 Difference]: Without dead ends: 61 [2023-12-21 18:00:10,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1184, Invalid=4072, Unknown=0, NotChecked=0, Total=5256 [2023-12-21 18:00:10,277 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 101 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-21 18:00:10,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 99 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-21 18:00:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-21 18:00:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2023-12-21 18:00:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 18:00:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2023-12-21 18:00:10,302 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 43 [2023-12-21 18:00:10,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 18:00:10,303 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2023-12-21 18:00:10,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 0 states have call successors, (0), 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-21 18:00:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2023-12-21 18:00:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-21 18:00:10,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 18:00:10,308 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 18:00:10,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-21 18:00:10,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 18:00:10,512 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 18:00:10,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 18:00:10,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1393238296, now seen corresponding path program 11 times [2023-12-21 18:00:10,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 18:00:10,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721482884] [2023-12-21 18:00:10,514 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 18:00:10,514 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-21 18:00:10,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 18:00:10,515 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 18:00:10,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-21 18:00:10,749 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-12-21 18:00:10,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 18:00:10,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-21 18:00:10,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 18:00:10,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-21 18:00:10,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-21 18:00:10,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:00:10,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2023-12-21 18:00:11,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:00:11,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 60 [2023-12-21 18:00:11,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:00:11,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 63 [2023-12-21 18:00:11,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:00:11,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 76 [2023-12-21 18:00:11,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:00:11,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 79 [2023-12-21 18:00:11,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:00:11,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 92 [2023-12-21 18:00:11,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:00:11,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 95 [2023-12-21 18:00:12,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:00:12,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 94 treesize of output 108 [2023-12-21 18:00:12,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:00:12,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 105 treesize of output 111 [2023-12-21 18:00:13,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:00:13,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 103 treesize of output 111 [2023-12-21 18:00:17,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:00:17,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:00:17,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:00:18,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:00:18,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:00:18,003 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 18:00:18,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:00:18,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 112 treesize of output 53 [2023-12-21 18:00:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 14 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 18:00:18,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 18:00:45,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2023-12-21 18:00:45,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 637534194 treesize of output 636485618 [2023-12-21 18:00:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 30 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 18:00:46,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 18:00:46,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721482884] [2023-12-21 18:00:46,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721482884] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 18:00:46,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 18:00:46,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 43 [2023-12-21 18:00:46,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355665182] [2023-12-21 18:00:46,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 18:00:46,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-21 18:00:46,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 18:00:46,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-21 18:00:46,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=1442, Unknown=6, NotChecked=0, Total=1806 [2023-12-21 18:00:46,361 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 43 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 18:00:52,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:00:54,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:01:01,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:01:05,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:01:09,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:01:13,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:01:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 18:01:20,391 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2023-12-21 18:01:20,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-21 18:01:20,393 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 43 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-12-21 18:01:20,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 18:01:20,393 INFO L225 Difference]: With dead ends: 77 [2023-12-21 18:01:20,393 INFO L226 Difference]: Without dead ends: 75 [2023-12-21 18:01:20,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=1455, Invalid=5849, Unknown=6, NotChecked=0, Total=7310 [2023-12-21 18:01:20,395 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 68 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 38 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2023-12-21 18:01:20,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 41 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 722 Invalid, 4 Unknown, 0 Unchecked, 23.0s Time] [2023-12-21 18:01:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-21 18:01:20,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 50. [2023-12-21 18:01:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 18:01:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2023-12-21 18:01:20,476 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 46 [2023-12-21 18:01:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 18:01:20,478 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2023-12-21 18:01:20,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 43 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 18:01:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2023-12-21 18:01:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-21 18:01:20,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 18:01:20,479 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 18:01:20,496 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 (16)] Forceful destruction successful, exit code 0 [2023-12-21 18:01:20,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 18:01:20,680 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 18:01:20,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 18:01:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash 607209066, now seen corresponding path program 12 times [2023-12-21 18:01:20,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 18:01:20,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820291497] [2023-12-21 18:01:20,681 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 18:01:20,681 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-21 18:01:20,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 18:01:20,682 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 18:01:20,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-21 18:01:20,902 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2023-12-21 18:01:20,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 18:01:20,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-21 18:01:20,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 18:01:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 7 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 18:01:21,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 18:01:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 18:01:23,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 18:01:23,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820291497] [2023-12-21 18:01:23,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820291497] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 18:01:23,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 18:01:23,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2023-12-21 18:01:23,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671431046] [2023-12-21 18:01:23,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 18:01:23,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-21 18:01:23,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 18:01:23,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-21 18:01:23,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1009, Unknown=0, NotChecked=0, Total=1332 [2023-12-21 18:01:23,138 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 37 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 37 states have internal predecessors, (96), 0 states have call successors, (0), 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-21 18:01:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 18:01:28,242 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2023-12-21 18:01:28,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-21 18:01:28,242 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 37 states have internal predecessors, (96), 0 states have call successors, (0), 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 49 [2023-12-21 18:01:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 18:01:28,242 INFO L225 Difference]: With dead ends: 158 [2023-12-21 18:01:28,242 INFO L226 Difference]: Without dead ends: 70 [2023-12-21 18:01:28,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1637 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1507, Invalid=5299, Unknown=0, NotChecked=0, Total=6806 [2023-12-21 18:01:28,245 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 123 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-21 18:01:28,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 121 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-21 18:01:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-21 18:01:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2023-12-21 18:01:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 18:01:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2023-12-21 18:01:28,280 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 49 [2023-12-21 18:01:28,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 18:01:28,280 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2023-12-21 18:01:28,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 37 states have internal predecessors, (96), 0 states have call successors, (0), 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-21 18:01:28,280 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2023-12-21 18:01:28,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 18:01:28,281 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 18:01:28,281 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 18:01:28,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-21 18:01:28,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 18:01:28,493 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 18:01:28,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 18:01:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1606847322, now seen corresponding path program 13 times [2023-12-21 18:01:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 18:01:28,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208958567] [2023-12-21 18:01:28,494 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 18:01:28,494 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-21 18:01:28,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 18:01:28,496 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 18:01:28,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-21 18:01:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 18:01:28,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-21 18:01:28,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 18:01:28,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-21 18:01:28,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-21 18:01:28,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:01:28,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2023-12-21 18:01:29,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:01:29,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 60 [2023-12-21 18:01:29,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:01:29,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 63 [2023-12-21 18:01:29,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:01:29,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 76 [2023-12-21 18:01:29,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:01:29,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 79 [2023-12-21 18:01:29,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:01:29,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 92 [2023-12-21 18:01:30,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:01:30,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 95 [2023-12-21 18:01:30,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:01:30,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 94 treesize of output 108 [2023-12-21 18:01:30,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:01:30,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 105 treesize of output 111 [2023-12-21 18:01:31,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:01:31,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 124 [2023-12-21 18:01:31,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:01:31,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 118 treesize of output 127 [2023-12-21 18:01:32,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:01:32,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 116 treesize of output 127 [2023-12-21 18:01:38,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:01:38,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:01:38,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:01:38,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:01:38,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:01:38,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:01:38,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:01:38,684 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 18:01:38,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:01:38,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 125 treesize of output 58 [2023-12-21 18:01:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 6 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 18:01:38,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 18:02:12,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 84 [2023-12-21 18:02:18,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10445360463858 treesize of output 10436770529266 [2023-12-21 18:02:59,486 WARN L293 SmtUtils]: Spent 39.59s on a formula simplification. DAG size of input: 287695 DAG size of output: 76 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 18:02:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 35 proven. 134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 18:02:59,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 18:02:59,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208958567] [2023-12-21 18:02:59,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208958567] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 18:02:59,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 18:02:59,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21] total 48 [2023-12-21 18:02:59,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040258611] [2023-12-21 18:02:59,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 18:02:59,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-21 18:02:59,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 18:02:59,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-21 18:02:59,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=1840, Unknown=7, NotChecked=0, Total=2256 [2023-12-21 18:02:59,529 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 48 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 48 states have internal predecessors, (103), 0 states have call successors, (0), 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-21 18:03:06,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:03:08,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:03:10,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:03:15,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:04:30,774 WARN L293 SmtUtils]: Spent 1.21m on a formula simplification that was a NOOP. DAG size: 120 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 18:04:35,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:04:39,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:04:43,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:04:47,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:04:51,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:04:55,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:04:56,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:05:09,619 WARN L293 SmtUtils]: Spent 12.28s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 18:05:22,476 WARN L293 SmtUtils]: Spent 12.36s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 18:05:27,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:05:28,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:05:37,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:05:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 18:05:44,332 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2023-12-21 18:05:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-12-21 18:05:44,334 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 48 states have internal predecessors, (103), 0 states have call successors, (0), 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 52 [2023-12-21 18:05:44,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 18:05:44,334 INFO L225 Difference]: With dead ends: 123 [2023-12-21 18:05:44,335 INFO L226 Difference]: Without dead ends: 121 [2023-12-21 18:05:44,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 152.4s TimeCoverageRelationStatistics Valid=1915, Invalid=9850, Unknown=7, NotChecked=0, Total=11772 [2023-12-21 18:05:44,338 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 307 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 100 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.9s IncrementalHoareTripleChecker+Time [2023-12-21 18:05:44,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 92 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1046 Invalid, 10 Unknown, 0 Unchecked, 50.9s Time] [2023-12-21 18:05:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-21 18:05:44,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 56. [2023-12-21 18:05:44,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 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-21 18:05:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2023-12-21 18:05:44,392 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 52 [2023-12-21 18:05:44,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 18:05:44,392 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2023-12-21 18:05:44,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 48 states have internal predecessors, (103), 0 states have call successors, (0), 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-21 18:05:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2023-12-21 18:05:44,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-21 18:05:44,394 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 18:05:44,394 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 18:05:44,403 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 (18)] Forceful destruction successful, exit code 0 [2023-12-21 18:05:44,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 18:05:44,602 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 18:05:44,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 18:05:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2122248172, now seen corresponding path program 14 times [2023-12-21 18:05:44,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 18:05:44,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381658383] [2023-12-21 18:05:44,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 18:05:44,602 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-21 18:05:44,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 18:05:44,604 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 18:05:44,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-21 18:05:44,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 18:05:44,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 18:05:44,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 18:05:44,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 18:05:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 8 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 18:05:45,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 18:05:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 23 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 18:05:47,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 18:05:47,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381658383] [2023-12-21 18:05:47,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381658383] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 18:05:47,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 18:05:47,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2023-12-21 18:05:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708114505] [2023-12-21 18:05:47,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 18:05:47,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-21 18:05:47,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 18:05:47,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-21 18:05:47,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=1251, Unknown=0, NotChecked=0, Total=1640 [2023-12-21 18:05:47,781 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 41 states, 41 states have (on average 2.6341463414634148) internal successors, (108), 41 states have internal predecessors, (108), 0 states have call successors, (0), 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-21 18:05:55,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 18:05:55,381 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2023-12-21 18:05:55,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-12-21 18:05:55,381 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.6341463414634148) internal successors, (108), 41 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-21 18:05:55,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 18:05:55,382 INFO L225 Difference]: With dead ends: 179 [2023-12-21 18:05:55,382 INFO L226 Difference]: Without dead ends: 79 [2023-12-21 18:05:55,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2097 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1869, Invalid=6687, Unknown=0, NotChecked=0, Total=8556 [2023-12-21 18:05:55,391 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 142 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-21 18:05:55,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 162 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-21 18:05:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-21 18:05:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2023-12-21 18:05:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 0 states have call successors, (0), 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-21 18:05:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2023-12-21 18:05:55,449 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2023-12-21 18:05:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 18:05:55,449 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2023-12-21 18:05:55,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.6341463414634148) internal successors, (108), 41 states have internal predecessors, (108), 0 states have call successors, (0), 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-21 18:05:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2023-12-21 18:05:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 18:05:55,449 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 18:05:55,449 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 18:05:55,456 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 (19)] Forceful destruction successful, exit code 0 [2023-12-21 18:05:55,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 18:05:55,654 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 18:05:55,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 18:05:55,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1725791960, now seen corresponding path program 15 times [2023-12-21 18:05:55,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 18:05:55,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651556340] [2023-12-21 18:05:55,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 18:05:55,655 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-21 18:05:55,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 18:05:55,656 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 18:05:55,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-21 18:05:56,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-12-21 18:05:56,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 18:05:56,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-21 18:05:56,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 18:05:56,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-21 18:05:56,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-21 18:05:56,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:05:56,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2023-12-21 18:05:56,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:05:56,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 60 [2023-12-21 18:05:56,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:05:56,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 63 [2023-12-21 18:05:56,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:05:56,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 76 [2023-12-21 18:05:56,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:05:56,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 79 [2023-12-21 18:05:57,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:05:57,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 92 [2023-12-21 18:05:57,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:05:57,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 95 [2023-12-21 18:05:57,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:05:57,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 94 treesize of output 108 [2023-12-21 18:05:58,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:05:58,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 105 treesize of output 111 [2023-12-21 18:05:58,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:05:58,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 124 [2023-12-21 18:05:58,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:05:58,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 118 treesize of output 127 [2023-12-21 18:05:59,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:05:59,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 120 treesize of output 140 [2023-12-21 18:06:00,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:06:00,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 131 treesize of output 143 [2023-12-21 18:06:02,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:06:02,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 129 treesize of output 143 [2023-12-21 18:06:10,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:06:10,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:06:10,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:06:10,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 18:06:11,000 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 18:06:11,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 18:06:11,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 138 treesize of output 63 [2023-12-21 18:06:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 7 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 18:06:11,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 18:06:51,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 94 [2023-12-21 18:06:56,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2611340115954 treesize of output 2610266374130 [2023-12-21 18:07:25,939 WARN L293 SmtUtils]: Spent 28.61s on a formula simplification. DAG size of input: 249855 DAG size of output: 85 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 18:07:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 40 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 18:07:25,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 18:07:25,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651556340] [2023-12-21 18:07:25,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651556340] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 18:07:25,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 18:07:25,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 23] total 53 [2023-12-21 18:07:25,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991174481] [2023-12-21 18:07:25,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 18:07:25,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-12-21 18:07:25,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 18:07:25,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-12-21 18:07:25,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=2258, Unknown=8, NotChecked=0, Total=2756 [2023-12-21 18:07:25,992 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 53 states, 53 states have (on average 2.169811320754717) internal successors, (115), 53 states have internal predecessors, (115), 0 states have call successors, (0), 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-21 18:07:35,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:07:40,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 18:07:45,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-21 18:08:01,112 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 (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 18:08:01,112 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-21 18:08:02,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-21 18:08:02,313 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-21 18:08:02,406 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-21 18:08:02,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 18:08:02,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1258 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=1012, Invalid=4236, Unknown=8, NotChecked=0, Total=5256 [2023-12-21 18:08:02,409 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 23 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2023-12-21 18:08:02,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 535 Invalid, 2 Unknown, 0 Unchecked, 14.9s Time] [2023-12-21 18:08:02,410 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 18:08:02,410 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (59states) and FLOYD_HOARE automaton (currently 23 states, 53 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-21 18:08:02,413 INFO L445 BasicCegarLoop]: Path program histogram: [15, 1, 1, 1, 1] [2023-12-21 18:08:02,415 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 18:08:02,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 06:08:02 BoogieIcfgContainer [2023-12-21 18:08:02,416 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 18:08:02,417 INFO L158 Benchmark]: Toolchain (without parser) took 876679.24ms. Allocated memory was 294.6MB in the beginning and 7.6GB in the end (delta: 7.3GB). Free memory was 245.1MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2023-12-21 18:08:02,417 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 190.8MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 18:08:02,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.19ms. Allocated memory is still 294.6MB. Free memory was 245.1MB in the beginning and 233.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 18:08:02,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.53ms. Allocated memory is still 294.6MB. Free memory was 233.6MB in the beginning and 232.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 18:08:02,417 INFO L158 Benchmark]: Boogie Preprocessor took 36.19ms. Allocated memory is still 294.6MB. Free memory was 232.0MB in the beginning and 229.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 18:08:02,418 INFO L158 Benchmark]: RCFGBuilder took 299.86ms. Allocated memory is still 294.6MB. Free memory was 229.9MB in the beginning and 217.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 18:08:02,418 INFO L158 Benchmark]: TraceAbstraction took 876064.91ms. Allocated memory was 294.6MB in the beginning and 7.6GB in the end (delta: 7.3GB). Free memory was 216.8MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2023-12-21 18:08:02,419 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 190.8MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.19ms. Allocated memory is still 294.6MB. Free memory was 245.1MB in the beginning and 233.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.53ms. Allocated memory is still 294.6MB. Free memory was 233.6MB in the beginning and 232.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.19ms. Allocated memory is still 294.6MB. Free memory was 232.0MB in the beginning and 229.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 299.86ms. Allocated memory is still 294.6MB. Free memory was 229.9MB in the beginning and 217.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 876064.91ms. Allocated memory was 294.6MB in the beginning and 7.6GB in the end (delta: 7.3GB). Free memory was 216.8MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 2.0GB. 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: 8]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 8). Cancelled while NwaCegarLoop was constructing difference of abstraction (59states) and FLOYD_HOARE automaton (currently 23 states, 53 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 876.0s, OverallIterations: 19, TraceHistogramMax: 9, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 565.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 39 mSolverCounterUnknown, 1923 SdHoareTripleChecker+Valid, 202.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1923 mSDsluCounter, 1068 SdHoareTripleChecker+Invalid, 200.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 925 mSDsCounter, 563 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6824 IncrementalHoareTripleChecker+Invalid, 7426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 563 mSolverCounterUnsat, 143 mSDtfsCounter, 6824 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1713 GetRequests, 694 SyntacticMatches, 5 SemanticMatches, 1013 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18788 ImplicationChecksByTransitivity, 543.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=18, InterpolantAutomatonStates: 591, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 369 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 304.5s InterpolantComputationTime, 592 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 1134 ConstructedInterpolants, 135 QuantifiedInterpolants, 33781 SizeOfPredicates, 127 NumberOfNonLiveVariables, 1724 ConjunctsInSsa, 464 ConjunctsInUnsatCore, 36 InterpolantComputations, 4 PerfectInterpolantSequences, 362/2686 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