/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_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/sll2n_append_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 03:48:26,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:48:26,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 03:48:26,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:48:26,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:48:26,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:48:26,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:48:26,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:48:26,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:48:26,670 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:48:26,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:48:26,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:48:26,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:48:26,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:48:26,671 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:48:26,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:48:26,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:48:26,672 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:48:26,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:48:26,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:48:26,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:48:26,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:48:26,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:48:26,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:48:26,674 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:48:26,674 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:48:26,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:48:26,675 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:48:26,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:48:26,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:48:26,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:48:26,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:48:26,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:48:26,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:48:26,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:48:26,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:48:26,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:48:26,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:48:26,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:48:26,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:48:26,677 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:48:26,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:48:26,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:48:26,692 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 03:48:26,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:48:26,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:48:26,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:48:26,853 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:48:26,854 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:48:26,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_append_equal.i [2023-12-21 03:48:27,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:48:28,066 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:48:28,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_equal.i [2023-12-21 03:48:28,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c080391f/fe0781f8b53444a2a053f1a2a53d07dc/FLAG1bfec7298 [2023-12-21 03:48:28,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c080391f/fe0781f8b53444a2a053f1a2a53d07dc [2023-12-21 03:48:28,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:48:28,097 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:48:28,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:48:28,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:48:28,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:48:28,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:48:28" (1/1) ... [2023-12-21 03:48:28,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a1d4650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:48:28, skipping insertion in model container [2023-12-21 03:48:28,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:48:28" (1/1) ... [2023-12-21 03:48:28,136 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:48:28,381 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_equal.i[24197,24210] [2023-12-21 03:48:28,384 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:48:28,390 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:48:28,440 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_equal.i[24197,24210] [2023-12-21 03:48:28,440 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:48:28,467 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:48:28,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:48:28 WrapperNode [2023-12-21 03:48:28,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:48:28,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:48:28,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:48:28,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:48:28,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:48:28" (1/1) ... [2023-12-21 03:48:28,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:48:28" (1/1) ... [2023-12-21 03:48:28,499 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2023-12-21 03:48:28,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:48:28,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:48:28,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:48:28,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:48:28,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:48:28" (1/1) ... [2023-12-21 03:48:28,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:48:28" (1/1) ... [2023-12-21 03:48:28,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:48:28" (1/1) ... [2023-12-21 03:48:28,534 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 9, 6]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2023-12-21 03:48:28,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:48:28" (1/1) ... [2023-12-21 03:48:28,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:48:28" (1/1) ... [2023-12-21 03:48:28,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:48:28" (1/1) ... [2023-12-21 03:48:28,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:48:28" (1/1) ... [2023-12-21 03:48:28,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:48:28" (1/1) ... [2023-12-21 03:48:28,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:48:28" (1/1) ... [2023-12-21 03:48:28,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:48:28,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:48:28,555 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:48:28,555 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:48:28,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:48:28" (1/1) ... [2023-12-21 03:48:28,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:48:28,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:48:28,586 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 03:48:28,590 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 03:48:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 03:48:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 03:48:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 03:48:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 03:48:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 03:48:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 03:48:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-21 03:48:28,622 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-21 03:48:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 03:48:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:48:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 03:48:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 03:48:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 03:48:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-21 03:48:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 03:48:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 03:48:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-21 03:48:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 03:48:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-21 03:48:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-21 03:48:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-21 03:48:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:48:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:48:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 03:48:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:48:28,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:48:28,720 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:48:28,721 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:48:28,856 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:48:28,886 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:48:28,886 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-21 03:48:28,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:48:28 BoogieIcfgContainer [2023-12-21 03:48:28,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:48:28,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:48:28,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:48:28,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:48:28,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:48:28" (1/3) ... [2023-12-21 03:48:28,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aca517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:48:28, skipping insertion in model container [2023-12-21 03:48:28,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:48:28" (2/3) ... [2023-12-21 03:48:28,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aca517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:48:28, skipping insertion in model container [2023-12-21 03:48:28,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:48:28" (3/3) ... [2023-12-21 03:48:28,892 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-12-21 03:48:28,909 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:48:28,909 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 03:48:28,942 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:48:28,946 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;@633f69a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:48:28,947 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 03:48:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:48:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 03:48:28,954 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:28,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:48:28,958 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:28,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:28,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1424445379, now seen corresponding path program 1 times [2023-12-21 03:48:28,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:28,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178258863] [2023-12-21 03:48:28,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:28,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:29,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 03:48:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:29,207 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 03:48:29,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:29,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178258863] [2023-12-21 03:48:29,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178258863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:48:29,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:48:29,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 03:48:29,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506843383] [2023-12-21 03:48:29,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:48:29,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 03:48:29,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:29,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 03:48:29,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:48:29,246 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:48:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:29,301 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2023-12-21 03:48:29,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 03:48:29,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-12-21 03:48:29,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:29,307 INFO L225 Difference]: With dead ends: 46 [2023-12-21 03:48:29,308 INFO L226 Difference]: Without dead ends: 20 [2023-12-21 03:48:29,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 03:48:29,313 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:29,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:48:29,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-21 03:48:29,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-21 03:48:29,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:48:29,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-12-21 03:48:29,336 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2023-12-21 03:48:29,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:29,336 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-12-21 03:48:29,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:48:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2023-12-21 03:48:29,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 03:48:29,337 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:29,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:48:29,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:48:29,338 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:29,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:29,339 INFO L85 PathProgramCache]: Analyzing trace with hash 391783627, now seen corresponding path program 1 times [2023-12-21 03:48:29,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:29,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761148962] [2023-12-21 03:48:29,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:29,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:29,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 03:48:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:29,500 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 03:48:29,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:29,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761148962] [2023-12-21 03:48:29,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761148962] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:48:29,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:48:29,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:48:29,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830078658] [2023-12-21 03:48:29,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:48:29,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:48:29,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:29,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:48:29,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:48:29,506 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:48:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:29,538 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2023-12-21 03:48:29,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:48:29,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-12-21 03:48:29,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:29,541 INFO L225 Difference]: With dead ends: 39 [2023-12-21 03:48:29,541 INFO L226 Difference]: Without dead ends: 23 [2023-12-21 03:48:29,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:48:29,542 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:29,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:48:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-21 03:48:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-12-21 03:48:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:48:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-21 03:48:29,552 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2023-12-21 03:48:29,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:29,552 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-21 03:48:29,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 03:48:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-21 03:48:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 03:48:29,553 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:29,553 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:48:29,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:48:29,553 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:29,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:29,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1783597384, now seen corresponding path program 1 times [2023-12-21 03:48:29,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:29,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348819254] [2023-12-21 03:48:29,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:29,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:29,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:48:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:29,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 03:48:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:48:29,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:29,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348819254] [2023-12-21 03:48:29,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348819254] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:48:29,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272454363] [2023-12-21 03:48:29,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:29,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:29,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:48:29,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:48:29,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 03:48:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:29,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 03:48:29,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:48:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:48:29,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:48:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:48:29,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272454363] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:48:29,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:48:29,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-12-21 03:48:29,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844952306] [2023-12-21 03:48:29,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:48:29,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 03:48:29,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:29,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 03:48:29,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:48:29,969 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 03:48:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:30,007 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2023-12-21 03:48:30,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 03:48:30,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-12-21 03:48:30,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:30,009 INFO L225 Difference]: With dead ends: 40 [2023-12-21 03:48:30,009 INFO L226 Difference]: Without dead ends: 24 [2023-12-21 03:48:30,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 03:48:30,011 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:30,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 49 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:48:30,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-21 03:48:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-21 03:48:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:48:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-12-21 03:48:30,018 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 19 [2023-12-21 03:48:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:30,018 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-12-21 03:48:30,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-21 03:48:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-12-21 03:48:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 03:48:30,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:30,019 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:48:30,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 03:48:30,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:30,225 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:30,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:30,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1298850533, now seen corresponding path program 2 times [2023-12-21 03:48:30,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:30,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139700325] [2023-12-21 03:48:30,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:30,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:30,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:48:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:30,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:48:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:30,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:48:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:48:30,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:30,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139700325] [2023-12-21 03:48:30,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139700325] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:48:30,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632227101] [2023-12-21 03:48:30,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:48:30,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:30,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:48:30,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:48:30,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 03:48:30,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 03:48:30,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:48:30,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-21 03:48:30,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:48:31,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 03:48:31,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-21 03:48:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:48:31,110 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 03:48:31,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632227101] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:48:31,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 03:48:31,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 21 [2023-12-21 03:48:31,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719509096] [2023-12-21 03:48:31,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:48:31,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 03:48:31,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:31,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 03:48:31,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2023-12-21 03:48:31,113 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:48:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:31,225 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2023-12-21 03:48:31,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 03:48:31,226 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-12-21 03:48:31,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:31,226 INFO L225 Difference]: With dead ends: 37 [2023-12-21 03:48:31,226 INFO L226 Difference]: Without dead ends: 34 [2023-12-21 03:48:31,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2023-12-21 03:48:31,227 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:31,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 81 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:48:31,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-21 03:48:31,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2023-12-21 03:48:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:48:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-12-21 03:48:31,232 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 25 [2023-12-21 03:48:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:31,232 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-12-21 03:48:31,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:48:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-12-21 03:48:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 03:48:31,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:31,233 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:48:31,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 03:48:31,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-21 03:48:31,438 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:31,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:31,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1298852207, now seen corresponding path program 1 times [2023-12-21 03:48:31,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:31,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929950697] [2023-12-21 03:48:31,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:31,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:31,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:48:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:31,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:48:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:48:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 03:48:31,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:31,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929950697] [2023-12-21 03:48:31,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929950697] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:48:31,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:48:31,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 03:48:31,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425320341] [2023-12-21 03:48:31,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:48:31,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 03:48:31,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:31,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 03:48:31,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-12-21 03:48:31,752 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:48:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:31,886 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-12-21 03:48:31,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 03:48:31,886 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-12-21 03:48:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:31,887 INFO L225 Difference]: With dead ends: 34 [2023-12-21 03:48:31,887 INFO L226 Difference]: Without dead ends: 32 [2023-12-21 03:48:31,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-12-21 03:48:31,887 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:31,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 85 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 03:48:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-21 03:48:31,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2023-12-21 03:48:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:48:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-21 03:48:31,891 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 25 [2023-12-21 03:48:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:31,891 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-21 03:48:31,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:48:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-21 03:48:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 03:48:31,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:31,892 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:48:31,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 03:48:31,892 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:31,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:31,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1638479424, now seen corresponding path program 1 times [2023-12-21 03:48:31,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:31,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760782754] [2023-12-21 03:48:31,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:31,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:32,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:48:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:32,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:48:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:32,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:48:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 03:48:32,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:32,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760782754] [2023-12-21 03:48:32,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760782754] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:48:32,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234657464] [2023-12-21 03:48:32,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:32,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:32,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:48:32,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:48:32,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 03:48:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:32,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 03:48:32,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:48:32,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-21 03:48:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 03:48:32,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:48:32,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-21 03:48:32,413 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 03:48:32,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234657464] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:48:32,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:48:32,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2023-12-21 03:48:32,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440109301] [2023-12-21 03:48:32,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:48:32,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 03:48:32,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:32,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 03:48:32,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-12-21 03:48:32,415 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-21 03:48:36,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:48:40,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:48:44,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:48:48,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:48:52,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:48:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:48:52,641 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2023-12-21 03:48:52,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 03:48:52,641 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 27 [2023-12-21 03:48:52,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:48:52,642 INFO L225 Difference]: With dead ends: 35 [2023-12-21 03:48:52,642 INFO L226 Difference]: Without dead ends: 27 [2023-12-21 03:48:52,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2023-12-21 03:48:52,642 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 41 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:48:52,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 188 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2023-12-21 03:48:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-21 03:48:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-21 03:48:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:48:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-12-21 03:48:52,648 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 27 [2023-12-21 03:48:52,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:48:52,648 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-12-21 03:48:52,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-21 03:48:52,649 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-12-21 03:48:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 03:48:52,649 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:48:52,649 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:48:52,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-21 03:48:52,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:52,856 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:48:52,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:48:52,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1736900497, now seen corresponding path program 1 times [2023-12-21 03:48:52,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:48:52,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339565532] [2023-12-21 03:48:52,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:52,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:48:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:53,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:48:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:53,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:48:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:53,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:48:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:48:53,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:48:53,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339565532] [2023-12-21 03:48:53,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339565532] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:48:53,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141271564] [2023-12-21 03:48:53,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:48:53,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:48:53,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:48:53,122 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:48:53,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 03:48:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:48:53,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-21 03:48:53,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:48:53,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-21 03:48:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:48:53,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:48:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-21 03:48:53,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141271564] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:48:53,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:48:53,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 16 [2023-12-21 03:48:53,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991601764] [2023-12-21 03:48:53,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:48:53,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 03:48:53,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:48:53,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 03:48:53,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2023-12-21 03:48:53,395 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-21 03:48:57,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:01,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:05,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:09,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:13,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:13,653 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-12-21 03:49:13,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 03:49:13,654 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2023-12-21 03:49:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:13,654 INFO L225 Difference]: With dead ends: 34 [2023-12-21 03:49:13,654 INFO L226 Difference]: Without dead ends: 31 [2023-12-21 03:49:13,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2023-12-21 03:49:13,655 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:13,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 202 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2023-12-21 03:49:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-21 03:49:13,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-12-21 03:49:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:49:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-12-21 03:49:13,661 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 28 [2023-12-21 03:49:13,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:13,662 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-12-21 03:49:13,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-21 03:49:13,662 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-12-21 03:49:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 03:49:13,663 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:13,664 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:13,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-21 03:49:13,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:13,864 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:13,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1736898823, now seen corresponding path program 1 times [2023-12-21 03:49:13,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:13,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153789983] [2023-12-21 03:49:13,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:13,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:14,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:14,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:49:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:14,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:49:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 03:49:14,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:14,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153789983] [2023-12-21 03:49:14,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153789983] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:14,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880206648] [2023-12-21 03:49:14,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:14,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:14,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:49:14,539 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:49:14,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-21 03:49:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:14,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 75 conjunts are in the unsatisfiable core [2023-12-21 03:49:14,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:49:14,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:49:14,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:49:14,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-21 03:49:14,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-21 03:49:14,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-21 03:49:14,996 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |node_create_~temp~0#1.base| (select |c_#memory_int#1| |node_create_~temp~0#1.base|)))))) is different from true [2023-12-21 03:49:15,020 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-21 03:49:15,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-21 03:49:15,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-21 03:49:15,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:49:15,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-21 03:49:15,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-21 03:49:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-12-21 03:49:15,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:49:15,263 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (v_ArrVal_857 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_857) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_857 (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_857 .cse0))))))) is different from false [2023-12-21 03:49:15,291 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_20| Int)) (or (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (v_ArrVal_857 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_857) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_857 (let ((.cse0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_20| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_857 .cse0))))))) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_20| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) is different from false [2023-12-21 03:49:15,305 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (v_ArrVal_857 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_20| Int)) (or (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_20| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_857) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_857 (let ((.cse0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_20| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_857 .cse0))))))) is different from false [2023-12-21 03:49:15,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880206648] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:15,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:49:15,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2023-12-21 03:49:15,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034859430] [2023-12-21 03:49:15,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:49:15,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 03:49:15,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:15,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 03:49:15,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=680, Unknown=4, NotChecked=220, Total=992 [2023-12-21 03:49:15,376 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 03:49:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:15,781 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-12-21 03:49:15,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 03:49:15,782 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-12-21 03:49:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:15,782 INFO L225 Difference]: With dead ends: 41 [2023-12-21 03:49:15,782 INFO L226 Difference]: Without dead ends: 39 [2023-12-21 03:49:15,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=1267, Unknown=4, NotChecked=300, Total=1722 [2023-12-21 03:49:15,784 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:15,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 124 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 323 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2023-12-21 03:49:15,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-21 03:49:15,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2023-12-21 03:49:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:49:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2023-12-21 03:49:15,788 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2023-12-21 03:49:15,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:15,788 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2023-12-21 03:49:15,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-21 03:49:15,789 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2023-12-21 03:49:15,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-21 03:49:15,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:15,789 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:15,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-21 03:49:15,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:15,996 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:15,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:15,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1582542026, now seen corresponding path program 1 times [2023-12-21 03:49:15,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:15,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009482129] [2023-12-21 03:49:15,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:15,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:16,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:16,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:49:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:16,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:49:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 03:49:16,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:16,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009482129] [2023-12-21 03:49:16,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009482129] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:16,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586928239] [2023-12-21 03:49:16,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:16,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:16,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:49:16,581 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:49:16,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-21 03:49:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:16,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-21 03:49:16,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:49:16,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:49:16,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-21 03:49:16,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2023-12-21 03:49:16,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-21 03:49:16,854 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) is different from true [2023-12-21 03:49:16,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:49:16,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-12-21 03:49:16,867 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-21 03:49:16,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-21 03:49:16,951 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2023-12-21 03:49:16,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 42 [2023-12-21 03:49:16,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2023-12-21 03:49:16,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2023-12-21 03:49:16,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-12-21 03:49:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-21 03:49:17,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:49:17,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586928239] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:17,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:49:17,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 30 [2023-12-21 03:49:17,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615402150] [2023-12-21 03:49:17,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:49:17,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-21 03:49:17,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:17,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-21 03:49:17,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=905, Unknown=3, NotChecked=60, Total=1056 [2023-12-21 03:49:17,169 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 30 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 25 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-21 03:49:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:17,500 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2023-12-21 03:49:17,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-21 03:49:17,500 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 25 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 30 [2023-12-21 03:49:17,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:17,502 INFO L225 Difference]: With dead ends: 47 [2023-12-21 03:49:17,502 INFO L226 Difference]: Without dead ends: 38 [2023-12-21 03:49:17,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=1650, Unknown=3, NotChecked=82, Total=1892 [2023-12-21 03:49:17,503 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:17,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 279 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2023-12-21 03:49:17,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-21 03:49:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-12-21 03:49:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:49:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-12-21 03:49:17,507 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 30 [2023-12-21 03:49:17,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:17,507 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-12-21 03:49:17,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 25 states have internal predecessors, (41), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-21 03:49:17,508 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-12-21 03:49:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-21 03:49:17,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:17,511 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:17,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-21 03:49:17,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:17,718 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:17,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1135989524, now seen corresponding path program 1 times [2023-12-21 03:49:17,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:17,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859517073] [2023-12-21 03:49:17,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:17,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:18,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:18,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:49:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:18,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:49:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:49:18,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:18,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859517073] [2023-12-21 03:49:18,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859517073] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:18,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494056095] [2023-12-21 03:49:18,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:18,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:18,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:49:18,626 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:49:18,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-21 03:49:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:18,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 105 conjunts are in the unsatisfiable core [2023-12-21 03:49:18,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:49:18,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:49:19,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:49:19,076 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:49:19,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-21 03:49:19,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-21 03:49:19,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 03:49:19,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-21 03:49:19,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-21 03:49:19,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 03:49:19,316 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |node_create_~temp~0#1.base| (select |c_#memory_int#1| |node_create_~temp~0#1.base|)))))) is different from true [2023-12-21 03:49:19,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:49:19,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-12-21 03:49:19,347 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-21 03:49:19,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-21 03:49:19,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-21 03:49:19,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-12-21 03:49:19,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-21 03:49:19,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-21 03:49:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-21 03:49:19,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:49:19,688 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1176) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-21 03:49:19,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494056095] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:19,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:49:19,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2023-12-21 03:49:19,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782504175] [2023-12-21 03:49:19,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:49:19,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-21 03:49:19,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:19,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-21 03:49:19,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1483, Unknown=27, NotChecked=158, Total=1806 [2023-12-21 03:49:19,889 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 39 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:49:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:20,576 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2023-12-21 03:49:20,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 03:49:20,577 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 30 [2023-12-21 03:49:20,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:20,577 INFO L225 Difference]: With dead ends: 48 [2023-12-21 03:49:20,577 INFO L226 Difference]: Without dead ends: 46 [2023-12-21 03:49:20,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=251, Invalid=2486, Unknown=27, NotChecked=206, Total=2970 [2023-12-21 03:49:20,578 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:20,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 206 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 543 Invalid, 0 Unknown, 48 Unchecked, 0.3s Time] [2023-12-21 03:49:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-21 03:49:20,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2023-12-21 03:49:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:49:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-12-21 03:49:20,584 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 30 [2023-12-21 03:49:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:20,584 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-12-21 03:49:20,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:49:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-12-21 03:49:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 03:49:20,585 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:20,585 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:20,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-21 03:49:20,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:20,791 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:20,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:20,792 INFO L85 PathProgramCache]: Analyzing trace with hash 764273839, now seen corresponding path program 1 times [2023-12-21 03:49:20,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:20,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154831529] [2023-12-21 03:49:20,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:20,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:22,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:22,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:49:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:22,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:49:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:49:22,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:22,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154831529] [2023-12-21 03:49:22,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154831529] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:22,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800032725] [2023-12-21 03:49:22,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:22,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:22,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:49:22,741 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:49:22,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-21 03:49:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:22,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 142 conjunts are in the unsatisfiable core [2023-12-21 03:49:22,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:49:22,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:49:23,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:49:23,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-21 03:49:23,350 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:49:23,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-21 03:49:23,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-21 03:49:23,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:49:23,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-21 03:49:23,451 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 15 treesize of output 1 [2023-12-21 03:49:23,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2023-12-21 03:49:23,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-21 03:49:23,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 03:49:23,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-21 03:49:23,746 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |node_create_~temp~0#1.base| (select |c_#memory_int#1| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0))) is different from true [2023-12-21 03:49:23,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:49:23,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 42 [2023-12-21 03:49:23,788 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-21 03:49:23,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-21 03:49:23,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-21 03:49:23,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-21 03:49:24,352 INFO L349 Elim1Store]: treesize reduction 45, result has 35.7 percent of original size [2023-12-21 03:49:24,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 47 [2023-12-21 03:49:24,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:49:24,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-21 03:49:24,374 INFO L349 Elim1Store]: treesize reduction 43, result has 20.4 percent of original size [2023-12-21 03:49:24,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2023-12-21 03:49:24,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2023-12-21 03:49:24,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-12-21 03:49:24,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-21 03:49:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-21 03:49:24,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:49:24,751 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 Int) (v_ArrVal_1347 (Array Int Int)) (|ULTIMATE.start_sll_append_~new_last~0#1.offset| Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1347) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_1350)) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 |ULTIMATE.start_sll_append_~new_last~0#1.offset|)) .cse1) .cse2)))) (not (= v_ArrVal_1347 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1347 .cse0))))))) is different from false [2023-12-21 03:49:25,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800032725] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:25,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:49:25,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2023-12-21 03:49:25,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778210273] [2023-12-21 03:49:25,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:49:25,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-21 03:49:25,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:25,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-21 03:49:25,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3006, Unknown=2, NotChecked=222, Total=3422 [2023-12-21 03:49:25,582 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 51 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:49:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:49:27,440 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2023-12-21 03:49:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-21 03:49:27,441 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2023-12-21 03:49:27,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:49:27,441 INFO L225 Difference]: With dead ends: 49 [2023-12-21 03:49:27,441 INFO L226 Difference]: Without dead ends: 47 [2023-12-21 03:49:27,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=450, Invalid=5718, Unknown=2, NotChecked=310, Total=6480 [2023-12-21 03:49:27,443 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 03:49:27,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 270 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 866 Invalid, 0 Unknown, 50 Unchecked, 0.6s Time] [2023-12-21 03:49:27,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-21 03:49:27,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2023-12-21 03:49:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 03:49:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2023-12-21 03:49:27,453 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 32 [2023-12-21 03:49:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:49:27,453 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2023-12-21 03:49:27,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 1.186046511627907) internal successors, (51), 42 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:49:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2023-12-21 03:49:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 03:49:27,454 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:49:27,454 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:49:27,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-21 03:49:27,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-21 03:49:27,655 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:49:27,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:49:27,656 INFO L85 PathProgramCache]: Analyzing trace with hash 317719663, now seen corresponding path program 2 times [2023-12-21 03:49:27,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:49:27,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358842152] [2023-12-21 03:49:27,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:49:27,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:49:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:28,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:49:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:28,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:49:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:28,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:49:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:49:29,085 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:49:29,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:49:29,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358842152] [2023-12-21 03:49:29,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358842152] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:29,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835921235] [2023-12-21 03:49:29,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:49:29,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:49:29,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:49:29,086 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:49:29,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-21 03:49:29,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:49:29,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:49:29,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 136 conjunts are in the unsatisfiable core [2023-12-21 03:49:29,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:49:29,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:49:29,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:49:29,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:49:29,533 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:49:29,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-21 03:49:29,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-21 03:49:29,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-21 03:49:29,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:49:29,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-21 03:49:29,771 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-21 03:49:29,771 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 20 [2023-12-21 03:49:29,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-21 03:49:29,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-21 03:49:29,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 03:49:39,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:49:39,780 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-21 03:49:39,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 32 [2023-12-21 03:49:39,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:49:39,808 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-21 03:49:39,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-21 03:49:39,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-21 03:49:39,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-21 03:49:40,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-21 03:49:40,231 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-21 03:49:40,232 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-21 03:49:40,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-21 03:49:40,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:49:40,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2023-12-21 03:49:40,453 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 03:49:40,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 03:49:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:49:40,559 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:49:41,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835921235] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:49:41,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:49:41,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2023-12-21 03:49:41,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089332904] [2023-12-21 03:49:41,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:49:41,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-21 03:49:41,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:49:41,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-21 03:49:41,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2002, Unknown=2, NotChecked=0, Total=2162 [2023-12-21 03:49:41,031 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 43 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 34 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:49:45,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:49,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:54,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:49:58,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:02,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:06,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:10,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:14,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:18,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:22,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:26,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:30,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:34,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 03:50:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:50:35,392 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2023-12-21 03:50:35,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 03:50:35,393 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 34 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2023-12-21 03:50:35,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:50:35,393 INFO L225 Difference]: With dead ends: 79 [2023-12-21 03:50:35,393 INFO L226 Difference]: Without dead ends: 77 [2023-12-21 03:50:35,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=287, Invalid=3251, Unknown=2, NotChecked=0, Total=3540 [2023-12-21 03:50:35,395 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 14 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.5s IncrementalHoareTripleChecker+Time [2023-12-21 03:50:35,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 267 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 726 Invalid, 14 Unknown, 0 Unchecked, 53.5s Time] [2023-12-21 03:50:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-21 03:50:35,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2023-12-21 03:50:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 03:50:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2023-12-21 03:50:35,404 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 32 [2023-12-21 03:50:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:50:35,404 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2023-12-21 03:50:35,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 34 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:50:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2023-12-21 03:50:35,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 03:50:35,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:50:35,405 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:50:35,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-21 03:50:35,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:35,611 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:50:35,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:50:35,611 INFO L85 PathProgramCache]: Analyzing trace with hash 27784448, now seen corresponding path program 1 times [2023-12-21 03:50:35,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:50:35,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130739446] [2023-12-21 03:50:35,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:50:35,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:50:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:37,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:50:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:37,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:50:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:37,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:50:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:50:37,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:50:37,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130739446] [2023-12-21 03:50:37,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130739446] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:50:37,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723272719] [2023-12-21 03:50:37,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:50:37,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:37,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:50:37,687 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:50:37,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-21 03:50:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:37,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 128 conjunts are in the unsatisfiable core [2023-12-21 03:50:37,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:50:38,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:50:38,266 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:50:38,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-21 03:50:38,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:50:38,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 03:50:38,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-12-21 03:50:38,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-12-21 03:50:38,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 03:50:38,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:50:38,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-12-21 03:50:38,883 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-21 03:50:38,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-21 03:50:38,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-12-21 03:50:39,594 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-21 03:50:39,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 70 [2023-12-21 03:50:39,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:50:39,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-12-21 03:50:39,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 51 [2023-12-21 03:50:39,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-21 03:50:40,067 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-21 03:50:40,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2023-12-21 03:50:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 03:50:40,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:50:40,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723272719] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:50:40,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 03:50:40,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 47 [2023-12-21 03:50:40,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052518506] [2023-12-21 03:50:40,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 03:50:40,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-21 03:50:40,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:50:40,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-21 03:50:40,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2801, Unknown=6, NotChecked=0, Total=2970 [2023-12-21 03:50:40,969 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 47 states, 40 states have (on average 1.275) internal successors, (51), 38 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:50:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:50:43,526 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2023-12-21 03:50:43,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-21 03:50:43,527 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 40 states have (on average 1.275) internal successors, (51), 38 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-12-21 03:50:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:50:43,528 INFO L225 Difference]: With dead ends: 72 [2023-12-21 03:50:43,528 INFO L226 Difference]: Without dead ends: 69 [2023-12-21 03:50:43,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=382, Invalid=5162, Unknown=6, NotChecked=0, Total=5550 [2023-12-21 03:50:43,531 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 87 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:50:43,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 326 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-21 03:50:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-21 03:50:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2023-12-21 03:50:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 03:50:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2023-12-21 03:50:43,549 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 34 [2023-12-21 03:50:43,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:50:43,550 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2023-12-21 03:50:43,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 40 states have (on average 1.275) internal successors, (51), 38 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 03:50:43,550 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2023-12-21 03:50:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 03:50:43,552 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:50:43,552 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:50:43,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-21 03:50:43,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-21 03:50:43,760 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:50:43,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:50:43,761 INFO L85 PathProgramCache]: Analyzing trace with hash 27786122, now seen corresponding path program 2 times [2023-12-21 03:50:43,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:50:43,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320194575] [2023-12-21 03:50:43,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:50:43,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:50:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:45,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 03:50:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:45,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 03:50:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:45,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-21 03:50:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:50:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 03:50:45,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:50:45,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320194575] [2023-12-21 03:50:45,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320194575] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:50:45,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647711507] [2023-12-21 03:50:45,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:50:45,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:50:45,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:50:45,625 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:50:45,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-21 03:50:45,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:50:45,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:50:45,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 147 conjunts are in the unsatisfiable core [2023-12-21 03:50:45,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:50:45,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-21 03:50:46,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:50:46,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:50:46,401 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-21 03:50:46,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-21 03:50:46,429 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-21 03:50:46,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-21 03:50:46,461 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-21 03:50:46,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-21 03:50:46,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-12-21 03:50:46,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-12-21 03:50:46,837 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-12-21 03:50:46,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 31 [2023-12-21 03:50:46,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-12-21 03:50:46,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 03:50:46,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 03:50:47,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 03:50:47,068 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-21 03:50:47,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 87 [2023-12-21 03:50:47,092 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-12-21 03:50:47,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2023-12-21 03:50:47,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2023-12-21 03:50:47,816 INFO L349 Elim1Store]: treesize reduction 130, result has 20.2 percent of original size [2023-12-21 03:50:47,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 71 [2023-12-21 03:50:47,855 INFO L349 Elim1Store]: treesize reduction 116, result has 25.2 percent of original size [2023-12-21 03:50:47,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 54 [2023-12-21 03:50:47,881 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2023-12-21 03:50:47,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2023-12-21 03:50:48,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 290 [2023-12-21 03:50:48,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 242 [2023-12-21 03:50:49,890 INFO L349 Elim1Store]: treesize reduction 60, result has 85.3 percent of original size [2023-12-21 03:50:49,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 368 treesize of output 523 [2023-12-21 03:50:50,576 INFO L349 Elim1Store]: treesize reduction 60, result has 85.3 percent of original size [2023-12-21 03:50:50,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 170 treesize of output 472 [2023-12-21 03:52:54,906 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-21 03:52:54,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2023-12-21 03:52:54,914 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-21 03:52:54,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-21 03:52:55,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-21 03:52:55,120 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2023-12-21 03:52:55,139 INFO L158 Benchmark]: Toolchain (without parser) took 267041.91ms. Allocated memory was 211.8MB in the beginning and 1.1GB in the end (delta: 851.4MB). Free memory was 146.1MB in the beginning and 929.6MB in the end (delta: -783.5MB). Peak memory consumption was 627.2MB. Max. memory is 8.0GB. [2023-12-21 03:52:55,139 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 211.8MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:52:55,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.05ms. Allocated memory was 211.8MB in the beginning and 280.0MB in the end (delta: 68.2MB). Free memory was 145.9MB in the beginning and 240.4MB in the end (delta: -94.5MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. [2023-12-21 03:52:55,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.67ms. Allocated memory is still 280.0MB. Free memory was 240.4MB in the beginning and 238.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:52:55,139 INFO L158 Benchmark]: Boogie Preprocessor took 53.90ms. Allocated memory is still 280.0MB. Free memory was 238.3MB in the beginning and 244.8MB in the end (delta: -6.5MB). Peak memory consumption was 5.0MB. Max. memory is 8.0GB. [2023-12-21 03:52:55,139 INFO L158 Benchmark]: RCFGBuilder took 331.67ms. Allocated memory is still 280.0MB. Free memory was 244.8MB in the beginning and 226.9MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-21 03:52:55,139 INFO L158 Benchmark]: TraceAbstraction took 266250.15ms. Allocated memory was 280.0MB in the beginning and 1.1GB in the end (delta: 783.3MB). Free memory was 225.9MB in the beginning and 929.6MB in the end (delta: -703.7MB). Peak memory consumption was 637.2MB. Max. memory is 8.0GB. [2023-12-21 03:52:55,143 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.09ms. Allocated memory is still 211.8MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 370.05ms. Allocated memory was 211.8MB in the beginning and 280.0MB in the end (delta: 68.2MB). Free memory was 145.9MB in the beginning and 240.4MB in the end (delta: -94.5MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.67ms. Allocated memory is still 280.0MB. Free memory was 240.4MB in the beginning and 238.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.90ms. Allocated memory is still 280.0MB. Free memory was 238.3MB in the beginning and 244.8MB in the end (delta: -6.5MB). Peak memory consumption was 5.0MB. Max. memory is 8.0GB. * RCFGBuilder took 331.67ms. Allocated memory is still 280.0MB. Free memory was 244.8MB in the beginning and 226.9MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 266250.15ms. Allocated memory was 280.0MB in the beginning and 1.1GB in the end (delta: 783.3MB). Free memory was 225.9MB in the beginning and 929.6MB in the end (delta: -703.7MB). Peak memory consumption was 637.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...