/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-fpi/nsqm.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 20:45:11,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 20:45:11,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-21 20:45:11,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 20:45:11,747 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 20:45:11,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 20:45:11,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 20:45:11,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 20:45:11,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 20:45:11,776 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 20:45:11,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 20:45:11,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 20:45:11,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 20:45:11,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 20:45:11,778 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 20:45:11,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 20:45:11,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 20:45:11,779 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 20:45:11,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 20:45:11,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 20:45:11,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 20:45:11,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 20:45:11,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 20:45:11,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 20:45:11,780 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 20:45:11,780 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 20:45:11,781 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 20:45:11,781 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 20:45:11,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 20:45:11,781 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 20:45:11,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 20:45:11,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 20:45:11,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 20:45:11,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 20:45:11,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:45:11,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 20:45:11,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 20:45:11,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 20:45:11,783 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 20:45:11,783 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 20:45:11,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 20:45:11,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 20:45:11,783 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 20:45:11,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 20:45:11,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 20:45:11,784 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 20:45:11,784 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-21 20:45:11,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 20:45:11,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 20:45:11,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 20:45:11,975 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 20:45:11,976 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 20:45:11,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/nsqm.c [2023-12-21 20:45:12,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 20:45:13,149 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 20:45:13,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/nsqm.c [2023-12-21 20:45:13,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b18929811/9a2fede62591418c9279822377cfbaee/FLAG783abe1f7 [2023-12-21 20:45:13,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b18929811/9a2fede62591418c9279822377cfbaee [2023-12-21 20:45:13,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 20:45:13,181 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 20:45:13,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 20:45:13,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 20:45:13,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 20:45:13,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:45:13" (1/1) ... [2023-12-21 20:45:13,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@578692fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:45:13, skipping insertion in model container [2023-12-21 20:45:13,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:45:13" (1/1) ... [2023-12-21 20:45:13,209 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 20:45:13,312 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/nsqm.c[587,600] [2023-12-21 20:45:13,329 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:45:13,338 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 20:45:13,347 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/nsqm.c[587,600] [2023-12-21 20:45:13,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:45:13,375 INFO L206 MainTranslator]: Completed translation [2023-12-21 20:45:13,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:45:13 WrapperNode [2023-12-21 20:45:13,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 20:45:13,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 20:45:13,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 20:45:13,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 20:45:13,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:45:13" (1/1) ... [2023-12-21 20:45:13,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:45:13" (1/1) ... [2023-12-21 20:45:13,403 INFO L138 Inliner]: procedures = 18, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2023-12-21 20:45:13,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 20:45:13,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 20:45:13,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 20:45:13,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 20:45:13,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:45:13" (1/1) ... [2023-12-21 20:45:13,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:45:13" (1/1) ... [2023-12-21 20:45:13,413 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:45:13" (1/1) ... [2023-12-21 20:45:13,442 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 7, 4, 4]. 41 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 4 writes are split as follows [0, 0, 2, 2]. [2023-12-21 20:45:13,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:45:13" (1/1) ... [2023-12-21 20:45:13,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:45:13" (1/1) ... [2023-12-21 20:45:13,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:45:13" (1/1) ... [2023-12-21 20:45:13,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:45:13" (1/1) ... [2023-12-21 20:45:13,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:45:13" (1/1) ... [2023-12-21 20:45:13,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:45:13" (1/1) ... [2023-12-21 20:45:13,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 20:45:13,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 20:45:13,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 20:45:13,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 20:45:13,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:45:13" (1/1) ... [2023-12-21 20:45:13,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:45:13,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 20:45:13,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 20:45:13,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 20:45:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 20:45:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 20:45:13,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 20:45:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 20:45:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-21 20:45:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-12-21 20:45:13,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-12-21 20:45:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-12-21 20:45:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-12-21 20:45:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 20:45:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 20:45:13,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 20:45:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-12-21 20:45:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-12-21 20:45:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-12-21 20:45:13,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-12-21 20:45:13,593 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 20:45:13,595 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 20:45:13,805 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 20:45:13,832 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 20:45:13,832 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 20:45:13,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:45:13 BoogieIcfgContainer [2023-12-21 20:45:13,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 20:45:13,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 20:45:13,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 20:45:13,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 20:45:13,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:45:13" (1/3) ... [2023-12-21 20:45:13,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ed61ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:45:13, skipping insertion in model container [2023-12-21 20:45:13,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:45:13" (2/3) ... [2023-12-21 20:45:13,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ed61ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:45:13, skipping insertion in model container [2023-12-21 20:45:13,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:45:13" (3/3) ... [2023-12-21 20:45:13,839 INFO L112 eAbstractionObserver]: Analyzing ICFG nsqm.c [2023-12-21 20:45:13,851 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 20:45:13,851 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 20:45:13,893 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 20:45:13,898 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;@2060f0e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 20:45:13,898 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 20:45:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-21 20:45:13,909 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:45:13,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:45:13,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:45:13,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:45:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash -841652609, now seen corresponding path program 1 times [2023-12-21 20:45:13,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:45:13,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454553734] [2023-12-21 20:45:13,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:45:13,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:45:13,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:45:13,925 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:45:13,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 20:45:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:45:14,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 20:45:14,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:45:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:45:14,032 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:45:14,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:45:14,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454553734] [2023-12-21 20:45:14,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454553734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:45:14,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:45:14,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 20:45:14,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566520500] [2023-12-21 20:45:14,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:45:14,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 20:45:14,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:45:14,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 20:45:14,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 20:45:14,057 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:45:14,100 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2023-12-21 20:45:14,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 20:45:14,102 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-12-21 20:45:14,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:45:14,106 INFO L225 Difference]: With dead ends: 29 [2023-12-21 20:45:14,107 INFO L226 Difference]: Without dead ends: 13 [2023-12-21 20:45:14,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 20:45:14,113 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:45:14,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 20:45:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-21 20:45:14,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-21 20:45:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-12-21 20:45:14,135 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2023-12-21 20:45:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:45:14,136 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-12-21 20:45:14,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-12-21 20:45:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-21 20:45:14,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:45:14,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:45:14,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-21 20:45:14,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:45:14,341 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:45:14,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:45:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash -161594239, now seen corresponding path program 1 times [2023-12-21 20:45:14,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:45:14,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505973452] [2023-12-21 20:45:14,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:45:14,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:45:14,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:45:14,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:45:14,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-21 20:45:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:45:14,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-21 20:45:14,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:45:14,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:45:14,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2023-12-21 20:45:14,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:14,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2023-12-21 20:45:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:45:14,962 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:45:14,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:45:14,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505973452] [2023-12-21 20:45:14,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505973452] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:45:14,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:45:14,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 20:45:14,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595384664] [2023-12-21 20:45:14,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:45:14,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 20:45:14,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:45:14,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 20:45:14,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 20:45:14,966 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:45:15,362 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-12-21 20:45:15,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 20:45:15,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-12-21 20:45:15,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:45:15,363 INFO L225 Difference]: With dead ends: 28 [2023-12-21 20:45:15,363 INFO L226 Difference]: Without dead ends: 14 [2023-12-21 20:45:15,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-12-21 20:45:15,364 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 20:45:15,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 23 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 20:45:15,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-21 20:45:15,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-21 20:45:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-12-21 20:45:15,368 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2023-12-21 20:45:15,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:45:15,368 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-12-21 20:45:15,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:15,368 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-12-21 20:45:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 20:45:15,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:45:15,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:45:15,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-21 20:45:15,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:45:15,573 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:45:15,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:45:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1524286018, now seen corresponding path program 1 times [2023-12-21 20:45:15,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:45:15,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185162595] [2023-12-21 20:45:15,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:45:15,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:45:15,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:45:15,575 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:45:15,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-21 20:45:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:45:15,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 20:45:15,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:45:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:45:15,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:45:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:45:15,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:45:15,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185162595] [2023-12-21 20:45:15,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185162595] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:45:15,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:45:15,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2023-12-21 20:45:15,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139801924] [2023-12-21 20:45:15,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:45:15,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 20:45:15,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:45:15,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 20:45:15,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-21 20:45:15,902 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:16,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:45:16,330 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2023-12-21 20:45:16,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 20:45:16,339 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-21 20:45:16,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:45:16,340 INFO L225 Difference]: With dead ends: 35 [2023-12-21 20:45:16,340 INFO L226 Difference]: Without dead ends: 28 [2023-12-21 20:45:16,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2023-12-21 20:45:16,342 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 73 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 20:45:16,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 25 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 20:45:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-21 20:45:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2023-12-21 20:45:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-21 20:45:16,346 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2023-12-21 20:45:16,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:45:16,346 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-21 20:45:16,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-21 20:45:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 20:45:16,347 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:45:16,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:45:16,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 20:45:16,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:45:16,551 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:45:16,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:45:16,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1129310352, now seen corresponding path program 1 times [2023-12-21 20:45:16,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:45:16,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846972368] [2023-12-21 20:45:16,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:45:16,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:45:16,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:45:16,553 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:45:16,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 (5)] Waiting until timeout for monitored process [2023-12-21 20:45:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:45:16,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-21 20:45:16,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:45:16,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:45:16,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2023-12-21 20:45:16,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:16,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-21 20:45:17,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:17,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2023-12-21 20:45:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:45:17,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:45:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:45:19,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:45:19,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846972368] [2023-12-21 20:45:19,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846972368] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:45:19,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:45:19,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-12-21 20:45:19,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918633470] [2023-12-21 20:45:19,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:45:19,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 20:45:19,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:45:19,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 20:45:19,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-12-21 20:45:19,288 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:45:24,065 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2023-12-21 20:45:24,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 20:45:24,074 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-21 20:45:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:45:24,075 INFO L225 Difference]: With dead ends: 47 [2023-12-21 20:45:24,075 INFO L226 Difference]: Without dead ends: 40 [2023-12-21 20:45:24,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2023-12-21 20:45:24,076 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 55 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-21 20:45:24,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 59 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-21 20:45:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-21 20:45:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2023-12-21 20:45:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-12-21 20:45:24,084 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 13 [2023-12-21 20:45:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:45:24,084 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-12-21 20:45:24,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-12-21 20:45:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 20:45:24,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:45:24,085 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:45:24,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-21 20:45:24,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:45:24,289 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:45:24,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:45:24,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1866512801, now seen corresponding path program 2 times [2023-12-21 20:45:24,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:45:24,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747832924] [2023-12-21 20:45:24,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:45:24,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:45:24,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:45:24,292 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:45:24,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-21 20:45:24,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:45:24,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:45:24,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-21 20:45:24,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:45:24,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:45:24,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2023-12-21 20:45:24,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:24,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-21 20:45:24,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:24,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-21 20:45:25,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:25,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2023-12-21 20:45:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:45:25,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:45:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:45:28,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:45:28,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747832924] [2023-12-21 20:45:28,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747832924] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:45:28,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:45:28,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2023-12-21 20:45:28,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815358242] [2023-12-21 20:45:28,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:45:28,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 20:45:28,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:45:28,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 20:45:28,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-12-21 20:45:28,005 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:45:35,407 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2023-12-21 20:45:35,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 20:45:35,417 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-21 20:45:35,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:45:35,418 INFO L225 Difference]: With dead ends: 74 [2023-12-21 20:45:35,418 INFO L226 Difference]: Without dead ends: 62 [2023-12-21 20:45:35,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=299, Invalid=823, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 20:45:35,419 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 96 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-21 20:45:35,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 91 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-21 20:45:35,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-21 20:45:35,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 41. [2023-12-21 20:45:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2023-12-21 20:45:35,429 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 15 [2023-12-21 20:45:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:45:35,429 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2023-12-21 20:45:35,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2023-12-21 20:45:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-21 20:45:35,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:45:35,429 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:45:35,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-21 20:45:35,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:45:35,637 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:45:35,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:45:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash 810981082, now seen corresponding path program 1 times [2023-12-21 20:45:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:45:35,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267086447] [2023-12-21 20:45:35,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:45:35,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:45:35,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:45:35,639 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:45:35,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-21 20:45:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:45:35,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-21 20:45:35,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:45:35,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:45:35,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:45:35,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:45:35,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2023-12-21 20:45:36,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:36,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2023-12-21 20:45:36,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:36,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 75 [2023-12-21 20:45:36,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:36,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 73 [2023-12-21 20:45:36,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:45:36,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 83 [2023-12-21 20:45:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:45:36,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:45:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:45:42,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:45:42,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267086447] [2023-12-21 20:45:42,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267086447] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:45:42,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:45:42,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2023-12-21 20:45:42,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503626554] [2023-12-21 20:45:42,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:45:42,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 20:45:42,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:45:42,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 20:45:42,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2023-12-21 20:45:42,744 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:45:57,227 WARN L293 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:46:09,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:46:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:46:10,665 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2023-12-21 20:46:10,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-21 20:46:10,665 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-21 20:46:10,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:46:10,665 INFO L225 Difference]: With dead ends: 63 [2023-12-21 20:46:10,666 INFO L226 Difference]: Without dead ends: 52 [2023-12-21 20:46:10,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=339, Invalid=1221, Unknown=0, NotChecked=0, Total=1560 [2023-12-21 20:46:10,668 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 67 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-12-21 20:46:10,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 69 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-12-21 20:46:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-21 20:46:10,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2023-12-21 20:46:10,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:46:10,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2023-12-21 20:46:10,680 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 16 [2023-12-21 20:46:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:46:10,680 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2023-12-21 20:46:10,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:46:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2023-12-21 20:46:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 20:46:10,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:46:10,680 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:46:10,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-21 20:46:10,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:46:10,884 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:46:10,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:46:10,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1469567504, now seen corresponding path program 3 times [2023-12-21 20:46:10,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:46:10,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481568996] [2023-12-21 20:46:10,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:46:10,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:46:10,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:46:10,886 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:46:10,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-21 20:46:11,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 20:46:11,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:46:11,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-21 20:46:11,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:46:11,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:46:11,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2023-12-21 20:46:11,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:46:11,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-21 20:46:11,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:46:11,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-21 20:46:11,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:46:11,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-21 20:46:11,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:46:11,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2023-12-21 20:46:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:46:12,020 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:46:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:46:15,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:46:15,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481568996] [2023-12-21 20:46:15,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481568996] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:46:15,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:46:15,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2023-12-21 20:46:15,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84729471] [2023-12-21 20:46:15,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:46:15,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 20:46:15,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:46:15,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 20:46:15,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2023-12-21 20:46:15,999 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 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-21 20:46:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:46:27,660 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2023-12-21 20:46:27,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-21 20:46:27,670 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 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 17 [2023-12-21 20:46:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:46:27,673 INFO L225 Difference]: With dead ends: 93 [2023-12-21 20:46:27,673 INFO L226 Difference]: Without dead ends: 77 [2023-12-21 20:46:27,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=422, Invalid=1138, Unknown=0, NotChecked=0, Total=1560 [2023-12-21 20:46:27,686 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 120 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-21 20:46:27,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 129 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-12-21 20:46:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-21 20:46:27,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 48. [2023-12-21 20:46:27,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:46:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2023-12-21 20:46:27,703 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 17 [2023-12-21 20:46:27,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:46:27,703 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2023-12-21 20:46:27,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 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-21 20:46:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2023-12-21 20:46:27,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 20:46:27,704 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:46:27,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:46:27,710 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-21 20:46:27,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:46:27,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:46:27,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:46:27,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1653612503, now seen corresponding path program 2 times [2023-12-21 20:46:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:46:27,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798515063] [2023-12-21 20:46:27,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:46:27,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:46:27,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:46:27,906 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:46:27,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-21 20:46:28,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:46:28,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:46:28,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-21 20:46:28,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:46:28,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:46:28,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2023-12-21 20:46:28,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:46:28,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:46:28,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:46:28,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2023-12-21 20:46:28,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:46:28,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 79 [2023-12-21 20:46:29,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:46:29,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 165 treesize of output 101 [2023-12-21 20:46:29,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:46:29,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 63 [2023-12-21 20:46:29,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:46:29,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 77 [2023-12-21 20:46:30,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:46:30,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 75 [2023-12-21 20:46:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:46:30,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:46:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:46:39,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:46:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798515063] [2023-12-21 20:46:39,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798515063] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:46:39,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:46:39,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2023-12-21 20:46:39,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286023124] [2023-12-21 20:46:39,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:46:39,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 20:46:39,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:46:39,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 20:46:39,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2023-12-21 20:46:39,109 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:46:53,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:47:02,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:47:46,425 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 110 DAG size of output: 101 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:47:47,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:48:00,431 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-21 20:48:02,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:48:18,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:48:36,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:48:40,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:48:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:48:51,022 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2023-12-21 20:48:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-21 20:48:51,027 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 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 18 [2023-12-21 20:48:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:48:51,029 INFO L225 Difference]: With dead ends: 83 [2023-12-21 20:48:51,029 INFO L226 Difference]: Without dead ends: 81 [2023-12-21 20:48:51,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 110.9s TimeCoverageRelationStatistics Valid=522, Invalid=1927, Unknown=1, NotChecked=0, Total=2450 [2023-12-21 20:48:51,030 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 125 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.4s IncrementalHoareTripleChecker+Time [2023-12-21 20:48:51,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 81 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 255 Invalid, 2 Unknown, 0 Unchecked, 29.4s Time] [2023-12-21 20:48:51,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-21 20:48:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2023-12-21 20:48:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 60 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:48:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2023-12-21 20:48:51,087 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 18 [2023-12-21 20:48:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:48:51,087 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2023-12-21 20:48:51,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:48:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2023-12-21 20:48:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 20:48:51,088 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:48:51,088 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:48:51,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-21 20:48:51,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:48:51,297 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:48:51,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:48:51,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1271818559, now seen corresponding path program 4 times [2023-12-21 20:48:51,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:48:51,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946483275] [2023-12-21 20:48:51,297 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 20:48:51,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:48:51,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:48:51,298 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:48:51,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-21 20:48:51,616 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 20:48:51,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:48:51,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-21 20:48:51,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:48:51,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:48:51,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2023-12-21 20:48:52,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:48:52,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-21 20:48:52,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:48:52,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-21 20:48:52,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:48:52,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-21 20:48:52,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:48:52,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-21 20:48:52,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:48:52,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2023-12-21 20:48:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:48:52,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:48:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:48:57,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:48:57,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946483275] [2023-12-21 20:48:57,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946483275] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:48:57,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:48:57,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2023-12-21 20:48:57,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649863012] [2023-12-21 20:48:57,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:48:57,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 20:48:57,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:48:57,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 20:48:57,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=544, Unknown=0, NotChecked=0, Total=756 [2023-12-21 20:48:57,755 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:49:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:49:14,694 INFO L93 Difference]: Finished difference Result 128 states and 152 transitions. [2023-12-21 20:49:14,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-21 20:49:14,702 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-21 20:49:14,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:49:14,703 INFO L225 Difference]: With dead ends: 128 [2023-12-21 20:49:14,703 INFO L226 Difference]: Without dead ends: 112 [2023-12-21 20:49:14,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=570, Invalid=1499, Unknown=1, NotChecked=0, Total=2070 [2023-12-21 20:49:14,704 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 156 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:49:14,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 177 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2023-12-21 20:49:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-21 20:49:14,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 74. [2023-12-21 20:49:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 73 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:49:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2023-12-21 20:49:14,729 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 19 [2023-12-21 20:49:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:49:14,730 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2023-12-21 20:49:14,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:49:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2023-12-21 20:49:14,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-21 20:49:14,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:49:14,730 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:49:14,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-21 20:49:14,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:49:14,938 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:49:14,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:49:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1278749318, now seen corresponding path program 3 times [2023-12-21 20:49:14,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:49:14,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601240484] [2023-12-21 20:49:14,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:49:14,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:49:14,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:49:14,951 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:49:14,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-21 20:49:15,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 20:49:15,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:49:15,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-21 20:49:15,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:49:15,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:49:15,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:49:15,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:49:15,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2023-12-21 20:49:15,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:49:15,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2023-12-21 20:49:15,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:49:15,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 79 [2023-12-21 20:49:15,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:49:15,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 131 treesize of output 109 [2023-12-21 20:49:16,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:49:16,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 75 [2023-12-21 20:49:16,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:49:16,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 265 treesize of output 161 [2023-12-21 20:49:16,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:49:16,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 69 [2023-12-21 20:49:16,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:49:16,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 69 [2023-12-21 20:49:17,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:49:17,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 67 [2023-12-21 20:49:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:49:17,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:49:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:49:26,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:49:26,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601240484] [2023-12-21 20:49:26,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601240484] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:49:26,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:49:26,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2023-12-21 20:49:26,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150751592] [2023-12-21 20:49:26,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:49:26,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 20:49:26,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:49:26,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 20:49:26,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2023-12-21 20:49:26,687 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 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-21 20:49:42,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:49:44,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:49:48,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:49:49,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:50:11,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:50:14,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:51:00,242 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-21 20:51:05,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:51:06,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:51:24,436 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-21 20:51:28,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:51:30,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:51:51,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:51:53,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:51:57,576 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-21 20:51:59,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:52:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:52:20,624 INFO L93 Difference]: Finished difference Result 128 states and 149 transitions. [2023-12-21 20:52:20,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-21 20:52:20,627 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 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) Word has length 20 [2023-12-21 20:52:20,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:52:20,628 INFO L225 Difference]: With dead ends: 128 [2023-12-21 20:52:20,628 INFO L226 Difference]: Without dead ends: 126 [2023-12-21 20:52:20,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 127.5s TimeCoverageRelationStatistics Valid=784, Invalid=3245, Unknown=3, NotChecked=0, Total=4032 [2023-12-21 20:52:20,629 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 177 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 73 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.8s IncrementalHoareTripleChecker+Time [2023-12-21 20:52:20,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 113 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 406 Invalid, 5 Unknown, 0 Unchecked, 55.8s Time] [2023-12-21 20:52:20,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-21 20:52:20,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 80. [2023-12-21 20:52:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.240506329113924) internal successors, (98), 79 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:52:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2023-12-21 20:52:20,665 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 20 [2023-12-21 20:52:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:52:20,666 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2023-12-21 20:52:20,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 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-21 20:52:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2023-12-21 20:52:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-21 20:52:20,666 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:52:20,666 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:52:20,675 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-21 20:52:20,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:52:20,870 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:52:20,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:52:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash 509922465, now seen corresponding path program 4 times [2023-12-21 20:52:20,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:52:20,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53660314] [2023-12-21 20:52:20,871 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 20:52:20,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:52:20,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:52:20,872 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:52:20,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-21 20:52:21,291 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 20:52:21,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:52:21,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-21 20:52:21,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:52:21,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:52:21,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:52:21,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:52:21,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2023-12-21 20:52:21,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:52:21,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2023-12-21 20:52:21,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:52:21,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 79 [2023-12-21 20:52:22,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:52:22,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 75 [2023-12-21 20:52:22,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:52:22,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 147 treesize of output 135 [2023-12-21 20:52:22,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:52:22,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 307 treesize of output 195 [2023-12-21 20:52:24,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:52:24,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 245 treesize of output 205 [2023-12-21 20:52:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:52:24,623 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:52:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:52:56,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:52:56,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53660314] [2023-12-21 20:52:56,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53660314] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:52:56,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:52:56,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2023-12-21 20:52:56,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178080013] [2023-12-21 20:52:56,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:52:56,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-21 20:52:56,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:52:56,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-21 20:52:56,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=669, Unknown=1, NotChecked=0, Total=812 [2023-12-21 20:52:56,719 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:54:19,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:54:33,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:54:39,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:54:49,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:54:50,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:55:01,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:55:01,340 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2023-12-21 20:55:01,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-21 20:55:01,340 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-21 20:55:01,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:55:01,341 INFO L225 Difference]: With dead ends: 107 [2023-12-21 20:55:01,341 INFO L226 Difference]: Without dead ends: 92 [2023-12-21 20:55:01,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 127.7s TimeCoverageRelationStatistics Valid=650, Invalid=2771, Unknown=1, NotChecked=0, Total=3422 [2023-12-21 20:55:01,342 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 85 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:55:01,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 95 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 27.1s Time] [2023-12-21 20:55:01,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-21 20:55:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2023-12-21 20:55:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 77 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:55:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2023-12-21 20:55:01,381 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 21 [2023-12-21 20:55:01,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:55:01,381 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2023-12-21 20:55:01,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:55:01,381 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2023-12-21 20:55:01,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-21 20:55:01,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:55:01,382 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:55:01,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-21 20:55:01,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:55:01,590 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:55:01,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:55:01,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1246743376, now seen corresponding path program 5 times [2023-12-21 20:55:01,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:55:01,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185889431] [2023-12-21 20:55:01,591 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 20:55:01,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:55:01,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:55:01,592 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:55:01,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-21 20:55:01,978 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-12-21 20:55:01,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:55:01,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-21 20:55:01,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:55:02,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:55:02,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2023-12-21 20:55:02,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:55:02,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-21 20:55:02,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:55:02,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-21 20:55:02,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:55:02,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-21 20:55:02,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:55:02,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-21 20:55:02,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:55:02,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-12-21 20:55:03,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:55:03,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2023-12-21 20:55:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:55:03,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:55:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:55:10,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:55:10,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185889431] [2023-12-21 20:55:10,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185889431] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:55:10,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:55:10,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2023-12-21 20:55:10,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836848110] [2023-12-21 20:55:10,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:55:10,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 20:55:10,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:55:10,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 20:55:10,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 20:55:10,800 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:20,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:57:20,563 INFO L93 Difference]: Finished difference Result 170 states and 202 transitions. [2023-12-21 20:57:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-12-21 20:57:20,575 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-21 20:57:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:57:20,576 INFO L225 Difference]: With dead ends: 170 [2023-12-21 20:57:20,576 INFO L226 Difference]: Without dead ends: 150 [2023-12-21 20:57:20,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1762 ImplicationChecksByTransitivity, 120.9s TimeCoverageRelationStatistics Valid=1673, Invalid=4485, Unknown=4, NotChecked=0, Total=6162 [2023-12-21 20:57:20,578 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 325 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:57:20,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 250 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 16.6s Time] [2023-12-21 20:57:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-12-21 20:57:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 79. [2023-12-21 20:57:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 78 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2023-12-21 20:57:20,618 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 21 [2023-12-21 20:57:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:57:20,618 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2023-12-21 20:57:20,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:57:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2023-12-21 20:57:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 20:57:20,619 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:57:20,619 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:57:20,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-21 20:57:20,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:57:20,822 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:57:20,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:57:20,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1459908361, now seen corresponding path program 5 times [2023-12-21 20:57:20,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:57:20,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542829332] [2023-12-21 20:57:20,823 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 20:57:20,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:57:20,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:57:20,824 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:57:20,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-21 20:57:21,643 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-12-21 20:57:21,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:57:21,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-21 20:57:21,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:57:21,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:57:21,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-21 20:57:21,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:57:21,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2023-12-21 20:57:21,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:57:21,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2023-12-21 20:57:22,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:57:22,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 79 [2023-12-21 20:57:22,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:57:22,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 155 treesize of output 133 [2023-12-21 20:57:22,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:57:22,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 45 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 237 treesize of output 197 [2023-12-21 20:57:23,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:57:23,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 75 [2023-12-21 20:57:23,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:57:23,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 419 treesize of output 267 [2023-12-21 20:57:23,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:57:23,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 69 [2023-12-21 20:57:23,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:57:23,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 85 [2023-12-21 20:57:24,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:57:24,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 85 [2023-12-21 20:57:24,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:57:24,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 83 [2023-12-21 20:57:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:57:24,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:57:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:57:38,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:57:38,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542829332] [2023-12-21 20:57:38,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542829332] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:57:38,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:57:38,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2023-12-21 20:57:38,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610790193] [2023-12-21 20:57:38,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:57:38,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 20:57:38,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:57:38,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 20:57:38,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=816, Unknown=0, NotChecked=0, Total=992 [2023-12-21 20:57:38,652 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:58:07,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:58:09,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:58:13,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:58:17,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:58:19,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:58:41,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:58:52,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:58:57,349 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-21 20:59:37,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-12-21 20:59:54,357 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 20:59:54,358 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 20:59:55,271 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-21 20:59:55,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-21 20:59:55,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 106.3s TimeCoverageRelationStatistics Valid=590, Invalid=2272, Unknown=0, NotChecked=0, Total=2862 [2023-12-21 20:59:55,388 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 60 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 50 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:59:55,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 33 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 342 Invalid, 3 Unknown, 0 Unchecked, 44.6s Time] [2023-12-21 20:59:55,389 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 20:59:55,389 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-21 20:59:55,392 INFO L445 BasicCegarLoop]: Path program histogram: [5, 5, 1, 1, 1] [2023-12-21 20:59:55,393 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 20:59:55,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 08:59:55 BoogieIcfgContainer [2023-12-21 20:59:55,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 20:59:55,395 INFO L158 Benchmark]: Toolchain (without parser) took 882213.85ms. Allocated memory is still 347.1MB. Free memory was 294.7MB in the beginning and 185.5MB in the end (delta: 109.2MB). Peak memory consumption was 110.1MB. Max. memory is 8.0GB. [2023-12-21 20:59:55,395 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 249.6MB. Free memory was 199.2MB in the beginning and 199.1MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 20:59:55,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.87ms. Allocated memory is still 347.1MB. Free memory was 294.7MB in the beginning and 282.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 20:59:55,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.75ms. Allocated memory is still 347.1MB. Free memory was 282.7MB in the beginning and 281.0MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 20:59:55,395 INFO L158 Benchmark]: Boogie Preprocessor took 48.76ms. Allocated memory is still 347.1MB. Free memory was 281.0MB in the beginning and 278.6MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 20:59:55,395 INFO L158 Benchmark]: RCFGBuilder took 379.67ms. Allocated memory is still 347.1MB. Free memory was 278.6MB in the beginning and 262.4MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 20:59:55,396 INFO L158 Benchmark]: TraceAbstraction took 881560.07ms. Allocated memory is still 347.1MB. Free memory was 261.6MB in the beginning and 185.5MB in the end (delta: 76.0MB). Peak memory consumption was 76.6MB. Max. memory is 8.0GB. [2023-12-21 20:59:55,396 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.12ms. Allocated memory is still 249.6MB. Free memory was 199.2MB in the beginning and 199.1MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.87ms. Allocated memory is still 347.1MB. Free memory was 294.7MB in the beginning and 282.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.75ms. Allocated memory is still 347.1MB. Free memory was 282.7MB in the beginning and 281.0MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.76ms. Allocated memory is still 347.1MB. Free memory was 281.0MB in the beginning and 278.6MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 379.67ms. Allocated memory is still 347.1MB. Free memory was 278.6MB in the beginning and 262.4MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 881560.07ms. Allocated memory is still 347.1MB. Free memory was 261.6MB in the beginning and 185.5MB in the end (delta: 76.0MB). Peak memory consumption was 76.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 15). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 881.5s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 766.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 1361 SdHoareTripleChecker+Valid, 195.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1361 mSDsluCounter, 1159 SdHoareTripleChecker+Invalid, 190.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1012 mSDsCounter, 489 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3742 IncrementalHoareTripleChecker+Invalid, 4242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 489 mSolverCounterUnsat, 147 mSDtfsCounter, 3742 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 635 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 499 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6352 ImplicationChecksByTransitivity, 660.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=10, InterpolantAutomatonStates: 334, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 268 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 108.0s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 386 ConstructedInterpolants, 24 QuantifiedInterpolants, 38476 SizeOfPredicates, 136 NumberOfNonLiveVariables, 1094 ConjunctsInSsa, 382 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 8/264 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown