/usr/bin/java -Xmx7000000000 -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/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONLY_ONE_CEGAR --traceabstraction.number.of.independence.relations.to.use.for.por 2 --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL '--traceabstraction.abstraction.used.for.commutativity.in.por.#2' NONE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-08 13:30:45,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-08 13:30:45,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-09-08 13:30:45,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-08 13:30:45,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-08 13:30:45,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-08 13:30:45,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-08 13:30:45,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-08 13:30:45,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-08 13:30:45,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-08 13:30:45,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-08 13:30:45,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-08 13:30:45,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-08 13:30:45,762 INFO L153 SettingsManager]: * Use SBE=true [2023-09-08 13:30:45,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-08 13:30:45,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-08 13:30:45,763 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-08 13:30:45,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-08 13:30:45,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-08 13:30:45,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-08 13:30:45,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-08 13:30:45,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-08 13:30:45,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-08 13:30:45,765 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-08 13:30:45,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-08 13:30:45,765 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-08 13:30:45,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-08 13:30:45,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-08 13:30:45,766 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-08 13:30:45,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-08 13:30:45,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 13:30:45,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-08 13:30:45,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-08 13:30:45,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-08 13:30:45,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-08 13:30:45,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-08 13:30:45,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-08 13:30:45,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-08 13:30:45,768 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-08 13:30:45,768 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-09-08 13:30:45,768 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/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.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONLY_ONE_CEGAR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Number of independence relations to use for POR -> 2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR #2 -> NONE [2023-09-08 13:30:45,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-08 13:30:45,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-08 13:30:45,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-08 13:30:45,953 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-08 13:30:45,954 INFO L274 PluginConnector]: CDTParser initialized [2023-09-08 13:30:45,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-09-08 13:30:46,881 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-08 13:30:47,114 INFO L384 CDTParser]: Found 1 translation units. [2023-09-08 13:30:47,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-09-08 13:30:47,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a7e8d1c/e3c62a0d7c3045388e3f19f170e8dada/FLAGc594cd405 [2023-09-08 13:30:47,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a7e8d1c/e3c62a0d7c3045388e3f19f170e8dada [2023-09-08 13:30:47,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-08 13:30:47,138 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-08 13:30:47,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-08 13:30:47,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-08 13:30:47,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-08 13:30:47,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:30:47" (1/1) ... [2023-09-08 13:30:47,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8dbf2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:47, skipping insertion in model container [2023-09-08 13:30:47,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:30:47" (1/1) ... [2023-09-08 13:30:47,160 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-08 13:30:47,270 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2023-09-08 13:30:47,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 13:30:47,283 INFO L202 MainTranslator]: Completed pre-run [2023-09-08 13:30:47,303 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2023-09-08 13:30:47,307 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 13:30:47,319 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-08 13:30:47,319 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-08 13:30:47,323 INFO L206 MainTranslator]: Completed translation [2023-09-08 13:30:47,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:47 WrapperNode [2023-09-08 13:30:47,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-08 13:30:47,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-08 13:30:47,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-08 13:30:47,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-08 13:30:47,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:47" (1/1) ... [2023-09-08 13:30:47,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:47" (1/1) ... [2023-09-08 13:30:47,354 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 209 [2023-09-08 13:30:47,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-08 13:30:47,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-08 13:30:47,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-08 13:30:47,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-08 13:30:47,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:47" (1/1) ... [2023-09-08 13:30:47,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:47" (1/1) ... [2023-09-08 13:30:47,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:47" (1/1) ... [2023-09-08 13:30:47,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:47" (1/1) ... [2023-09-08 13:30:47,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:47" (1/1) ... [2023-09-08 13:30:47,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:47" (1/1) ... [2023-09-08 13:30:47,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:47" (1/1) ... [2023-09-08 13:30:47,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:47" (1/1) ... [2023-09-08 13:30:47,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-08 13:30:47,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-08 13:30:47,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-08 13:30:47,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-08 13:30:47,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:47" (1/1) ... [2023-09-08 13:30:47,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-08 13:30:47,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 13:30:47,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-08 13:30:47,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-08 13:30:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-08 13:30:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-08 13:30:47,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-08 13:30:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-08 13:30:47,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-08 13:30:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-08 13:30:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-08 13:30:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-08 13:30:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-08 13:30:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-08 13:30:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-08 13:30:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-08 13:30:47,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-08 13:30:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-08 13:30:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-08 13:30:47,437 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-08 13:30:47,506 INFO L236 CfgBuilder]: Building ICFG [2023-09-08 13:30:47,507 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-08 13:30:47,742 INFO L277 CfgBuilder]: Performing block encoding [2023-09-08 13:30:47,849 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-08 13:30:47,849 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-08 13:30:47,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:30:47 BoogieIcfgContainer [2023-09-08 13:30:47,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-08 13:30:47,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-08 13:30:47,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-08 13:30:47,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-08 13:30:47,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:30:47" (1/3) ... [2023-09-08 13:30:47,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ff2cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:30:47, skipping insertion in model container [2023-09-08 13:30:47,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:30:47" (2/3) ... [2023-09-08 13:30:47,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ff2cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:30:47, skipping insertion in model container [2023-09-08 13:30:47,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:30:47" (3/3) ... [2023-09-08 13:30:47,858 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-09-08 13:30:47,863 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-08 13:30:47,868 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-08 13:30:47,869 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-08 13:30:47,869 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-08 13:30:47,918 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-08 13:30:47,952 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 13:30:47,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-08 13:30:47,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 13:30:47,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-08 13:30:47,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-08 13:30:47,985 INFO L103 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 13:30:47,995 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-09-08 13:30:47,995 WARN L169 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-09-08 13:30:47,995 WARN L170 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-09-08 13:30:48,025 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-08 13:30:48,029 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;@61b003e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-08 13:30:48,029 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-09-08 13:30:48,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 13:30:48,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 13:30:48,335 INFO L85 PathProgramCache]: Analyzing trace with hash 460855810, now seen corresponding path program 1 times [2023-09-08 13:30:48,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 13:30:48,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948856969] [2023-09-08 13:30:48,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 13:30:48,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 13:30:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 13:30:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-08 13:30:48,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 13:30:48,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948856969] [2023-09-08 13:30:48,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948856969] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 13:30:48,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 13:30:48,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-08 13:30:48,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247083126] [2023-09-08 13:30:48,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 13:30:48,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-08 13:30:48,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 13:30:48,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-08 13:30:48,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-08 13:30:48,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:30:48,647 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 13:30:48,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 13:30:48,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:30:48,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:30:48,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-08 13:30:48,714 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 13:30:48,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 13:30:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1724168814, now seen corresponding path program 1 times [2023-09-08 13:30:48,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 13:30:48,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223985496] [2023-09-08 13:30:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 13:30:48,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 13:30:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 13:30:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 13:30:49,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 13:30:49,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223985496] [2023-09-08 13:30:49,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223985496] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 13:30:49,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 13:30:49,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-08 13:30:49,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421804995] [2023-09-08 13:30:49,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 13:30:49,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-08 13:30:49,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 13:30:49,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-08 13:30:49,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-08 13:30:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:30:49,127 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 13:30:49,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 13:30:49,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:30:49,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:30:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:30:49,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-08 13:30:49,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-08 13:30:49,342 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 13:30:49,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 13:30:49,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1338531751, now seen corresponding path program 1 times [2023-09-08 13:30:49,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 13:30:49,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517511877] [2023-09-08 13:30:49,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 13:30:49,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 13:30:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 13:30:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-08 13:30:49,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 13:30:49,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517511877] [2023-09-08 13:30:49,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517511877] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 13:30:49,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 13:30:49,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-08 13:30:49,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869148152] [2023-09-08 13:30:49,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 13:30:49,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-08 13:30:49,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 13:30:49,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-08 13:30:49,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-08 13:30:49,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:30:49,519 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 13:30:49,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 13:30:49,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:30:49,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-08 13:30:49,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:30:49,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:30:49,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-08 13:30:49,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-08 13:30:49,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-08 13:30:49,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 13:30:49,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 13:30:49,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1920191497, now seen corresponding path program 1 times [2023-09-08 13:30:49,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 13:30:49,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346604607] [2023-09-08 13:30:49,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 13:30:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 13:30:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 13:30:53,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 13:30:53,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 13:30:53,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346604607] [2023-09-08 13:30:53,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346604607] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 13:30:53,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979935702] [2023-09-08 13:30:53,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 13:30:53,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 13:30:53,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 13:30:53,089 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-09-08 13:30:53,115 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-09-08 13:30:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 13:30:53,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 92 conjunts are in the unsatisfiable core [2023-09-08 13:30:53,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 13:30:53,314 INFO L351 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-09-08 13:30:54,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 13:30:54,016 INFO L351 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 0 case distinctions, treesize of input 17 treesize of output 17 [2023-09-08 13:30:54,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-09-08 13:30:55,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 13:30:55,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 13:30:55,298 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-09-08 13:30:55,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-09-08 13:30:55,654 INFO L351 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 11 [2023-09-08 13:30:56,317 INFO L351 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 6 treesize of output 5 [2023-09-08 13:30:56,463 INFO L351 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 6 treesize of output 5 [2023-09-08 13:30:57,092 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2023-09-08 13:30:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 13:30:57,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 13:31:09,350 INFO L322 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-09-08 13:31:09,351 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 115 [2023-09-08 13:31:09,456 INFO L322 Elim1Store]: treesize reduction 5, result has 96.6 percent of original size [2023-09-08 13:31:09,456 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 645 treesize of output 714 [2023-09-08 13:31:09,501 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 13:31:09,522 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 13:31:09,522 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 187 treesize of output 235 [2023-09-08 13:31:09,544 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 13:31:09,565 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 13:31:09,565 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 185 treesize of output 209 [2023-09-08 13:31:17,666 INFO L322 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-09-08 13:31:17,667 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 115 [2023-09-08 13:31:17,751 INFO L322 Elim1Store]: treesize reduction 4, result has 97.3 percent of original size [2023-09-08 13:31:17,751 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 317 treesize of output 419 [2023-09-08 13:31:17,798 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 13:31:17,799 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 197 treesize of output 253 [2023-09-08 13:31:17,857 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 13:31:17,857 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 231 treesize of output 263 [2023-09-08 13:31:51,903 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 13:31:51,905 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 13:31:51,908 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-09-08 13:31:51,909 INFO L351 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 16 treesize of output 12 [2023-09-08 13:31:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 13:31:52,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979935702] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 13:31:52,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 13:31:52,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 45, 45] total 121 [2023-09-08 13:31:52,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333207473] [2023-09-08 13:31:52,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 13:31:52,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2023-09-08 13:31:52,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 13:31:52,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2023-09-08 13:31:52,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1643, Invalid=12811, Unknown=66, NotChecked=0, Total=14520 [2023-09-08 13:31:52,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:31:52,013 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 13:31:52,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 3.322314049586777) internal successors, (402), 121 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 13:31:52,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:31:52,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-08 13:31:52,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-08 13:31:52,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:33:05,257 WARN L234 SmtUtils]: Spent 1.20m on a formula simplification. DAG size of input: 433 DAG size of output: 428 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:34:10,775 WARN L234 SmtUtils]: Spent 1.03m on a formula simplification. DAG size of input: 422 DAG size of output: 417 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:34:14,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 13:34:33,607 WARN L234 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 207 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:35:06,514 WARN L234 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 337 DAG size of output: 247 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:35:22,483 WARN L234 SmtUtils]: Spent 7.85s on a formula simplification. DAG size of input: 345 DAG size of output: 242 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:35:26,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 13:35:49,464 WARN L234 SmtUtils]: Spent 5.99s on a formula simplification. DAG size of input: 264 DAG size of output: 203 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:36:04,124 WARN L234 SmtUtils]: Spent 7.82s on a formula simplification. DAG size of input: 262 DAG size of output: 201 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:36:44,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:44,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-08 13:36:44,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-08 13:36:44,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2023-09-08 13:36:44,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-08 13:36:44,574 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-09-08 13:36:44,575 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 13:36:44,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 13:36:44,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1514920154, now seen corresponding path program 2 times [2023-09-08 13:36:44,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 13:36:44,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107765894] [2023-09-08 13:36:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 13:36:44,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 13:36:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 13:36:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-09-08 13:36:44,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 13:36:44,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107765894] [2023-09-08 13:36:44,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107765894] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 13:36:44,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292771414] [2023-09-08 13:36:44,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-08 13:36:44,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 13:36:44,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 13:36:44,836 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-09-08 13:36:44,843 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-09-08 13:36:44,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-08 13:36:44,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 13:36:44,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 9 conjunts are in the unsatisfiable core [2023-09-08 13:36:44,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 13:36:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-09-08 13:36:45,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 13:36:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-09-08 13:36:45,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292771414] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 13:36:45,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 13:36:45,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-09-08 13:36:45,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227559325] [2023-09-08 13:36:45,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 13:36:45,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-09-08 13:36:45,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 13:36:45,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-09-08 13:36:45,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-09-08 13:36:45,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:45,387 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 13:36:45,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.947368421052632) internal successors, (208), 19 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 13:36:45,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:45,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-08 13:36:45,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-08 13:36:45,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2023-09-08 13:36:45,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:45,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:45,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-08 13:36:45,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-08 13:36:45,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2023-09-08 13:36:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-08 13:36:45,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-08 13:36:46,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 13:36:46,117 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 13:36:46,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 13:36:46,118 INFO L85 PathProgramCache]: Analyzing trace with hash -107804042, now seen corresponding path program 3 times [2023-09-08 13:36:46,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 13:36:46,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250081417] [2023-09-08 13:36:46,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 13:36:46,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 13:36:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 13:36:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-09-08 13:36:46,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 13:36:46,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250081417] [2023-09-08 13:36:46,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250081417] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 13:36:46,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 13:36:46,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-08 13:36:46,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119817282] [2023-09-08 13:36:46,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 13:36:46,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-08 13:36:46,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 13:36:46,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 13:36:46,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-08 13:36:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:46,270 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 13:36:46,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 13:36:46,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:46,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-08 13:36:46,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-08 13:36:46,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2023-09-08 13:36:46,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-08 13:36:46,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:46,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:46,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-08 13:36:46,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-08 13:36:46,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2023-09-08 13:36:46,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-08 13:36:46,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 13:36:46,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-08 13:36:46,344 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 13:36:46,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 13:36:46,344 INFO L85 PathProgramCache]: Analyzing trace with hash 877846404, now seen corresponding path program 4 times [2023-09-08 13:36:46,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 13:36:46,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35106512] [2023-09-08 13:36:46,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 13:36:46,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 13:36:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 13:36:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 22 proven. 32 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-09-08 13:36:46,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 13:36:46,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35106512] [2023-09-08 13:36:46,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35106512] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 13:36:46,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282163179] [2023-09-08 13:36:46,599 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-08 13:36:46,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 13:36:46,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 13:36:46,600 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-09-08 13:36:46,601 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-09-08 13:36:46,700 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-08 13:36:46,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 13:36:46,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 12 conjunts are in the unsatisfiable core [2023-09-08 13:36:46,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 13:36:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-09-08 13:36:47,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 13:36:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-09-08 13:36:47,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282163179] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 13:36:47,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 13:36:47,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2023-09-08 13:36:47,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962004190] [2023-09-08 13:36:47,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 13:36:47,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-09-08 13:36:47,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 13:36:47,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-09-08 13:36:47,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2023-09-08 13:36:47,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:47,549 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 13:36:47,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.321428571428571) internal successors, (289), 28 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 13:36:47,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:47,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-08 13:36:47,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-08 13:36:47,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2023-09-08 13:36:47,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-08 13:36:47,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 13:36:47,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-08 13:36:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-08 13:36:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2023-09-08 13:36:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-08 13:36:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 13:36:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-09-08 13:36:48,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-08 13:36:48,541 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-09-08 13:36:48,541 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 13:36:48,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 13:36:48,542 INFO L85 PathProgramCache]: Analyzing trace with hash -34687335, now seen corresponding path program 5 times [2023-09-08 13:36:48,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 13:36:48,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196626091] [2023-09-08 13:36:48,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 13:36:48,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 13:36:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 13:36:48,868 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 39 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-09-08 13:36:48,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 13:36:48,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196626091] [2023-09-08 13:36:48,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196626091] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 13:36:48,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556412183] [2023-09-08 13:36:48,869 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-08 13:36:48,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 13:36:48,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 13:36:48,877 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-09-08 13:36:48,907 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-09-08 13:36:49,018 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-09-08 13:36:49,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 13:36:49,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 10 conjunts are in the unsatisfiable core [2023-09-08 13:36:49,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 13:36:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-09-08 13:36:49,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 13:36:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 25 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-09-08 13:36:49,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556412183] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 13:36:49,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 13:36:49,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 7] total 23 [2023-09-08 13:36:49,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735047678] [2023-09-08 13:36:49,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 13:36:49,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-09-08 13:36:49,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 13:36:49,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-09-08 13:36:49,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-09-08 13:36:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:49,869 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 13:36:49,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 17.47826086956522) internal successors, (402), 23 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 13:36:49,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:49,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-08 13:36:49,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-08 13:36:49,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2023-09-08 13:36:49,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-08 13:36:49,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 13:36:49,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-09-08 13:36:49,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:36:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-08 13:36:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-08 13:36:51,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2023-09-08 13:36:51,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-08 13:36:51,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-08 13:36:51,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-09-08 13:36:51,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-09-08 13:36:51,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-09-08 13:36:51,895 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-09-08 13:36:51,895 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-08 13:36:51,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 13:36:51,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1999966842, now seen corresponding path program 6 times [2023-09-08 13:36:51,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 13:36:51,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865677533] [2023-09-08 13:36:51,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 13:36:51,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 13:36:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 13:36:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 13:36:58,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 13:36:58,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865677533] [2023-09-08 13:36:58,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865677533] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-08 13:36:58,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732601691] [2023-09-08 13:36:58,390 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-09-08 13:36:58,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-08 13:36:58,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 13:36:58,392 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-09-08 13:36:58,393 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-09-08 13:36:58,826 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-09-08 13:36:58,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-08 13:36:58,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 90 conjunts are in the unsatisfiable core [2023-09-08 13:36:58,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-08 13:37:00,771 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-09-08 13:37:01,335 INFO L351 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 6 treesize of output 5 [2023-09-08 13:37:01,426 INFO L351 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 6 treesize of output 5 [2023-09-08 13:37:02,923 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 13:37:02,924 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 37 [2023-09-08 13:37:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 3 proven. 72 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-08 13:37:03,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-08 13:37:25,148 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~q1_back~0 4)) (.cse6 (* c_~q1_front~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse4 (select .cse8 c_~q2~0.base)) (.cse5 (select .cse8 ~q1~0.base))) (let ((.cse1 (select .cse5 (+ .cse7 ~q1~0.offset 4))) (.cse2 (select .cse5 (+ .cse6 ~q1~0.offset 4))) (.cse0 (select .cse4 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse3 (select .cse4 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (or (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse0 (+ .cse1 1)) (< .cse2 .cse1) (< .cse2 .cse3) (< .cse0 (+ .cse3 1)) (< ~q2_back~0 v_~q2_front~0_45)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse13 (select .cse15 c_~q2~0.base)) (.cse14 (select .cse15 ~q1~0.base))) (let ((.cse9 (select .cse14 (+ .cse6 ~q1~0.offset 4))) (.cse10 (select .cse14 (+ .cse7 ~q1~0.offset 4))) (.cse12 (select .cse13 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse11 (select .cse13 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (or (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse9 (+ .cse10 1)) (< .cse9 (+ .cse11 1)) (< v_~q2_front~0_45 1) (< .cse12 .cse10) (< .cse12 .cse11) (< ~q2_back~0 v_~q2_front~0_45)))))))) is different from false [2023-09-08 13:37:25,568 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~q1_front~0 4)) (.cse5 (* c_~q1_back~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse4 (select .cse8 ~q1~0.base)) (.cse7 (select .cse8 c_~q2~0.base))) (let ((.cse0 (select .cse7 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse2 (select .cse7 (+ c_~q2~0.offset (* ~q2_back~0 4)))) (.cse3 (select .cse4 (+ .cse6 ~q1~0.offset 4))) (.cse1 (select .cse4 (+ .cse5 ~q1~0.offset 4)))) (or (< .cse0 (+ .cse1 1)) (< .cse0 (+ .cse2 1)) (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse3 .cse2) (< v_~q2_front~0_45 1) (< .cse3 .cse1) (< ~q2_back~0 v_~q2_front~0_45)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse14 (select .cse15 ~q1~0.base)) (.cse13 (select .cse15 c_~q2~0.base))) (let ((.cse9 (select .cse13 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse10 (select .cse14 (+ .cse5 ~q1~0.offset 4))) (.cse12 (select .cse14 (+ .cse6 ~q1~0.offset 4))) (.cse11 (select .cse13 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (or (< .cse9 .cse10) (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse9 .cse11) (< .cse12 (+ .cse10 1)) (< .cse12 (+ .cse11 1)) (< ~q2_back~0 v_~q2_front~0_45)))))))) is different from false [2023-09-08 13:37:25,818 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~q1_back~0 4)) (.cse6 (* c_~q1_front~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_#t~ret17#1.base|)) (.cse5 (select .cse8 ~q1~0.base))) (let ((.cse1 (select .cse5 (+ .cse7 ~q1~0.offset 4))) (.cse0 (select .cse5 (+ .cse6 ~q1~0.offset 4))) (.cse2 (select .cse4 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (.cse3 (select .cse4 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| (* ~q2_back~0 4))))) (or (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse0 (+ .cse1 1)) (< .cse2 .cse1) (< .cse0 (+ .cse3 1)) (< .cse2 .cse3) (< ~q2_back~0 v_~q2_front~0_45)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse13 (select .cse15 ~q1~0.base)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (let ((.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| (* ~q2_back~0 4)))) (.cse9 (select .cse13 (+ .cse6 ~q1~0.offset 4))) (.cse11 (select .cse14 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (.cse12 (select .cse13 (+ .cse7 ~q1~0.offset 4)))) (or (< .cse9 .cse10) (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse11 (+ .cse10 1)) (< .cse9 .cse12) (< .cse11 (+ .cse12 1)) (< ~q2_back~0 v_~q2_front~0_45)))))))) is different from false [2023-09-08 13:37:25,890 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~q1_back~0 4)) (.cse6 (* c_~q1_front~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse4 (select .cse8 ~q1~0.base)) (.cse7 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse0 (select .cse7 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse3 (select .cse7 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse2 (select .cse4 (+ .cse6 ~q1~0.offset 4))) (.cse1 (select .cse4 (+ .cse5 ~q1~0.offset 4)))) (or (< .cse0 .cse1) (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse2 (+ .cse3 1)) (< v_~q2_front~0_45 1) (< .cse0 .cse3) (< .cse2 (+ .cse1 1)) (< ~q2_back~0 v_~q2_front~0_45)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse13 (select .cse15 ~q1~0.base)) (.cse14 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse10 (select .cse14 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse9 (select .cse14 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse11 (select .cse13 (+ .cse6 ~q1~0.offset 4))) (.cse12 (select .cse13 (+ .cse5 ~q1~0.offset 4)))) (or (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse9 (+ .cse10 1)) (< .cse11 .cse10) (< .cse9 (+ .cse12 1)) (< .cse11 .cse12) (< ~q2_back~0 v_~q2_front~0_45)))))))) is different from false [2023-09-08 13:37:32,022 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 13:37:32,022 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 145 [2023-09-08 13:37:32,113 INFO L322 Elim1Store]: treesize reduction 9, result has 90.7 percent of original size [2023-09-08 13:37:32,114 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2077 treesize of output 1842 [2023-09-08 13:37:32,166 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 13:37:32,197 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 13:37:32,197 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 824 treesize of output 770 [2023-09-08 13:37:32,223 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 13:37:32,254 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 13:37:32,254 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 752 treesize of output 568 [2023-09-08 13:37:51,670 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 13:37:51,671 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 145 [2023-09-08 13:37:51,737 INFO L322 Elim1Store]: treesize reduction 53, result has 45.4 percent of original size [2023-09-08 13:37:51,738 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3989 treesize of output 3420 [2023-09-08 13:37:51,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 13:37:51,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 13:37:51,809 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 13:37:51,809 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 799 treesize of output 690 [2023-09-08 13:37:51,826 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-08 13:37:51,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-08 13:37:51,848 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-08 13:37:51,849 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 731 treesize of output 481 [2023-09-08 13:37:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 25 refuted. 1 times theorem prover too weak. 52 trivial. 0 not checked. [2023-09-08 13:37:53,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732601691] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-08 13:37:53,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-08 13:37:53,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 43, 34] total 122 [2023-09-08 13:37:53,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074069322] [2023-09-08 13:37:53,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-08 13:37:53,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2023-09-08 13:37:53,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 13:37:53,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2023-09-08 13:37:53,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=13047, Unknown=35, NotChecked=940, Total=14762 [2023-09-08 13:37:53,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:37:53,685 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-08 13:37:53,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 4.065573770491803) internal successors, (496), 122 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-08 13:37:53,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:37:53,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-09-08 13:37:53,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-09-08 13:37:53,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2023-09-08 13:37:53,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-09-08 13:37:53,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-08 13:37:53,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-09-08 13:37:53,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-09-08 13:37:53,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-08 13:38:06,287 WARN L234 SmtUtils]: Spent 12.19s on a formula simplification. DAG size of input: 101 DAG size of output: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:38:17,332 WARN L234 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 103 DAG size of output: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:38:17,477 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| c_~q2~0.base))) (let ((.cse62 (+ c_~q2_front~0 1)) (.cse2 (select .cse12 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (.cse11 (* c_~q1_back~0 4)) (.cse13 (* c_~q1_front~0 4))) (let ((.cse16 (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse63 (select |c_#memory_int| ~q1~0.base))) (or (< c_~N~0 (+ (select .cse63 (+ .cse11 ~q1~0.offset)) 1)) (< (select .cse63 (+ .cse13 ~q1~0.offset)) c_~N~0))))) (.cse14 (< .cse2 c_~N~0)) (.cse1 (< (+ .cse2 1) c_~N~0)) (.cse3 (< c_~n2~0 .cse62)) (.cse4 (< c_~q2_front~0 0)) (.cse5 (< c_~q2_back~0 .cse62)) (.cse15 (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse61 (select |c_#memory_int| ~q1~0.base))) (or (< (+ (select .cse61 (+ .cse13 ~q1~0.offset)) 1) c_~N~0) (< c_~N~0 (+ (select .cse61 (+ .cse11 ~q1~0.offset)) 1)))))) (.cse0 (and (or (not (= 2 c_~n2~0)) (= c_~q1_back~0 c_~q1_front~0)) (<= c_~n2~0 2)))) (and (or .cse0 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (and (or .cse1 (< .cse2 c_~i~0)) (or (< c_~i~0 (+ c_~N~0 1)) .cse1)) .cse3 .cse4 .cse5) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (~q1~0.base Int) (v_~q2_front~0_45 Int)) (let ((.cse10 (select |c_#memory_int| ~q1~0.base))) (let ((.cse6 (select .cse10 (+ .cse13 ~q1~0.offset 4))) (.cse7 (select .cse12 (+ c_~q2~0.offset (* ~q2_back~0 4)))) (.cse9 (select .cse12 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse8 (select .cse10 (+ .cse11 ~q1~0.offset)))) (or (< .cse6 .cse7) (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse6 .cse8) (< v_~q2_front~0_45 1) (< .cse9 (+ .cse7 1)) (< .cse9 (+ .cse8 1)) (< ~q2_back~0 v_~q2_front~0_45))))) (= c_~i~0 0) (or (and (or .cse14 .cse15) (or .cse1 .cse16)) .cse3 .cse4 .cse5) (= c_~j~0 c_~i~0) (or (forall ((~q2_back~0 Int) (v_~q2_front~0_45 Int)) (or (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< (+ (select .cse12 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset)) 1) c_~N~0) (not (= (select .cse12 (+ c_~q2~0.offset (* ~q2_back~0 4))) c_~i~0)) (< ~q2_back~0 v_~q2_front~0_45))) .cse16) (or (forall ((v_~q2_front~0_45 Int)) (let ((.cse17 (+ v_~q2_front~0_45 1))) (or (< c_~q2_back~0 .cse17) (< v_~q2_front~0_45 1) (< (+ (select .cse12 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset)) 1) c_~N~0) (< c_~n2~0 .cse17)))) .cse16) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse23 (select .cse24 ~q1~0.base))) (let ((.cse20 (select .cse23 (+ .cse13 ~q1~0.offset 4))) (.cse19 (select .cse23 (+ .cse11 ~q1~0.offset 4))) (.cse18 (select .cse22 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse21 (select .cse22 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse18 .cse19) (< .cse20 (+ .cse21 1)) (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse20 (+ .cse19 1)) (< .cse18 .cse21) (< ~q2_back~0 v_~q2_front~0_45)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse29 (select .cse31 ~q1~0.base)) (.cse30 (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse25 (select .cse30 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse26 (select .cse30 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse28 (select .cse29 (+ .cse13 ~q1~0.offset 4))) (.cse27 (select .cse29 (+ .cse11 ~q1~0.offset 4)))) (or (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse25 (+ .cse26 1)) (< .cse25 (+ .cse27 1)) (< .cse28 .cse26) (< .cse28 .cse27) (< ~q2_back~0 v_~q2_front~0_45)))))) (or .cse15 (forall ((v_~q2_front~0_45 Int)) (let ((.cse32 (+ v_~q2_front~0_45 1))) (or (< c_~q2_back~0 .cse32) (< v_~q2_front~0_45 1) (< c_~n2~0 .cse32) (< (select .cse12 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset)) c_~N~0))))) (or (and (or .cse14 (< (+ c_~i~0 1) c_~N~0)) (or (< c_~i~0 c_~N~0) .cse1)) .cse3 .cse4 .cse5) (or (let ((.cse33 (select (select |c_#memory_int| c_~q1~0.base) (+ .cse13 c_~q1~0.offset)))) (and (or .cse14 (< (+ .cse33 1) c_~N~0)) (or (< .cse33 c_~N~0) .cse1))) .cse3 .cse4 .cse5) (or (and (or (< |c_thread1Thread1of1ForFork0_#t~post5#1| c_~N~0) .cse1) (or .cse14 (< (+ |c_thread1Thread1of1ForFork0_#t~post5#1| 1) c_~N~0))) .cse3 .cse4 .cse5) (or (and (or .cse14 (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse34 (select |c_#memory_int| ~q1~0.base))) (or (not (= (select .cse34 (+ .cse11 ~q1~0.offset)) c_~j~0)) (< (+ (select .cse34 (+ .cse13 ~q1~0.offset)) 1) c_~N~0))))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse35 (select |c_#memory_int| ~q1~0.base))) (or (not (= (select .cse35 (+ .cse11 ~q1~0.offset)) c_~j~0)) (< (select .cse35 (+ .cse13 ~q1~0.offset)) c_~N~0)))) .cse1)) .cse3 .cse4 .cse5) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (~q1~0.base Int) (v_~q2_front~0_45 Int)) (let ((.cse40 (select |c_#memory_int| ~q1~0.base))) (let ((.cse38 (select .cse40 (+ .cse13 ~q1~0.offset 4))) (.cse37 (select .cse12 (+ c_~q2~0.offset (* ~q2_back~0 4)))) (.cse36 (select .cse12 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse39 (select .cse40 (+ .cse11 ~q1~0.offset)))) (or (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse36 .cse37) (< .cse38 (+ .cse39 1)) (< .cse38 (+ .cse37 1)) (< .cse36 .cse39) (< ~q2_back~0 v_~q2_front~0_45))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (~q1~0.base Int) (v_~q2_front~0_45 Int)) (let ((.cse45 (select |c_#memory_int| ~q1~0.base))) (let ((.cse41 (select .cse45 (+ .cse13 ~q1~0.offset))) (.cse43 (select .cse12 (+ c_~q2~0.offset (* ~q2_back~0 4)))) (.cse44 (select .cse12 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse42 (select .cse45 (+ .cse11 ~q1~0.offset)))) (or (< .cse41 (+ .cse42 1)) (< .cse41 (+ .cse43 1)) (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse44 .cse43) (< .cse44 .cse42) (< ~q2_back~0 v_~q2_front~0_45))))) (or .cse0 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post25#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (~q1~0.base Int) (v_~q2_front~0_45 Int)) (let ((.cse50 (select |c_#memory_int| ~q1~0.base))) (let ((.cse48 (select .cse12 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse47 (select .cse12 (+ c_~q2~0.offset (* ~q2_back~0 4)))) (.cse46 (select .cse50 (+ .cse13 ~q1~0.offset 4))) (.cse49 (select .cse50 (+ .cse11 ~q1~0.offset 4)))) (or (< .cse46 .cse47) (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse48 (+ .cse49 1)) (< v_~q2_front~0_45 1) (< .cse48 (+ .cse47 1)) (< .cse46 .cse49) (< ~q2_back~0 v_~q2_front~0_45))))) (or (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse0) (or .cse15 (forall ((~q2_back~0 Int) (v_~q2_front~0_45 Int)) (or (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (not (= (select .cse12 (+ c_~q2~0.offset (* ~q2_back~0 4))) c_~i~0)) (< (select .cse12 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset)) c_~N~0) (< ~q2_back~0 v_~q2_front~0_45)))) (or (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (~q1~0.base Int) (v_~q2_front~0_45 Int)) (let ((.cse55 (select |c_#memory_int| ~q1~0.base))) (let ((.cse52 (select .cse12 (+ c_~q2~0.offset (* ~q2_back~0 4)))) (.cse53 (select .cse12 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse51 (select .cse55 (+ .cse13 ~q1~0.offset))) (.cse54 (select .cse55 (+ .cse11 ~q1~0.offset)))) (or (< c_~n2~0 (+ ~q2_back~0 1)) (< .cse51 .cse52) (< v_~q2_front~0_45 1) (< .cse53 (+ .cse52 1)) (< .cse53 (+ .cse54 1)) (< .cse51 .cse54) (< ~q2_back~0 v_~q2_front~0_45))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (~q1~0.base Int) (v_~q2_front~0_45 Int)) (let ((.cse60 (select |c_#memory_int| ~q1~0.base))) (let ((.cse57 (select .cse60 (+ .cse11 ~q1~0.offset 4))) (.cse58 (select .cse12 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse56 (select .cse60 (+ .cse13 ~q1~0.offset 4))) (.cse59 (select .cse12 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (or (< .cse56 (+ .cse57 1)) (< c_~n2~0 (+ ~q2_back~0 1)) (< v_~q2_front~0_45 1) (< .cse58 .cse57) (< .cse58 .cse59) (< .cse56 (+ .cse59 1)) (< ~q2_back~0 v_~q2_front~0_45))))))))) is different from false [2023-09-08 13:38:49,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-08 13:38:51,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-08 13:39:07,605 WARN L234 SmtUtils]: Spent 12.34s on a formula simplification. DAG size of input: 152 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:39:18,415 WARN L234 SmtUtils]: Spent 10.38s on a formula simplification. DAG size of input: 158 DAG size of output: 102 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:39:20,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-08 13:39:30,935 WARN L234 SmtUtils]: Spent 8.30s on a formula simplification. DAG size of input: 130 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:39:41,543 WARN L234 SmtUtils]: Spent 10.28s on a formula simplification. DAG size of input: 134 DAG size of output: 89 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:39:59,404 WARN L234 SmtUtils]: Spent 12.55s on a formula simplification. DAG size of input: 92 DAG size of output: 81 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:40:06,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-08 13:41:08,968 WARN L234 SmtUtils]: Spent 16.82s on a formula simplification. DAG size of input: 149 DAG size of output: 106 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:41:36,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-08 13:41:38,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-08 13:41:40,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-08 13:41:42,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-08 13:41:44,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-08 13:41:46,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-08 13:41:48,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-08 13:41:50,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-08 13:41:52,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-08 13:41:54,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-08 13:41:56,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-08 13:41:58,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-09-08 13:42:18,177 WARN L234 SmtUtils]: Spent 10.93s on a formula simplification. DAG size of input: 141 DAG size of output: 102 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-08 13:42:23,250 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-09-08 13:42:23,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-09-08 13:42:23,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2023-09-08 13:42:23,450 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-09-08 13:42:23,451 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: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.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:625) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:196) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.SleepMapReduction.computeSuccessorWithBudget(SleepMapReduction.java:186) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.SleepMapReduction.internalSuccessors(SleepMapReduction.java:156) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.OptimisticBudget.checkIsSuccessful(OptimisticBudget.java:162) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.OptimisticBudget.isSuccessful(OptimisticBudget.java:151) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.OptimisticBudget.computeBudget(OptimisticBudget.java:130) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.CachedBudget.computeBudget(CachedBudget.java:69) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.SleepMapReduction.internalSuccessors(SleepMapReduction.java:156) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at java.base/java.util.Iterator.forEachRemaining(Iterator.java:133) at java.base/java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEachOrdered(ReferencePipeline.java:502) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:236) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) 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:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) ... 79 more [2023-09-08 13:42:23,454 INFO L158 Benchmark]: Toolchain (without parser) took 696315.88ms. Allocated memory was 226.5MB in the beginning and 682.6MB in the end (delta: 456.1MB). Free memory was 192.8MB in the beginning and 236.2MB in the end (delta: -43.3MB). Peak memory consumption was 412.3MB. Max. memory is 7.0GB. [2023-09-08 13:42:23,454 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 226.5MB. Free memory was 181.9MB in the beginning and 181.7MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 7.0GB. [2023-09-08 13:42:23,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.09ms. Allocated memory is still 226.5MB. Free memory was 192.4MB in the beginning and 180.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. [2023-09-08 13:42:23,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.63ms. Allocated memory is still 226.5MB. Free memory was 180.8MB in the beginning and 178.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-08 13:42:23,455 INFO L158 Benchmark]: Boogie Preprocessor took 31.18ms. Allocated memory is still 226.5MB. Free memory was 178.7MB in the beginning and 176.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-08 13:42:23,455 INFO L158 Benchmark]: RCFGBuilder took 464.95ms. Allocated memory is still 226.5MB. Free memory was 176.8MB in the beginning and 147.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 7.0GB. [2023-09-08 13:42:23,455 INFO L158 Benchmark]: TraceAbstraction took 695601.17ms. Allocated memory was 226.5MB in the beginning and 682.6MB in the end (delta: 456.1MB). Free memory was 146.8MB in the beginning and 236.2MB in the end (delta: -89.3MB). Peak memory consumption was 366.2MB. Max. memory is 7.0GB. [2023-09-08 13:42:23,456 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 226.5MB. Free memory was 181.9MB in the beginning and 181.7MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 185.09ms. Allocated memory is still 226.5MB. Free memory was 192.4MB in the beginning and 180.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 29.63ms. Allocated memory is still 226.5MB. Free memory was 180.8MB in the beginning and 178.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 31.18ms. Allocated memory is still 226.5MB. Free memory was 178.7MB in the beginning and 176.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * RCFGBuilder took 464.95ms. Allocated memory is still 226.5MB. Free memory was 176.8MB in the beginning and 147.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 7.0GB. * TraceAbstraction took 695601.17ms. Allocated memory was 226.5MB in the beginning and 682.6MB in the end (delta: 456.1MB). Free memory was 146.8MB in the beginning and 236.2MB in the end (delta: -89.3MB). Peak memory consumption was 366.2MB. Max. memory is 7.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: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/UAutomizer-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. [2023-09-08 13:42:23,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 Received shutdown request...