/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/heap-data/process_queue.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:47:34,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:47:34,714 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 21:47:34,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:47:34,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:47:34,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:47:34,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:47:34,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:47:34,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:47:34,736 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:47:34,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:47:34,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:47:34,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:47:34,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:47:34,737 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:47:34,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:47:34,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:47:34,738 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:47:34,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:47:34,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:47:34,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:47:34,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:47:34,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:47:34,739 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:47:34,740 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:47:34,740 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:47:34,740 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:47:34,740 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:47:34,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:47:34,741 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:47:34,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:47:34,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:47:34,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:47:34,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:47:34,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:47:34,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:47:34,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:47:34,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:47:34,743 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:47:34,743 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:47:34,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:47:34,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:47:34,750 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:47:34,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:47:34,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:47:34,750 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:47:34,751 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 21:47:34,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:47:34,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:47:34,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:47:34,977 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:47:34,977 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:47:34,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/process_queue.i [2023-12-24 21:47:36,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:47:36,233 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:47:36,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/process_queue.i [2023-12-24 21:47:36,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c418b5236/7eb076a480c746a3952cfbe3db8be7ed/FLAG0db999f2a [2023-12-24 21:47:36,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c418b5236/7eb076a480c746a3952cfbe3db8be7ed [2023-12-24 21:47:36,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:47:36,260 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:47:36,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:47:36,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:47:36,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:47:36,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:47:36" (1/1) ... [2023-12-24 21:47:36,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b3f72a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:47:36, skipping insertion in model container [2023-12-24 21:47:36,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:47:36" (1/1) ... [2023-12-24 21:47:36,306 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:47:36,484 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-data/process_queue.i[23979,23992] [2023-12-24 21:47:36,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:47:36,507 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:47:36,538 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-data/process_queue.i[23979,23992] [2023-12-24 21:47:36,541 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:47:36,560 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:47:36,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:47:36 WrapperNode [2023-12-24 21:47:36,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:47:36,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:47:36,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:47:36,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:47:36,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:47:36" (1/1) ... [2023-12-24 21:47:36,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:47:36" (1/1) ... [2023-12-24 21:47:36,599 INFO L138 Inliner]: procedures = 130, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 112 [2023-12-24 21:47:36,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:47:36,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:47:36,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:47:36,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:47:36,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:47:36" (1/1) ... [2023-12-24 21:47:36,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:47:36" (1/1) ... [2023-12-24 21:47:36,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:47:36" (1/1) ... [2023-12-24 21:47:36,630 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 13, 6]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 7 writes are split as follows [0, 5, 2]. [2023-12-24 21:47:36,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:47:36" (1/1) ... [2023-12-24 21:47:36,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:47:36" (1/1) ... [2023-12-24 21:47:36,637 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:47:36" (1/1) ... [2023-12-24 21:47:36,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:47:36" (1/1) ... [2023-12-24 21:47:36,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:47:36" (1/1) ... [2023-12-24 21:47:36,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:47:36" (1/1) ... [2023-12-24 21:47:36,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:47:36,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:47:36,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:47:36,646 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:47:36,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:47:36" (1/1) ... [2023-12-24 21:47:36,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:47:36,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:47:36,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 21:47:36,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 21:47:36,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 21:47:36,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 21:47:36,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 21:47:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:47:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:47:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 21:47:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:47:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:47:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-24 21:47:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:47:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:47:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-24 21:47:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:47:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:47:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:47:36,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 21:47:36,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 21:47:36,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 21:47:36,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-24 21:47:36,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:47:36,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:47:36,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 21:47:36,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:47:36,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:47:36,858 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:47:36,860 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:47:37,357 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:47:37,397 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:47:37,397 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-24 21:47:37,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:47:37 BoogieIcfgContainer [2023-12-24 21:47:37,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:47:37,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:47:37,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:47:37,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:47:37,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:47:36" (1/3) ... [2023-12-24 21:47:37,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79666c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:47:37, skipping insertion in model container [2023-12-24 21:47:37,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:47:36" (2/3) ... [2023-12-24 21:47:37,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79666c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:47:37, skipping insertion in model container [2023-12-24 21:47:37,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:47:37" (3/3) ... [2023-12-24 21:47:37,403 INFO L112 eAbstractionObserver]: Analyzing ICFG process_queue.i [2023-12-24 21:47:37,416 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:47:37,416 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:47:37,460 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:47:37,466 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;@135a58fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:47:37,467 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:47:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 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-24 21:47:37,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 21:47:37,474 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:47:37,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:47:37,475 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:47:37,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:47:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash -638587651, now seen corresponding path program 1 times [2023-12-24 21:47:37,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:47:37,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787642633] [2023-12-24 21:47:37,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:47:37,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:47:37,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:47:37,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:47:37,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 21:47:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:47:37,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:47:37,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:47:37,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:47:37,689 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:47:37,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:47:37,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787642633] [2023-12-24 21:47:37,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787642633] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:47:37,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:47:37,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:47:37,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111483882] [2023-12-24 21:47:37,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:47:37,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:47:37,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:47:37,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:47:37,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:47:37,736 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 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) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:47:38,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:47:38,367 INFO L93 Difference]: Finished difference Result 52 states and 82 transitions. [2023-12-24 21:47:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:47:38,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-24 21:47:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:47:38,376 INFO L225 Difference]: With dead ends: 52 [2023-12-24 21:47:38,376 INFO L226 Difference]: Without dead ends: 30 [2023-12-24 21:47:38,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-24 21:47:38,380 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 21:47:38,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 21:47:38,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-24 21:47:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-12-24 21:47:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:47:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-24 21:47:38,409 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 9 [2023-12-24 21:47:38,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:47:38,410 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-24 21:47:38,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:47:38,411 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-24 21:47:38,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 21:47:38,411 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:47:38,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:47:38,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 21:47:38,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:47:38,616 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:47:38,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:47:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash -695845953, now seen corresponding path program 1 times [2023-12-24 21:47:38,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:47:38,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181424956] [2023-12-24 21:47:38,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:47:38,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:47:38,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:47:38,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:47:38,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 21:47:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:47:38,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 21:47:38,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:47:38,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 11 [2023-12-24 21:47:38,834 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 15 treesize of output 1 [2023-12-24 21:47:38,842 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 11 treesize of output 7 [2023-12-24 21:47:38,900 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 19 treesize of output 11 [2023-12-24 21:47:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:47:38,939 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:47:38,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:47:38,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181424956] [2023-12-24 21:47:38,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181424956] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:47:38,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:47:38,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 21:47:38,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629013546] [2023-12-24 21:47:38,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:47:38,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:47:38,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:47:38,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:47:38,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:47:38,942 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:47:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:47:40,320 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2023-12-24 21:47:40,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:47:40,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-24 21:47:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:47:40,322 INFO L225 Difference]: With dead ends: 52 [2023-12-24 21:47:40,322 INFO L226 Difference]: Without dead ends: 50 [2023-12-24 21:47:40,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:47:40,323 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:47:40,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 76 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-24 21:47:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-24 21:47:40,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2023-12-24 21:47:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 41 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:47:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2023-12-24 21:47:40,330 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 9 [2023-12-24 21:47:40,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:47:40,330 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2023-12-24 21:47:40,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:47:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2023-12-24 21:47:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-24 21:47:40,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:47:40,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:47:40,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 21:47:40,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:47:40,536 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:47:40,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:47:40,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2077933849, now seen corresponding path program 1 times [2023-12-24 21:47:40,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:47:40,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63333649] [2023-12-24 21:47:40,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:47:40,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:47:40,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:47:40,539 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:47:40,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 21:47:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:47:40,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 21:47:40,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:47:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:47:40,672 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:47:40,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:47:40,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63333649] [2023-12-24 21:47:40,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63333649] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:47:40,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:47:40,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:47:40,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445808233] [2023-12-24 21:47:40,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:47:40,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:47:40,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:47:40,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:47:40,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:47:40,675 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:47:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:47:41,322 INFO L93 Difference]: Finished difference Result 81 states and 114 transitions. [2023-12-24 21:47:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:47:41,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-24 21:47:41,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:47:41,324 INFO L225 Difference]: With dead ends: 81 [2023-12-24 21:47:41,324 INFO L226 Difference]: Without dead ends: 40 [2023-12-24 21:47:41,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-24 21:47:41,325 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 21:47:41,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 56 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 21:47:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-24 21:47:41,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-12-24 21:47:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 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-24 21:47:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2023-12-24 21:47:41,330 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 10 [2023-12-24 21:47:41,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:47:41,330 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2023-12-24 21:47:41,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:47:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2023-12-24 21:47:41,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 21:47:41,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:47:41,331 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:47:41,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 21:47:41,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:47:41,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:47:41,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:47:41,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1864264615, now seen corresponding path program 1 times [2023-12-24 21:47:41,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:47:41,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579376264] [2023-12-24 21:47:41,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:47:41,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:47:41,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:47:41,536 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:47:41,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 21:47:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:47:41,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-24 21:47:41,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:47:41,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-12-24 21:47:41,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 3 [2023-12-24 21:47:41,700 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 19 treesize of output 11 [2023-12-24 21:47:41,709 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 19 treesize of output 11 [2023-12-24 21:47:41,738 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 30 treesize of output 18 [2023-12-24 21:47:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:47:41,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:47:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:47:41,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:47:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579376264] [2023-12-24 21:47:41,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579376264] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:47:41,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:47:41,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-24 21:47:41,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654651972] [2023-12-24 21:47:41,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:47:41,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 21:47:41,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:47:41,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 21:47:41,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:47:41,892 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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-24 21:47:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:47:44,331 INFO L93 Difference]: Finished difference Result 73 states and 103 transitions. [2023-12-24 21:47:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 21:47:44,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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) Word has length 12 [2023-12-24 21:47:44,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:47:44,334 INFO L225 Difference]: With dead ends: 73 [2023-12-24 21:47:44,334 INFO L226 Difference]: Without dead ends: 42 [2023-12-24 21:47:44,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-24 21:47:44,335 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 46 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-24 21:47:44,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 96 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-24 21:47:44,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-24 21:47:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2023-12-24 21:47:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 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-24 21:47:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2023-12-24 21:47:44,339 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 12 [2023-12-24 21:47:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:47:44,339 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2023-12-24 21:47:44,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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-24 21:47:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2023-12-24 21:47:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-24 21:47:44,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:47:44,340 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:47:44,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 21:47:44,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:47:44,541 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:47:44,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:47:44,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1732667969, now seen corresponding path program 1 times [2023-12-24 21:47:44,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:47:44,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461914946] [2023-12-24 21:47:44,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:47:44,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:47:44,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:47:44,543 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:47:44,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 21:47:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:47:44,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 21:47:44,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:47:44,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 21:47:44,667 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 16 treesize of output 8 [2023-12-24 21:47:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:47:44,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:47:44,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:47:44,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461914946] [2023-12-24 21:47:44,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461914946] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:47:44,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:47:44,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:47:44,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969368464] [2023-12-24 21:47:44,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:47:44,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:47:44,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:47:44,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:47:44,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:47:44,683 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:47:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:47:45,437 INFO L93 Difference]: Finished difference Result 91 states and 124 transitions. [2023-12-24 21:47:45,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:47:45,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-24 21:47:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:47:45,438 INFO L225 Difference]: With dead ends: 91 [2023-12-24 21:47:45,438 INFO L226 Difference]: Without dead ends: 61 [2023-12-24 21:47:45,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-24 21:47:45,439 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 21:47:45,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 60 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 21:47:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-24 21:47:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2023-12-24 21:47:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:47:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2023-12-24 21:47:45,447 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 16 [2023-12-24 21:47:45,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:47:45,447 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2023-12-24 21:47:45,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:47:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2023-12-24 21:47:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-24 21:47:45,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:47:45,450 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:47:45,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 21:47:45,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:47:45,652 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:47:45,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:47:45,652 INFO L85 PathProgramCache]: Analyzing trace with hash -285473447, now seen corresponding path program 1 times [2023-12-24 21:47:45,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:47:45,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391615735] [2023-12-24 21:47:45,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:47:45,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:47:45,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:47:45,654 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:47:45,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 21:47:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:47:45,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:47:45,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:47:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:47:45,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:47:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:47:45,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:47:45,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391615735] [2023-12-24 21:47:45,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391615735] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:47:45,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:47:45,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-24 21:47:45,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291309112] [2023-12-24 21:47:45,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:47:45,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 21:47:45,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:47:45,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 21:47:45,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 21:47:45,842 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:47:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:47:47,833 INFO L93 Difference]: Finished difference Result 247 states and 348 transitions. [2023-12-24 21:47:47,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 21:47:47,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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-24 21:47:47,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:47:47,836 INFO L225 Difference]: With dead ends: 247 [2023-12-24 21:47:47,836 INFO L226 Difference]: Without dead ends: 201 [2023-12-24 21:47:47,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2023-12-24 21:47:47,837 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 115 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-24 21:47:47,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 127 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-24 21:47:47,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-24 21:47:47,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 168. [2023-12-24 21:47:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.3592814371257484) internal successors, (227), 167 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:47:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 227 transitions. [2023-12-24 21:47:47,863 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 227 transitions. Word has length 19 [2023-12-24 21:47:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:47:47,863 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 227 transitions. [2023-12-24 21:47:47,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:47:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 227 transitions. [2023-12-24 21:47:47,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-24 21:47:47,864 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:47:47,864 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:47:47,870 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-24 21:47:48,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:47:48,068 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:47:48,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:47:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash -342731749, now seen corresponding path program 1 times [2023-12-24 21:47:48,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:47:48,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326580560] [2023-12-24 21:47:48,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:47:48,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:47:48,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:47:48,070 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:47:48,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 21:47:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:47:48,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 21:47:48,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:47:48,203 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 11 treesize of output 7 [2023-12-24 21:47:48,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 11 [2023-12-24 21:47:48,254 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 15 treesize of output 1 [2023-12-24 21:47:48,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-12-24 21:47:48,275 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 19 treesize of output 11 [2023-12-24 21:47:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:47:48,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:47:48,341 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 19 treesize of output 17 [2023-12-24 21:47:48,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:47:48,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 6 [2023-12-24 21:47:48,352 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 12 treesize of output 8 [2023-12-24 21:47:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:47:48,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:47:48,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326580560] [2023-12-24 21:47:48,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326580560] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:47:48,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:47:48,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 21:47:48,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830687255] [2023-12-24 21:47:48,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:47:48,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 21:47:48,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:47:48,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 21:47:48,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-24 21:47:48,394 INFO L87 Difference]: Start difference. First operand 168 states and 227 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 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-24 21:47:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:47:55,275 INFO L93 Difference]: Finished difference Result 661 states and 918 transitions. [2023-12-24 21:47:55,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-24 21:47:55,278 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 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) Word has length 19 [2023-12-24 21:47:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:47:55,281 INFO L225 Difference]: With dead ends: 661 [2023-12-24 21:47:55,281 INFO L226 Difference]: Without dead ends: 568 [2023-12-24 21:47:55,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=340, Invalid=992, Unknown=0, NotChecked=0, Total=1332 [2023-12-24 21:47:55,283 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 282 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:47:55,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 257 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2023-12-24 21:47:55,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2023-12-24 21:47:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 469. [2023-12-24 21:47:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.3611111111111112) internal successors, (637), 468 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:47:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 637 transitions. [2023-12-24 21:47:55,328 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 637 transitions. Word has length 19 [2023-12-24 21:47:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:47:55,328 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 637 transitions. [2023-12-24 21:47:55,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 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-24 21:47:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 637 transitions. [2023-12-24 21:47:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-24 21:47:55,329 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:47:55,329 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-24 21:47:55,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 21:47:55,552 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-24 21:47:55,553 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:47:55,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:47:55,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1180359221, now seen corresponding path program 2 times [2023-12-24 21:47:55,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:47:55,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147068496] [2023-12-24 21:47:55,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:47:55,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:47:55,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:47:55,555 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-24 21:47:55,555 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-24 21:47:55,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:47:55,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:47:55,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-24 21:47:55,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:47:55,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 11 treesize of output 7 [2023-12-24 21:47:55,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 11 [2023-12-24 21:47:55,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 11 [2023-12-24 21:47:55,737 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 15 treesize of output 1 [2023-12-24 21:47:55,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-12-24 21:47:55,845 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 23 treesize of output 15 [2023-12-24 21:47:55,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:47:55,854 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 28 treesize of output 15 [2023-12-24 21:47:55,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 26 [2023-12-24 21:47:55,875 INFO L349 Elim1Store]: treesize reduction 6, result has 72.7 percent of original size [2023-12-24 21:47:55,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 25 [2023-12-24 21:47:55,890 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 19 treesize of output 11 [2023-12-24 21:47:55,918 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 50 treesize of output 30 [2023-12-24 21:47:56,001 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 27 treesize of output 15 [2023-12-24 21:47:56,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-24 21:47:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:47:56,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:47:56,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:47:56,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 35 [2023-12-24 21:47:56,427 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:47:56,432 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 16 treesize of output 8 [2023-12-24 21:47:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:47:56,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:47:56,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147068496] [2023-12-24 21:47:56,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147068496] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:47:56,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:47:56,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-12-24 21:47:56,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167524255] [2023-12-24 21:47:56,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:47:56,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 21:47:56,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:47:56,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 21:47:56,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=149, Unknown=2, NotChecked=0, Total=182 [2023-12-24 21:47:56,467 INFO L87 Difference]: Start difference. First operand 469 states and 637 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 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-24 21:48:01,001 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) (_ bv8 32))) (.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (and (= .cse0 (_ bv0 32)) (= (select (select |c_#memory_int#1| .cse1) (_ bv4 32)) (_ bv1 32)) (not (= .cse2 .cse1)) (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_29| (_ BitVec 32)) (v_ArrVal_307 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvsge (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_append_to_queue_~n#1.base_29| v_ArrVal_307) .cse2) (bvadd (_ bv4 32) .cse0)) (_ bv1 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_append_to_queue_~n#1.base_29|))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) (_ bv8 32)) (_ bv0 32))))) is different from false [2023-12-24 21:48:01,006 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_check_queue_~n~0#1.base|) (_ bv8 32)))) (and (= (select (select |c_#memory_int#1| .cse0) (_ bv4 32)) (_ bv1 32)) (= |c_ULTIMATE.start_check_queue_~n~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_check_queue_~n~0#1.base|) (_ bv8 32))) (not (= |c_ULTIMATE.start_check_queue_~n~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_29| (_ BitVec 32)) (v_ArrVal_307 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvsge (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_append_to_queue_~n#1.base_29| v_ArrVal_307) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (_ bv1 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_append_to_queue_~n#1.base_29|))))))) is different from false [2023-12-24 21:48:01,119 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_check_queue_~n~0#1.offset| (_ bv0 32)) (forall ((|v_ULTIMATE.start_append_to_queue_~n#1.base_29| (_ BitVec 32)) (v_ArrVal_307 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvsge (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_append_to_queue_~n#1.base_29| v_ArrVal_307) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (_ bv1 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_append_to_queue_~n#1.base_29|))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_check_queue_~n~0#1.base|) (_ bv4 32)) (_ bv1 32))) is different from false [2023-12-24 21:48:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:48:10,340 INFO L93 Difference]: Finished difference Result 822 states and 1122 transitions. [2023-12-24 21:48:10,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-24 21:48:10,341 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 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-24 21:48:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:48:10,343 INFO L225 Difference]: With dead ends: 822 [2023-12-24 21:48:10,343 INFO L226 Difference]: Without dead ends: 820 [2023-12-24 21:48:10,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=142, Invalid=673, Unknown=9, NotChecked=168, Total=992 [2023-12-24 21:48:10,345 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 115 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 6 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:48:10,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 380 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 548 Invalid, 15 Unknown, 62 Unchecked, 13.1s Time] [2023-12-24 21:48:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2023-12-24 21:48:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 768. [2023-12-24 21:48:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 1.3598435462842242) internal successors, (1043), 767 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1043 transitions. [2023-12-24 21:48:10,382 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1043 transitions. Word has length 22 [2023-12-24 21:48:10,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:48:10,382 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 1043 transitions. [2023-12-24 21:48:10,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 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-24 21:48:10,382 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1043 transitions. [2023-12-24 21:48:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-24 21:48:10,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:48:10,383 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-24 21:48:10,393 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-24 21:48:10,588 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-24 21:48:10,589 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:48:10,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:48:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1180387813, now seen corresponding path program 3 times [2023-12-24 21:48:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:48:10,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881012651] [2023-12-24 21:48:10,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 21:48:10,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:48:10,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:48:10,591 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-24 21:48:10,592 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-24 21:48:10,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-24 21:48:10,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:48:10,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-24 21:48:10,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:48:10,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-12-24 21:48:10,821 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 19 treesize of output 11 [2023-12-24 21:48:10,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 11 [2023-12-24 21:48:10,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 3 [2023-12-24 21:48:10,839 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 19 treesize of output 11 [2023-12-24 21:48:10,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-12-24 21:48:10,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 [2023-12-24 21:48:11,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:48:11,005 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 21 treesize of output 23 [2023-12-24 21:48:11,019 INFO L349 Elim1Store]: treesize reduction 6, result has 72.7 percent of original size [2023-12-24 21:48:11,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 25 [2023-12-24 21:48:11,030 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 29 treesize of output 31 [2023-12-24 21:48:11,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2023-12-24 21:48:11,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2023-12-24 21:48:11,077 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 65 treesize of output 41 [2023-12-24 21:48:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:48:11,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:48:11,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:48:11,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2023-12-24 21:48:11,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:48:11,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2023-12-24 21:48:11,392 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 10 treesize of output 8 [2023-12-24 21:48:11,408 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 10 treesize of output 8 [2023-12-24 21:48:11,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:48:11,810 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2023-12-24 21:48:11,812 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:48:11,814 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 24 treesize of output 12 [2023-12-24 21:48:11,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:48:11,822 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-24 21:48:11,825 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:48:11,826 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 20 treesize of output 12 [2023-12-24 21:48:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:48:11,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:48:11,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881012651] [2023-12-24 21:48:11,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881012651] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:48:11,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:48:11,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-12-24 21:48:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724104357] [2023-12-24 21:48:11,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:48:11,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 21:48:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:48:11,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 21:48:11,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=106, Unknown=1, NotChecked=0, Total=132 [2023-12-24 21:48:11,841 INFO L87 Difference]: Start difference. First operand 768 states and 1043 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 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-24 21:48:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:48:16,978 INFO L93 Difference]: Finished difference Result 1513 states and 2065 transitions. [2023-12-24 21:48:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 21:48:16,980 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 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 25 [2023-12-24 21:48:16,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:48:16,982 INFO L225 Difference]: With dead ends: 1513 [2023-12-24 21:48:16,982 INFO L226 Difference]: Without dead ends: 790 [2023-12-24 21:48:16,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=275, Unknown=1, NotChecked=0, Total=342 [2023-12-24 21:48:16,984 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 66 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-24 21:48:16,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 255 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-12-24 21:48:16,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2023-12-24 21:48:17,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 773. [2023-12-24 21:48:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.349740932642487) internal successors, (1042), 772 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1042 transitions. [2023-12-24 21:48:17,021 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1042 transitions. Word has length 25 [2023-12-24 21:48:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:48:17,021 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1042 transitions. [2023-12-24 21:48:17,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 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-24 21:48:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1042 transitions. [2023-12-24 21:48:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-24 21:48:17,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:48:17,022 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:48:17,030 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-24 21:48:17,230 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-24 21:48:17,231 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:48:17,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:48:17,231 INFO L85 PathProgramCache]: Analyzing trace with hash 600145659, now seen corresponding path program 1 times [2023-12-24 21:48:17,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:48:17,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787234321] [2023-12-24 21:48:17,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:48:17,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:48:17,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:48:17,233 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-24 21:48:17,237 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-24 21:48:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:48:17,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-24 21:48:17,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:48:17,381 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 15 treesize of output 1 [2023-12-24 21:48:17,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 77 treesize of output 27 [2023-12-24 21:48:17,623 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 45 treesize of output 33 [2023-12-24 21:48:17,626 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 37 treesize of output 25 [2023-12-24 21:48:17,657 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 31 treesize of output 13 [2023-12-24 21:48:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:48:17,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:48:18,096 INFO L349 Elim1Store]: treesize reduction 4, result has 78.9 percent of original size [2023-12-24 21:48:18,097 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 47 treesize of output 28 [2023-12-24 21:48:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:48:18,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:48:18,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787234321] [2023-12-24 21:48:18,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787234321] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:48:18,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:48:18,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-12-24 21:48:18,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580958660] [2023-12-24 21:48:18,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:48:18,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 21:48:18,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:48:18,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 21:48:18,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-12-24 21:48:18,110 INFO L87 Difference]: Start difference. First operand 773 states and 1042 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 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-24 21:48:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:48:27,153 INFO L93 Difference]: Finished difference Result 1141 states and 1564 transitions. [2023-12-24 21:48:27,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 21:48:27,154 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 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 25 [2023-12-24 21:48:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:48:27,157 INFO L225 Difference]: With dead ends: 1141 [2023-12-24 21:48:27,157 INFO L226 Difference]: Without dead ends: 1139 [2023-12-24 21:48:27,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2023-12-24 21:48:27,157 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-12-24 21:48:27,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 236 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2023-12-24 21:48:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2023-12-24 21:48:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 622. [2023-12-24 21:48:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 1.3317230273752012) internal successors, (827), 621 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 827 transitions. [2023-12-24 21:48:27,192 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 827 transitions. Word has length 25 [2023-12-24 21:48:27,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:48:27,193 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 827 transitions. [2023-12-24 21:48:27,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 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-24 21:48:27,193 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 827 transitions. [2023-12-24 21:48:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-24 21:48:27,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:48:27,193 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:48:27,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-24 21:48:27,397 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-24 21:48:27,397 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:48:27,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:48:27,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1953335290, now seen corresponding path program 1 times [2023-12-24 21:48:27,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:48:27,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241544383] [2023-12-24 21:48:27,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:48:27,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:48:27,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:48:27,399 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-24 21:48:27,418 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-24 21:48:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:48:27,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-24 21:48:27,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:48:27,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 [2023-12-24 21:48:27,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 26 [2023-12-24 21:48:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:48:27,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:48:28,813 INFO L349 Elim1Store]: treesize reduction 4, result has 78.9 percent of original size [2023-12-24 21:48:28,813 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 46 treesize of output 41 [2023-12-24 21:48:28,822 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-12-24 21:48:28,822 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 32 treesize of output 12 [2023-12-24 21:48:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:48:28,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:48:28,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241544383] [2023-12-24 21:48:28,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241544383] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:48:28,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:48:28,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2023-12-24 21:48:28,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855288527] [2023-12-24 21:48:28,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:48:28,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 21:48:28,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:48:28,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 21:48:28,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:48:28,836 INFO L87 Difference]: Start difference. First operand 622 states and 827 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:48:33,658 INFO L93 Difference]: Finished difference Result 1830 states and 2491 transitions. [2023-12-24 21:48:33,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 21:48:33,658 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 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 26 [2023-12-24 21:48:33,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:48:33,663 INFO L225 Difference]: With dead ends: 1830 [2023-12-24 21:48:33,663 INFO L226 Difference]: Without dead ends: 1214 [2023-12-24 21:48:33,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-12-24 21:48:33,664 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 51 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-24 21:48:33,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 169 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-24 21:48:33,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2023-12-24 21:48:33,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 998. [2023-12-24 21:48:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 1.3410230692076228) internal successors, (1337), 997 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1337 transitions. [2023-12-24 21:48:33,745 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1337 transitions. Word has length 26 [2023-12-24 21:48:33,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:48:33,745 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 1337 transitions. [2023-12-24 21:48:33,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1337 transitions. [2023-12-24 21:48:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-24 21:48:33,749 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:48:33,749 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:48:33,755 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-24 21:48:33,953 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-24 21:48:33,953 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:48:33,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:48:33,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1532285380, now seen corresponding path program 1 times [2023-12-24 21:48:33,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:48:33,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171697206] [2023-12-24 21:48:33,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:48:33,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:48:33,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:48:33,955 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-24 21:48:33,990 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-24 21:48:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:48:34,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:48:34,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:48:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-24 21:48:34,065 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:48:34,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:48:34,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171697206] [2023-12-24 21:48:34,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171697206] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:48:34,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:48:34,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:48:34,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608180205] [2023-12-24 21:48:34,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:48:34,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:48:34,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:48:34,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:48:34,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:48:34,066 INFO L87 Difference]: Start difference. First operand 998 states and 1337 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:48:34,439 INFO L93 Difference]: Finished difference Result 1746 states and 2358 transitions. [2023-12-24 21:48:34,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:48:34,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 26 [2023-12-24 21:48:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:48:34,442 INFO L225 Difference]: With dead ends: 1746 [2023-12-24 21:48:34,442 INFO L226 Difference]: Without dead ends: 1005 [2023-12-24 21:48:34,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:48:34,443 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:48:34,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 38 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 21:48:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2023-12-24 21:48:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 973. [2023-12-24 21:48:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 1.3446502057613168) internal successors, (1307), 972 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1307 transitions. [2023-12-24 21:48:34,548 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1307 transitions. Word has length 26 [2023-12-24 21:48:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:48:34,549 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1307 transitions. [2023-12-24 21:48:34,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1307 transitions. [2023-12-24 21:48:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-24 21:48:34,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:48:34,549 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:48:34,553 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-24 21:48:34,753 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-24 21:48:34,753 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:48:34,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:48:34,754 INFO L85 PathProgramCache]: Analyzing trace with hash -258106555, now seen corresponding path program 1 times [2023-12-24 21:48:34,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:48:34,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934688521] [2023-12-24 21:48:34,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:48:34,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:48:34,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:48:34,755 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-24 21:48:34,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-24 21:48:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:48:34,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 21:48:34,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:48:34,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 21:48:34,887 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 16 treesize of output 8 [2023-12-24 21:48:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:48:34,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:48:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:48:34,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:48:34,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934688521] [2023-12-24 21:48:34,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934688521] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:48:34,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:48:34,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2023-12-24 21:48:34,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677693843] [2023-12-24 21:48:34,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:48:34,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 21:48:34,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:48:34,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 21:48:34,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 21:48:34,926 INFO L87 Difference]: Start difference. First operand 973 states and 1307 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:48:36,023 INFO L93 Difference]: Finished difference Result 1795 states and 2429 transitions. [2023-12-24 21:48:36,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 21:48:36,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-12-24 21:48:36,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:48:36,026 INFO L225 Difference]: With dead ends: 1795 [2023-12-24 21:48:36,026 INFO L226 Difference]: Without dead ends: 905 [2023-12-24 21:48:36,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 21:48:36,029 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:48:36,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 80 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 21:48:36,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2023-12-24 21:48:36,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 864. [2023-12-24 21:48:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 863 states have (on average 1.342989571263036) internal successors, (1159), 863 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1159 transitions. [2023-12-24 21:48:36,081 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1159 transitions. Word has length 29 [2023-12-24 21:48:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:48:36,081 INFO L495 AbstractCegarLoop]: Abstraction has 864 states and 1159 transitions. [2023-12-24 21:48:36,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1159 transitions. [2023-12-24 21:48:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-24 21:48:36,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:48:36,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:48:36,108 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-24 21:48:36,286 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-24 21:48:36,286 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:48:36,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:48:36,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1067453181, now seen corresponding path program 1 times [2023-12-24 21:48:36,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:48:36,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075556982] [2023-12-24 21:48:36,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:48:36,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:48:36,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:48:36,310 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-24 21:48:36,320 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-24 21:48:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:48:36,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 21:48:36,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:48:36,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 11 [2023-12-24 21:48:36,481 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 15 treesize of output 1 [2023-12-24 21:48:36,485 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 11 treesize of output 7 [2023-12-24 21:48:36,540 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 19 treesize of output 11 [2023-12-24 21:48:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 21:48:36,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:48:36,633 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 19 treesize of output 17 [2023-12-24 21:48:36,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:48:36,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 6 [2023-12-24 21:48:36,643 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 12 treesize of output 8 [2023-12-24 21:48:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 21:48:36,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:48:36,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075556982] [2023-12-24 21:48:36,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075556982] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:48:36,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:48:36,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-24 21:48:36,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725385199] [2023-12-24 21:48:36,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:48:36,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 21:48:36,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:48:36,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 21:48:36,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:48:36,650 INFO L87 Difference]: Start difference. First operand 864 states and 1159 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:48:38,875 INFO L93 Difference]: Finished difference Result 1544 states and 2088 transitions. [2023-12-24 21:48:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 21:48:38,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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 29 [2023-12-24 21:48:38,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:48:38,879 INFO L225 Difference]: With dead ends: 1544 [2023-12-24 21:48:38,879 INFO L226 Difference]: Without dead ends: 780 [2023-12-24 21:48:38,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:48:38,880 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:48:38,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 99 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-24 21:48:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2023-12-24 21:48:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 778. [2023-12-24 21:48:38,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 1.3474903474903475) internal successors, (1047), 777 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1047 transitions. [2023-12-24 21:48:38,945 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1047 transitions. Word has length 29 [2023-12-24 21:48:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:48:38,945 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1047 transitions. [2023-12-24 21:48:38,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1047 transitions. [2023-12-24 21:48:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-24 21:48:38,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:48:38,945 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:48:38,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-24 21:48:39,150 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-24 21:48:39,150 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:48:39,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:48:39,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1085772068, now seen corresponding path program 2 times [2023-12-24 21:48:39,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:48:39,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257294433] [2023-12-24 21:48:39,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:48:39,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:48:39,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:48:39,153 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-24 21:48:39,154 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-24 21:48:39,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:48:39,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:48:39,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-24 21:48:39,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:48:39,332 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 15 treesize of output 1 [2023-12-24 21:48:39,333 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 11 treesize of output 7 [2023-12-24 21:48:39,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 11 [2023-12-24 21:48:39,362 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 19 treesize of output 11 [2023-12-24 21:48:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 21:48:39,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:48:39,432 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 19 treesize of output 17 [2023-12-24 21:48:39,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:48:39,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 6 [2023-12-24 21:48:39,438 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 12 treesize of output 8 [2023-12-24 21:48:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 21:48:39,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:48:39,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257294433] [2023-12-24 21:48:39,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257294433] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:48:39,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:48:39,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 21:48:39,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414767286] [2023-12-24 21:48:39,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:48:39,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 21:48:39,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:48:39,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 21:48:39,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-24 21:48:39,509 INFO L87 Difference]: Start difference. First operand 778 states and 1047 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:48:42,575 INFO L93 Difference]: Finished difference Result 1720 states and 2330 transitions. [2023-12-24 21:48:42,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 21:48:42,575 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 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 33 [2023-12-24 21:48:42,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:48:42,578 INFO L225 Difference]: With dead ends: 1720 [2023-12-24 21:48:42,578 INFO L226 Difference]: Without dead ends: 1143 [2023-12-24 21:48:42,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2023-12-24 21:48:42,579 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 119 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-24 21:48:42,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 165 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-24 21:48:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2023-12-24 21:48:42,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 965. [2023-12-24 21:48:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.3350622406639003) internal successors, (1287), 964 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1287 transitions. [2023-12-24 21:48:42,648 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1287 transitions. Word has length 33 [2023-12-24 21:48:42,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:48:42,648 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1287 transitions. [2023-12-24 21:48:42,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:42,648 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1287 transitions. [2023-12-24 21:48:42,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-24 21:48:42,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:48:42,648 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:48:42,674 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-24 21:48:42,853 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-24 21:48:42,854 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:48:42,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:48:42,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1908281403, now seen corresponding path program 2 times [2023-12-24 21:48:42,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:48:42,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752110275] [2023-12-24 21:48:42,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:48:42,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:48:42,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:48:42,856 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-24 21:48:42,878 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-24 21:48:42,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:48:42,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:48:43,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 21:48:43,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:48:43,091 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 42 treesize of output 30 [2023-12-24 21:48:43,092 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 34 treesize of output 22 [2023-12-24 21:48:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 21:48:43,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:48:43,837 INFO L349 Elim1Store]: treesize reduction 4, result has 78.9 percent of original size [2023-12-24 21:48:43,837 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 46 treesize of output 41 [2023-12-24 21:48:43,854 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-12-24 21:48:43,854 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 32 treesize of output 12 [2023-12-24 21:48:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 21:48:43,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:48:43,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752110275] [2023-12-24 21:48:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752110275] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:48:43,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:48:43,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-12-24 21:48:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427769846] [2023-12-24 21:48:43,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:48:43,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 21:48:43,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:48:43,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 21:48:43,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:48:43,865 INFO L87 Difference]: Start difference. First operand 965 states and 1287 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 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-24 21:48:47,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:48:47,610 INFO L93 Difference]: Finished difference Result 1933 states and 2581 transitions. [2023-12-24 21:48:47,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 21:48:47,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 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) Word has length 33 [2023-12-24 21:48:47,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:48:47,613 INFO L225 Difference]: With dead ends: 1933 [2023-12-24 21:48:47,613 INFO L226 Difference]: Without dead ends: 1038 [2023-12-24 21:48:47,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-24 21:48:47,614 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-12-24 21:48:47,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 121 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-12-24 21:48:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2023-12-24 21:48:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 944. [2023-12-24 21:48:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 943 states have (on average 1.3170731707317074) internal successors, (1242), 943 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1242 transitions. [2023-12-24 21:48:47,689 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1242 transitions. Word has length 33 [2023-12-24 21:48:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:48:47,689 INFO L495 AbstractCegarLoop]: Abstraction has 944 states and 1242 transitions. [2023-12-24 21:48:47,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 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-24 21:48:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1242 transitions. [2023-12-24 21:48:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-24 21:48:47,690 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:48:47,690 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2023-12-24 21:48:47,696 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 (17)] Ended with exit code 0 [2023-12-24 21:48:47,896 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-24 21:48:47,896 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:48:47,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:48:47,897 INFO L85 PathProgramCache]: Analyzing trace with hash 546084471, now seen corresponding path program 4 times [2023-12-24 21:48:47,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:48:47,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800361545] [2023-12-24 21:48:47,897 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 21:48:47,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:48:47,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:48:47,898 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-24 21:48:47,900 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-24 21:48:48,051 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 21:48:48,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:48:48,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-24 21:48:48,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:48:48,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 21:48:48,067 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 11 treesize of output 7 [2023-12-24 21:48:48,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-12-24 21:48:48,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-12-24 21:48:48,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 16 [2023-12-24 21:48:48,131 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 20 treesize of output 12 [2023-12-24 21:48:48,150 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 16 treesize of output 8 [2023-12-24 21:48:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-24 21:48:48,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:48:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 37 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-24 21:48:48,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:48:48,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800361545] [2023-12-24 21:48:48,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800361545] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:48:48,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:48:48,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-12-24 21:48:48,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071420984] [2023-12-24 21:48:48,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:48:48,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 21:48:48,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:48:48,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 21:48:48,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-24 21:48:48,212 INFO L87 Difference]: Start difference. First operand 944 states and 1242 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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-24 21:48:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:48:49,997 INFO L93 Difference]: Finished difference Result 1895 states and 2505 transitions. [2023-12-24 21:48:50,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 21:48:50,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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) Word has length 35 [2023-12-24 21:48:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:48:50,004 INFO L225 Difference]: With dead ends: 1895 [2023-12-24 21:48:50,004 INFO L226 Difference]: Without dead ends: 986 [2023-12-24 21:48:50,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-24 21:48:50,005 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 48 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-24 21:48:50,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 185 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-24 21:48:50,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2023-12-24 21:48:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 915. [2023-12-24 21:48:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 914 states have (on average 1.3074398249452954) internal successors, (1195), 914 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:48:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1195 transitions. [2023-12-24 21:48:50,071 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1195 transitions. Word has length 35 [2023-12-24 21:48:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:48:50,071 INFO L495 AbstractCegarLoop]: Abstraction has 915 states and 1195 transitions. [2023-12-24 21:48:50,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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-24 21:48:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1195 transitions. [2023-12-24 21:48:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-24 21:48:50,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:48:50,071 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2023-12-24 21:48:50,076 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-24 21:48:50,277 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-24 21:48:50,278 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:48:50,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:48:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1381627865, now seen corresponding path program 5 times [2023-12-24 21:48:50,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:48:50,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796253376] [2023-12-24 21:48:50,278 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-24 21:48:50,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:48:50,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:48:50,279 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-24 21:48:50,281 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-24 21:48:50,494 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-12-24 21:48:50,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:48:50,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 79 conjunts are in the unsatisfiable core [2023-12-24 21:48:50,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:48:50,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 11 [2023-12-24 21:48:50,524 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 15 treesize of output 1 [2023-12-24 21:48:50,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 11 [2023-12-24 21:48:50,531 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 11 treesize of output 7 [2023-12-24 21:48:50,646 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 23 treesize of output 15 [2023-12-24 21:48:50,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:48:50,655 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 28 treesize of output 15 [2023-12-24 21:48:50,698 INFO L349 Elim1Store]: treesize reduction 42, result has 36.4 percent of original size [2023-12-24 21:48:50,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 43 [2023-12-24 21:48:50,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 65 treesize of output 34 [2023-12-24 21:48:50,725 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 19 treesize of output 11 [2023-12-24 21:48:50,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-12-24 21:48:51,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-12-24 21:48:51,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 101 treesize of output 58 [2023-12-24 21:48:51,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:48:51,173 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 44 treesize of output 42 [2023-12-24 21:48:51,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:48:51,184 INFO L349 Elim1Store]: treesize reduction 6, result has 76.9 percent of original size [2023-12-24 21:48:51,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2023-12-24 21:48:51,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 34 [2023-12-24 21:48:51,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 1 [2023-12-24 21:48:51,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:48:51,218 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 29 treesize of output 31 [2023-12-24 21:48:51,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2023-12-24 21:48:51,268 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 88 treesize of output 60 [2023-12-24 21:48:51,467 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-24 21:48:51,467 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 29 [2023-12-24 21:48:51,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 21:48:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:48:51,532 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:48:51,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:48:51,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 75 [2023-12-24 21:48:51,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:48:51,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 68 [2023-12-24 21:49:01,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:49:01,593 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 84 [2023-12-24 21:49:01,598 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:49:01,601 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 81 treesize of output 69 [2023-12-24 21:49:01,605 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 107 treesize of output 91 [2023-12-24 21:49:05,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:49:05,617 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2023-12-24 21:49:05,621 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:49:05,624 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 52 treesize of output 44 [2023-12-24 21:49:06,390 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:49:06,391 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:49:06,391 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:49:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 11 proven. 49 refuted. 8 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:49:06,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:49:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796253376] [2023-12-24 21:49:06,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796253376] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:49:06,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:49:06,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2023-12-24 21:49:06,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544327165] [2023-12-24 21:49:06,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:49:06,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-24 21:49:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:49:06,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-24 21:49:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=595, Unknown=2, NotChecked=0, Total=702 [2023-12-24 21:49:06,394 INFO L87 Difference]: Start difference. First operand 915 states and 1195 transitions. Second operand has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:49:10,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 21:49:45,993 WARN L293 SmtUtils]: Spent 32.04s on a formula simplification. DAG size of input: 73 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 21:50:18,263 WARN L293 SmtUtils]: Spent 32.15s on a formula simplification. DAG size of input: 90 DAG size of output: 87 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 21:50:50,575 WARN L293 SmtUtils]: Spent 32.11s on a formula simplification. DAG size of input: 92 DAG size of output: 89 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 21:51:23,716 WARN L293 SmtUtils]: Spent 32.09s on a formula simplification. DAG size of input: 81 DAG size of output: 78 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 21:51:35,861 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 [1] [2023-12-24 21:51:40,282 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 [1] [2023-12-24 21:51:48,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 21:51:57,281 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 [1] [2023-12-24 21:52:02,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 21:52:10,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 21:52:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:52:12,203 INFO L93 Difference]: Finished difference Result 1138 states and 1483 transitions. [2023-12-24 21:52:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-24 21:52:12,204 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-24 21:52:12,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:52:12,206 INFO L225 Difference]: With dead ends: 1138 [2023-12-24 21:52:12,207 INFO L226 Difference]: Without dead ends: 1136 [2023-12-24 21:52:12,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 145.3s TimeCoverageRelationStatistics Valid=645, Invalid=3013, Unknown=2, NotChecked=0, Total=3660 [2023-12-24 21:52:12,209 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 290 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 4 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:52:12,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 430 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 857 Invalid, 22 Unknown, 0 Unchecked, 46.2s Time] [2023-12-24 21:52:12,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2023-12-24 21:52:12,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1051. [2023-12-24 21:52:12,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.3095238095238095) internal successors, (1375), 1050 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:52:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1375 transitions. [2023-12-24 21:52:12,318 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1375 transitions. Word has length 38 [2023-12-24 21:52:12,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:52:12,318 INFO L495 AbstractCegarLoop]: Abstraction has 1051 states and 1375 transitions. [2023-12-24 21:52:12,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:52:12,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1375 transitions. [2023-12-24 21:52:12,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-24 21:52:12,319 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:52:12,319 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:52:12,324 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-24 21:52:12,524 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-24 21:52:12,525 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:52:12,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:52:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash 398157690, now seen corresponding path program 3 times [2023-12-24 21:52:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:52:12,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809243957] [2023-12-24 21:52:12,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 21:52:12,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:52:12,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:52:12,527 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-24 21:52:12,541 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-24 21:52:12,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-24 21:52:12,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:52:12,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-24 21:52:12,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:52:12,685 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-24 21:52:12,691 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-24 21:52:12,708 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 23 treesize of output 11 [2023-12-24 21:52:12,713 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 23 treesize of output 11 [2023-12-24 21:52:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-24 21:52:12,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:52:12,833 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 25 treesize of output 21 [2023-12-24 21:52:12,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:52:12,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:52:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-24 21:52:12,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:52:12,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809243957] [2023-12-24 21:52:12,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809243957] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:52:12,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:52:12,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-12-24 21:52:12,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752004361] [2023-12-24 21:52:12,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:52:12,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 21:52:12,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:52:12,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 21:52:12,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-24 21:52:12,850 INFO L87 Difference]: Start difference. First operand 1051 states and 1375 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:52:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:52:14,052 INFO L93 Difference]: Finished difference Result 2110 states and 2775 transitions. [2023-12-24 21:52:14,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 21:52:14,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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 39 [2023-12-24 21:52:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:52:14,055 INFO L225 Difference]: With dead ends: 2110 [2023-12-24 21:52:14,055 INFO L226 Difference]: Without dead ends: 1130 [2023-12-24 21:52:14,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-12-24 21:52:14,056 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:52:14,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 74 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 21:52:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2023-12-24 21:52:14,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1063. [2023-12-24 21:52:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.3116760828625236) internal successors, (1393), 1062 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:52:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1393 transitions. [2023-12-24 21:52:14,160 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1393 transitions. Word has length 39 [2023-12-24 21:52:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:52:14,160 INFO L495 AbstractCegarLoop]: Abstraction has 1063 states and 1393 transitions. [2023-12-24 21:52:14,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:52:14,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1393 transitions. [2023-12-24 21:52:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-24 21:52:14,160 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:52:14,160 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2023-12-24 21:52:14,166 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-24 21:52:14,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:52:14,364 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:52:14,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:52:14,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1400216001, now seen corresponding path program 6 times [2023-12-24 21:52:14,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:52:14,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954070187] [2023-12-24 21:52:14,365 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-24 21:52:14,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:52:14,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:52:14,366 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:52:14,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-24 21:52:14,697 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-12-24 21:52:14,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:52:14,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-24 21:52:14,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:52:14,710 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 11 treesize of output 7 [2023-12-24 21:52:14,733 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 19 treesize of output 11 [2023-12-24 21:52:14,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 11 [2023-12-24 21:52:14,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-12-24 21:52:14,749 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 15 treesize of output 1 [2023-12-24 21:52:14,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-12-24 21:52:14,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 85 treesize of output 50 [2023-12-24 21:52:15,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:52:15,024 INFO L349 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size [2023-12-24 21:52:15,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 50 [2023-12-24 21:52:15,074 INFO L349 Elim1Store]: treesize reduction 74, result has 56.2 percent of original size [2023-12-24 21:52:15,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 117 [2023-12-24 21:52:15,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2023-12-24 21:52:15,149 INFO L349 Elim1Store]: treesize reduction 6, result has 72.7 percent of original size [2023-12-24 21:52:15,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 25 [2023-12-24 21:52:15,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2023-12-24 21:52:15,211 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 108 treesize of output 72 [2023-12-24 21:52:16,060 INFO L349 Elim1Store]: treesize reduction 32, result has 73.6 percent of original size [2023-12-24 21:52:16,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 162 treesize of output 179 [2023-12-24 21:52:16,323 INFO L349 Elim1Store]: treesize reduction 40, result has 66.9 percent of original size [2023-12-24 21:52:16,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 142 [2023-12-24 21:52:18,467 INFO L349 Elim1Store]: treesize reduction 17, result has 41.4 percent of original size [2023-12-24 21:52:18,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 33 [2023-12-24 21:52:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 62 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 21:52:18,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:52:18,762 INFO L349 Elim1Store]: treesize reduction 4, result has 91.5 percent of original size [2023-12-24 21:52:18,762 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 56 treesize of output 51 [2023-12-24 21:52:19,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:52:19,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 279 treesize of output 247 [2023-12-24 21:52:19,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:52:19,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 205 [2023-12-24 21:53:12,179 WARN L293 SmtUtils]: Spent 44.46s on a formula simplification. DAG size of input: 193 DAG size of output: 175 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 21:53:12,179 INFO L349 Elim1Store]: treesize reduction 318, result has 77.2 percent of original size [2023-12-24 21:53:12,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 1422 treesize of output 2044 [2023-12-24 21:53:12,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:12,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1198 treesize of output 1169 [2023-12-24 21:53:12,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:12,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 890 treesize of output 885 [2023-12-24 21:53:12,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:12,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1125 treesize of output 1075 [2023-12-24 21:53:13,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:53:13,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1049 treesize of output 991 [2023-12-24 21:53:19,422 INFO L349 Elim1Store]: treesize reduction 15, result has 57.1 percent of original size [2023-12-24 21:53:19,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 44 [2023-12-24 22:00:37,767 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-24 22:00:37,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:00:37,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954070187] [2023-12-24 22:00:37,768 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-24 22:00:37,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-12-24 22:00:37,774 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 (21)] Forceful destruction successful, exit code 0 [2023-12-24 22:00:37,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:00:37,969 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:286) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 90 more [2023-12-24 22:00:37,972 INFO L158 Benchmark]: Toolchain (without parser) took 781712.65ms. Allocated memory was 233.8MB in the beginning and 281.0MB in the end (delta: 47.2MB). Free memory was 180.5MB in the beginning and 189.1MB in the end (delta: -8.6MB). Peak memory consumption was 160.9MB. Max. memory is 8.0GB. [2023-12-24 22:00:37,973 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 186.6MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:00:37,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.28ms. Allocated memory is still 233.8MB. Free memory was 180.2MB in the beginning and 161.3MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 22:00:37,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.00ms. Allocated memory is still 233.8MB. Free memory was 161.3MB in the beginning and 159.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:00:37,973 INFO L158 Benchmark]: Boogie Preprocessor took 44.94ms. Allocated memory is still 233.8MB. Free memory was 159.1MB in the beginning and 155.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-24 22:00:37,973 INFO L158 Benchmark]: RCFGBuilder took 751.83ms. Allocated memory is still 233.8MB. Free memory was 155.6MB in the beginning and 195.5MB in the end (delta: -39.9MB). Peak memory consumption was 22.3MB. Max. memory is 8.0GB. [2023-12-24 22:00:37,973 INFO L158 Benchmark]: TraceAbstraction took 780573.39ms. Allocated memory was 233.8MB in the beginning and 281.0MB in the end (delta: 47.2MB). Free memory was 194.5MB in the beginning and 189.1MB in the end (delta: 5.4MB). Peak memory consumption was 174.3MB. Max. memory is 8.0GB. [2023-12-24 22:00:37,974 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.20ms. Allocated memory is still 186.6MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 299.28ms. Allocated memory is still 233.8MB. Free memory was 180.2MB in the beginning and 161.3MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.00ms. Allocated memory is still 233.8MB. Free memory was 161.3MB in the beginning and 159.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.94ms. Allocated memory is still 233.8MB. Free memory was 159.1MB in the beginning and 155.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 751.83ms. Allocated memory is still 233.8MB. Free memory was 155.6MB in the beginning and 195.5MB in the end (delta: -39.9MB). Peak memory consumption was 22.3MB. Max. memory is 8.0GB. * TraceAbstraction took 780573.39ms. Allocated memory was 233.8MB in the beginning and 281.0MB in the end (delta: 47.2MB). Free memory was 194.5MB in the beginning and 189.1MB in the end (delta: 5.4MB). Peak memory consumption was 174.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...