/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 --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 01:41:23,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 01:41:23,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-26 01:41:23,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 01:41:23,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 01:41:23,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-26 01:41:23,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 01:41:23,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 01:41:23,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 01:41:23,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 01:41:23,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 01:41:23,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 01:41:23,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 01:41:23,228 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 01:41:23,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 01:41:23,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 01:41:23,228 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 01:41:23,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 01:41:23,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 01:41:23,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 01:41:23,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 01:41:23,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 01:41:23,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 01:41:23,230 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 01:41:23,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 01:41:23,230 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 01:41:23,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 01:41:23,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 01:41:23,231 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 01:41:23,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 01:41:23,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 01:41:23,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 01:41:23,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 01:41:23,232 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-26 01:41:23,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-26 01:41:23,233 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 01:41:23,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 01:41:23,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 01:41:23,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 01:41:23,233 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 01:41:23,233 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-26 01:41:23,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-01-26 01:41:23,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 01:41:23,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 01:41:23,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 01:41:23,446 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 01:41:23,447 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 01:41:23,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-01-26 01:41:24,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 01:41:24,615 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 01:41:24,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-01-26 01:41:24,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5b1f32600/acb44b796c1e41fb9923beb2ec88ff2d/FLAGc005bd6c6 [2024-01-26 01:41:24,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5b1f32600/acb44b796c1e41fb9923beb2ec88ff2d [2024-01-26 01:41:24,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 01:41:24,638 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 01:41:24,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 01:41:24,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 01:41:24,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 01:41:24,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 01:41:24" (1/1) ... [2024-01-26 01:41:24,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bfedb1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:24, skipping insertion in model container [2024-01-26 01:41:24,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 01:41:24" (1/1) ... [2024-01-26 01:41:24,664 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 01:41:24,770 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-01-26 01:41:24,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 01:41:24,781 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 01:41:24,798 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-01-26 01:41:24,800 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 01:41:24,810 INFO L206 MainTranslator]: Completed translation [2024-01-26 01:41:24,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:24 WrapperNode [2024-01-26 01:41:24,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 01:41:24,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 01:41:24,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 01:41:24,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 01:41:24,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:24" (1/1) ... [2024-01-26 01:41:24,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:24" (1/1) ... [2024-01-26 01:41:24,842 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 199 [2024-01-26 01:41:24,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 01:41:24,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 01:41:24,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 01:41:24,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 01:41:24,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:24" (1/1) ... [2024-01-26 01:41:24,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:24" (1/1) ... [2024-01-26 01:41:24,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:24" (1/1) ... [2024-01-26 01:41:24,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:24" (1/1) ... [2024-01-26 01:41:24,855 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:24" (1/1) ... [2024-01-26 01:41:24,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:24" (1/1) ... [2024-01-26 01:41:24,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:24" (1/1) ... [2024-01-26 01:41:24,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:24" (1/1) ... [2024-01-26 01:41:24,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 01:41:24,861 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 01:41:24,861 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 01:41:24,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 01:41:24,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:24" (1/1) ... [2024-01-26 01:41:24,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 01:41:24,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:41:24,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-01-26 01:41:24,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-01-26 01:41:24,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 01:41:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 01:41:24,920 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 01:41:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 01:41:24,920 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 01:41:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 01:41:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 01:41:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 01:41:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-26 01:41:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-26 01:41:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 01:41:24,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 01:41:24,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 01:41:24,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 01:41:24,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 01:41:24,922 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 01:41:24,998 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 01:41:24,999 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 01:41:25,244 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 01:41:25,305 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 01:41:25,305 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-26 01:41:25,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 01:41:25 BoogieIcfgContainer [2024-01-26 01:41:25,305 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 01:41:25,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 01:41:25,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 01:41:25,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 01:41:25,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 01:41:24" (1/3) ... [2024-01-26 01:41:25,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4076e631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 01:41:25, skipping insertion in model container [2024-01-26 01:41:25,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 01:41:24" (2/3) ... [2024-01-26 01:41:25,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4076e631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 01:41:25, skipping insertion in model container [2024-01-26 01:41:25,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 01:41:25" (3/3) ... [2024-01-26 01:41:25,310 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2024-01-26 01:41:25,315 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 01:41:25,321 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 01:41:25,321 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 01:41:25,321 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 01:41:25,365 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-26 01:41:25,407 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 01:41:25,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 01:41:25,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:41:25,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-01-26 01:41:25,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-01-26 01:41:25,495 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 01:41:25,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 01:41:25,510 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2dc3a4f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 01:41:25,510 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-26 01:41:25,615 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:41:25,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:41:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2028645295, now seen corresponding path program 1 times [2024-01-26 01:41:25,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:41:25,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012459445] [2024-01-26 01:41:25,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:25,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:41:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-01-26 01:41:25,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:41:25,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012459445] [2024-01-26 01:41:25,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012459445] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 01:41:25,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 01:41:25,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 01:41:25,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208220593] [2024-01-26 01:41:25,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 01:41:25,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 01:41:25,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:41:25,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 01:41:25,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 01:41:25,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:25,865 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:41:25,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.5) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 01:41:25,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:41:25,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:25,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 01:41:25,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:41:25,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:41:25,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2091846404, now seen corresponding path program 1 times [2024-01-26 01:41:25,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:41:25,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007124085] [2024-01-26 01:41:25,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:25,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:41:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-01-26 01:41:26,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:41:26,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007124085] [2024-01-26 01:41:26,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007124085] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 01:41:26,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 01:41:26,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-26 01:41:26,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777791222] [2024-01-26 01:41:26,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 01:41:26,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-26 01:41:26,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:41:26,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-26 01:41:26,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-01-26 01:41:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:26,248 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:41:26,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 01:41:26,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:26,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:41:26,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:26,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:41:26,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 01:41:26,449 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:41:26,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:41:26,450 INFO L85 PathProgramCache]: Analyzing trace with hash 685256109, now seen corresponding path program 1 times [2024-01-26 01:41:26,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:41:26,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719436338] [2024-01-26 01:41:26,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:26,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:41:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-01-26 01:41:26,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:41:26,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719436338] [2024-01-26 01:41:26,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719436338] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:41:26,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338449439] [2024-01-26 01:41:26,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:26,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:41:26,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:41:26,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 01:41:26,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-26 01:41:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:27,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-26 01:41:27,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:41:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-01-26 01:41:27,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:41:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-01-26 01:41:27,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338449439] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:41:27,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:41:27,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2024-01-26 01:41:27,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941099048] [2024-01-26 01:41:27,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:41:27,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-01-26 01:41:27,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:41:27,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-01-26 01:41:27,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2024-01-26 01:41:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:27,649 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:41:27,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 15.708333333333334) internal successors, (377), 24 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 01:41:27,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:27,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:41:27,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:41:27,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:41:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-26 01:41:27,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-26 01:41:28,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-01-26 01:41:28,141 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:41:28,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:41:28,141 INFO L85 PathProgramCache]: Analyzing trace with hash -235209615, now seen corresponding path program 2 times [2024-01-26 01:41:28,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:41:28,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858432274] [2024-01-26 01:41:28,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:28,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:41:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-01-26 01:41:28,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:41:28,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858432274] [2024-01-26 01:41:28,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858432274] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:41:28,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695751029] [2024-01-26 01:41:28,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 01:41:28,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:41:28,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:41:28,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 01:41:28,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-26 01:41:28,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 01:41:28,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 01:41:28,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-26 01:41:28,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:41:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-01-26 01:41:28,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:41:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-01-26 01:41:28,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695751029] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 01:41:28,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 01:41:28,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2024-01-26 01:41:28,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519374354] [2024-01-26 01:41:28,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 01:41:28,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-01-26 01:41:28,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 01:41:28,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-01-26 01:41:28,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-01-26 01:41:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:28,836 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 01:41:28,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 28.8) internal successors, (432), 15 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-26 01:41:28,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:28,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:41:28,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-01-26 01:41:28,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 01:41:29,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 01:41:29,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 01:41:29,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-26 01:41:29,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-01-26 01:41:29,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-26 01:41:29,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:41:29,284 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 01:41:29,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 01:41:29,284 INFO L85 PathProgramCache]: Analyzing trace with hash 897558208, now seen corresponding path program 3 times [2024-01-26 01:41:29,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 01:41:29,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268220836] [2024-01-26 01:41:29,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 01:41:29,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 01:41:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 01:41:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-01-26 01:41:29,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 01:41:29,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268220836] [2024-01-26 01:41:29,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268220836] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 01:41:29,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082204890] [2024-01-26 01:41:29,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 01:41:29,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:41:29,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 01:41:29,564 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-26 01:41:29,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-26 01:41:29,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-26 01:41:29,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 01:41:29,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 77 conjunts are in the unsatisfiable core [2024-01-26 01:41:29,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 01:41:30,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 01:41:30,880 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 16 treesize of output 11 [2024-01-26 01:41:30,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-26 01:41:30,952 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 16 treesize of output 11 [2024-01-26 01:41:32,880 INFO L349 Elim1Store]: treesize reduction 32, result has 93.6 percent of original size [2024-01-26 01:41:32,880 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 177 treesize of output 523 [2024-01-26 01:41:35,486 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:41:47,485 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:41:47,669 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:41:47,766 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:41:54,839 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:41:54,911 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:04,148 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:04,213 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:04,285 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:04,301 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:04,323 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:04,348 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:04,419 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:04,739 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:05,218 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:05,432 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:05,506 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:05,522 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:05,544 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:05,567 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:05,665 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:05,838 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:06,229 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:06,992 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:07,013 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:07,034 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:07,072 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:07,106 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:07,128 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:07,149 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:07,170 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:07,226 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:07,249 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-01-26 01:42:07,314 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:07,335 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:07,395 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:07,415 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:07,433 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:07,454 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:07,490 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:07,517 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-01-26 01:42:07,639 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:07,660 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:07,775 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:07,800 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:07,815 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:07,868 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:07,949 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:08,059 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:08,082 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:08,101 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:08,169 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:08,251 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:08,266 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:08,270 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:08,274 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:08,324 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:08,489 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:08,661 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:08,705 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:08,722 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:08,767 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:08,805 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:08,873 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:08,890 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:08,909 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:08,950 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:09,157 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:09,284 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:09,393 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:09,437 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:09,556 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:09,568 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:09,574 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:09,589 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:09,613 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:09,627 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-26 01:42:09,634 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:09,638 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:09,657 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:10,149 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:17,389 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:17,908 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:19,740 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:20,743 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:24,168 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:24,633 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:26,459 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:28,105 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:28,193 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:29,240 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:29,485 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:32,173 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:33,424 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:34,048 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:34,650 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-26 01:42:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-01-26 01:42:35,559 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 01:42:37,813 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (* c_~N~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse15 (- 4))) (.cse7 (+ c_~A~0.offset .cse15 (- 8)))) (and (or (forall ((v_ArrVal_139 (Array Int Int)) (~end~0 Int) (v_ArrVal_140 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_140))) (let ((.cse4 (select .cse6 c_~A~0.base))) (let ((.cse1 (select .cse4 .cse7)) (.cse2 (select .cse6 ~queue~0.base)) (.cse3 (* ~end~0 4)) (.cse0 (select .cse4 .cse5))) (or (< .cse0 .cse1) (< (+ ~end~0 1) 0) (not (= (select .cse2 (+ ~queue~0.offset .cse3)) .cse1)) (not (= (select .cse2 (+ ~queue~0.offset .cse3 4)) .cse0))))))) (not (= (mod c_~ok~0 256) 0))) (forall ((v_ArrVal_139 (Array Int Int)) (v_ArrVal_140 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_140))) (let ((.cse14 (select .cse13 c_~A~0.base))) (let ((.cse9 (select .cse14 .cse7)) (.cse8 (select .cse14 .cse5))) (or (< .cse8 .cse9) (forall ((~end~0 Int)) (or (forall ((~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse11 (select .cse13 ~queue~0.base)) (.cse12 (* ~end~0 4))) (let ((.cse10 (select .cse11 (+ ~queue~0.offset .cse12)))) (or (< c_~v_old~0 (+ .cse10 1)) (not (= .cse10 .cse9)) (not (= (select .cse11 (+ ~queue~0.offset .cse12 4)) .cse8)))))) (< (+ ~end~0 1) 0))))))))))) is different from false [2024-01-26 01:42:37,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (* c_~N~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse15 (- 4))) (.cse7 (+ c_~A~0.offset .cse15 (- 8)))) (and (or (forall ((v_ArrVal_139 (Array Int Int)) (~end~0 Int) (v_ArrVal_140 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_140))) (let ((.cse4 (select .cse6 c_~A~0.base))) (let ((.cse1 (select .cse4 .cse7)) (.cse2 (select .cse6 ~queue~0.base)) (.cse3 (* ~end~0 4)) (.cse0 (select .cse4 .cse5))) (or (< .cse0 .cse1) (< (+ ~end~0 1) 0) (not (= (select .cse2 (+ ~queue~0.offset .cse3)) .cse1)) (not (= (select .cse2 (+ ~queue~0.offset .cse3 4)) .cse0))))))) (not (= (mod c_~ok~0 256) 0))) (forall ((v_ArrVal_139 (Array Int Int)) (~end~0 Int) (v_ArrVal_140 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_140))) (let ((.cse13 (select .cse14 c_~A~0.base)) (.cse11 (select .cse14 ~queue~0.base)) (.cse12 (* ~end~0 4))) (let ((.cse8 (select .cse11 (+ ~queue~0.offset .cse12))) (.cse10 (select .cse13 .cse7)) (.cse9 (select .cse13 .cse5))) (or (< |c_ULTIMATE.start_main_#t~mem14#1| (+ .cse8 1)) (< .cse9 .cse10) (< (+ ~end~0 1) 0) (not (= .cse8 .cse10)) (not (= (select .cse11 (+ ~queue~0.offset .cse12 4)) .cse9)))))))))) is different from false [2024-01-26 01:42:38,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:42:38,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 4936 treesize of output 4486 [2024-01-26 01:42:38,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:42:38,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1764 treesize of output 1577 [2024-01-26 01:42:38,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:42:38,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1508 treesize of output 1449 [2024-01-26 01:42:38,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:42:38,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1380 treesize of output 1327 [2024-01-26 01:42:38,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-26 01:42:38,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1258 treesize of output 1083 [2024-01-26 01:44:23,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-01-26 01:44:23,518 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-01-26 01:44:23,519 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-01-26 01:44:23,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-01-26 01:44:23,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 01:44:23,725 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/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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.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.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.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.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.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.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) 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) ... 76 more [2024-01-26 01:44:23,728 INFO L158 Benchmark]: Toolchain (without parser) took 179090.30ms. Allocated memory was 181.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 138.1MB in the beginning and 516.9MB in the end (delta: -378.7MB). Peak memory consumption was 848.5MB. Max. memory is 8.0GB. [2024-01-26 01:44:23,728 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 01:44:23,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.29ms. Allocated memory is still 181.4MB. Free memory was 138.1MB in the beginning and 125.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-01-26 01:44:23,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.51ms. Allocated memory is still 181.4MB. Free memory was 125.6MB in the beginning and 123.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 01:44:23,729 INFO L158 Benchmark]: Boogie Preprocessor took 17.87ms. Allocated memory is still 181.4MB. Free memory was 123.5MB in the beginning and 121.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 01:44:23,729 INFO L158 Benchmark]: RCFGBuilder took 444.11ms. Allocated memory is still 181.4MB. Free memory was 121.7MB in the beginning and 95.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2024-01-26 01:44:23,730 INFO L158 Benchmark]: TraceAbstraction took 178420.96ms. Allocated memory was 181.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 94.8MB in the beginning and 516.9MB in the end (delta: -422.1MB). Peak memory consumption was 805.5MB. Max. memory is 8.0GB. [2024-01-26 01:44:23,731 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.10ms. Allocated memory is still 181.4MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.29ms. Allocated memory is still 181.4MB. Free memory was 138.1MB in the beginning and 125.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.51ms. Allocated memory is still 181.4MB. Free memory was 125.6MB in the beginning and 123.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.87ms. Allocated memory is still 181.4MB. Free memory was 123.5MB in the beginning and 121.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 444.11ms. Allocated memory is still 181.4MB. Free memory was 121.7MB in the beginning and 95.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 178420.96ms. Allocated memory was 181.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 94.8MB in the beginning and 516.9MB in the end (delta: -422.1MB). Peak memory consumption was 805.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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. [2024-01-26 01:44:23,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...