/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking BOTH --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-08 03:50:05,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-08 03:50:05,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-08 03:50:05,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-08 03:50:05,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-08 03:50:05,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-08 03:50:05,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-08 03:50:05,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-08 03:50:05,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-08 03:50:05,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-08 03:50:05,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-08 03:50:05,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-08 03:50:05,848 INFO L153 SettingsManager]: * Use SBE=true [2024-05-08 03:50:05,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-08 03:50:05,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-08 03:50:05,849 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-08 03:50:05,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-08 03:50:05,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-08 03:50:05,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-08 03:50:05,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-08 03:50:05,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-08 03:50:05,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-08 03:50:05,852 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-08 03:50:05,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-08 03:50:05,853 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-08 03:50:05,853 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-08 03:50:05,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-08 03:50:05,854 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-08 03:50:05,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-08 03:50:05,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 03:50:05,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-08 03:50:05,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-08 03:50:05,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-08 03:50:05,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-08 03:50:05,856 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-08 03:50:05,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-08 03:50:05,857 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-08 03:50:05,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-08 03:50:05,857 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-08 03:50:05,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-08 03:50:06,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-08 03:50:06,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-08 03:50:06,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-08 03:50:06,072 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-08 03:50:06,072 INFO L274 PluginConnector]: CDTParser initialized [2024-05-08 03:50:06,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-05-08 03:50:07,242 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-08 03:50:07,482 INFO L384 CDTParser]: Found 1 translation units. [2024-05-08 03:50:07,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-05-08 03:50:07,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0fcf8028a/cd193ef3fb2545748dce6d134f1f966d/FLAGc582999c9 [2024-05-08 03:50:07,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0fcf8028a/cd193ef3fb2545748dce6d134f1f966d [2024-05-08 03:50:07,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-08 03:50:07,509 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-08 03:50:07,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-08 03:50:07,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-08 03:50:07,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-08 03:50:07,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 03:50:07" (1/1) ... [2024-05-08 03:50:07,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2864e01a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 03:50:07, skipping insertion in model container [2024-05-08 03:50:07,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 03:50:07" (1/1) ... [2024-05-08 03:50:07,539 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-08 03:50:07,712 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-bad-counter-queue.wvr.c[2428,2441] [2024-05-08 03:50:07,724 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 03:50:07,732 INFO L202 MainTranslator]: Completed pre-run [2024-05-08 03:50:07,748 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-bad-counter-queue.wvr.c[2428,2441] [2024-05-08 03:50:07,754 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 03:50:07,762 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 03:50:07,762 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 03:50:07,769 INFO L206 MainTranslator]: Completed translation [2024-05-08 03:50:07,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 03:50:07 WrapperNode [2024-05-08 03:50:07,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-08 03:50:07,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-08 03:50:07,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-08 03:50:07,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-08 03:50:07,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 03:50:07" (1/1) ... [2024-05-08 03:50:07,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 03:50:07" (1/1) ... [2024-05-08 03:50:07,841 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 148 [2024-05-08 03:50:07,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-08 03:50:07,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-08 03:50:07,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-08 03:50:07,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-08 03:50:07,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 03:50:07" (1/1) ... [2024-05-08 03:50:07,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 03:50:07" (1/1) ... [2024-05-08 03:50:07,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 03:50:07" (1/1) ... [2024-05-08 03:50:07,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 03:50:07" (1/1) ... [2024-05-08 03:50:07,862 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 03:50:07" (1/1) ... [2024-05-08 03:50:07,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 03:50:07" (1/1) ... [2024-05-08 03:50:07,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 03:50:07" (1/1) ... [2024-05-08 03:50:07,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 03:50:07" (1/1) ... [2024-05-08 03:50:07,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-08 03:50:07,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-08 03:50:07,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-08 03:50:07,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-08 03:50:07,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 03:50:07" (1/1) ... [2024-05-08 03:50:07,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 03:50:07,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 03:50:07,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-08 03:50:07,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-08 03:50:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-08 03:50:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-08 03:50:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-08 03:50:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-08 03:50:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-08 03:50:07,954 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-08 03:50:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-08 03:50:07,954 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-08 03:50:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-08 03:50:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-08 03:50:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-08 03:50:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-08 03:50:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-08 03:50:07,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-08 03:50:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-08 03:50:07,959 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-08 03:50:08,038 INFO L241 CfgBuilder]: Building ICFG [2024-05-08 03:50:08,040 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-08 03:50:08,270 INFO L282 CfgBuilder]: Performing block encoding [2024-05-08 03:50:08,377 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-08 03:50:08,377 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-08 03:50:08,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 03:50:08 BoogieIcfgContainer [2024-05-08 03:50:08,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-08 03:50:08,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-08 03:50:08,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-08 03:50:08,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-08 03:50:08,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.05 03:50:07" (1/3) ... [2024-05-08 03:50:08,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e39d14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 03:50:08, skipping insertion in model container [2024-05-08 03:50:08,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 03:50:07" (2/3) ... [2024-05-08 03:50:08,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e39d14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 03:50:08, skipping insertion in model container [2024-05-08 03:50:08,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 03:50:08" (3/3) ... [2024-05-08 03:50:08,387 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-05-08 03:50:08,395 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-08 03:50:08,404 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-08 03:50:08,404 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-08 03:50:08,405 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-08 03:50:08,466 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-08 03:50:08,516 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 03:50:08,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 03:50:08,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 03:50:08,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-08 03:50:08,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-08 03:50:08,568 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 03:50:08,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 03:50:08,584 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 03:50:08,593 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@555e2d6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-08 03:50:08,594 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-08 03:50:08,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-05-08 03:50:09,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1427562494, now seen corresponding path program 1 times [2024-05-08 03:50:09,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:09,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 03:50:09,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:09,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:09,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 03:50:09,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-08 03:50:09,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-08 03:50:09,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-05-08 03:50:09,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1567321929, now seen corresponding path program 1 times [2024-05-08 03:50:09,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:09,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:09,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:09,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:10,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-08 03:50:10,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-08 03:50:10,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-05-08 03:50:10,421 INFO L85 PathProgramCache]: Analyzing trace with hash -643313453, now seen corresponding path program 1 times [2024-05-08 03:50:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:10,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:10,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:10,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:11,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-05-08 03:50:11,091 INFO L85 PathProgramCache]: Analyzing trace with hash -643313915, now seen corresponding path program 1 times [2024-05-08 03:50:11,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:11,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:11,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:11,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:11,397 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 03:50:11,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 03:50:11,399 INFO L85 PathProgramCache]: Analyzing trace with hash 175241813, now seen corresponding path program 1 times [2024-05-08 03:50:11,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 03:50:11,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136773001] [2024-05-08 03:50:11,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:11,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:11,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:11,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 03:50:11,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136773001] [2024-05-08 03:50:11,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136773001] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 03:50:11,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296451836] [2024-05-08 03:50:11,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:11,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 03:50:11,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 03:50:11,564 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 03:50:11,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-08 03:50:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:11,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-08 03:50:11,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 03:50:11,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:11,818 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 03:50:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:11,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296451836] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-08 03:50:11,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-08 03:50:11,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2024-05-08 03:50:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401169944] [2024-05-08 03:50:11,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 03:50:11,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-08 03:50:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 03:50:12,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-08 03:50:12,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-05-08 03:50:12,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:50:12,022 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 03:50:12,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 03:50:12,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:50:12,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-08 03:50:12,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-08 03:50:12,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-05-08 03:50:12,324 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 03:50:12,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 03:50:12,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2045221921, now seen corresponding path program 1 times [2024-05-08 03:50:12,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 03:50:12,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785981392] [2024-05-08 03:50:12,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:12,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:12,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 03:50:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785981392] [2024-05-08 03:50:12,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785981392] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 03:50:12,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266638354] [2024-05-08 03:50:12,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:12,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 03:50:12,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 03:50:12,617 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 03:50:12,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-08 03:50:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:12,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-08 03:50:12,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 03:50:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:12,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 03:50:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:13,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266638354] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 03:50:13,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 03:50:13,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-05-08 03:50:13,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414024094] [2024-05-08 03:50:13,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 03:50:13,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-05-08 03:50:13,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 03:50:13,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-05-08 03:50:13,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-05-08 03:50:13,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:50:13,219 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 03:50:13,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.708333333333333) internal successors, (185), 24 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 03:50:13,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-08 03:50:13,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:50:13,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-08 03:50:13,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-08 03:50:13,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-08 03:50:13,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-08 03:50:13,675 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 03:50:13,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 03:50:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1897562747, now seen corresponding path program 2 times [2024-05-08 03:50:13,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 03:50:13,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336203099] [2024-05-08 03:50:13,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:13,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:13,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 03:50:13,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336203099] [2024-05-08 03:50:13,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336203099] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 03:50:13,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129099805] [2024-05-08 03:50:13,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 03:50:13,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 03:50:13,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 03:50:13,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 03:50:13,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-08 03:50:14,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 03:50:14,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 03:50:14,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-08 03:50:14,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 03:50:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-08 03:50:14,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 03:50:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-08 03:50:14,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129099805] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 03:50:14,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 03:50:14,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 22 [2024-05-08 03:50:14,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551435382] [2024-05-08 03:50:14,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 03:50:14,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-08 03:50:14,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 03:50:14,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-08 03:50:14,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-05-08 03:50:14,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:50:14,337 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 03:50:14,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.136363636363637) internal successors, (201), 22 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 03:50:14,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-08 03:50:14,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-08 03:50:14,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:50:15,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-05-08 03:50:15,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1139534935, now seen corresponding path program 1 times [2024-05-08 03:50:15,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:15,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-08 03:50:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:15,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-08 03:50:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-08 03:50:16,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-08 03:50:16,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-08 03:50:16,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-08 03:50:16,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 03:50:16,258 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 03:50:16,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 03:50:16,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1024821117, now seen corresponding path program 3 times [2024-05-08 03:50:16,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 03:50:16,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721244961] [2024-05-08 03:50:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:16,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:16,627 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 61 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-05-08 03:50:16,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 03:50:16,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721244961] [2024-05-08 03:50:16,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721244961] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 03:50:16,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905054522] [2024-05-08 03:50:16,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-08 03:50:16,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 03:50:16,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 03:50:16,632 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 03:50:16,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-08 03:50:16,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-05-08 03:50:16,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 03:50:16,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 14 conjunts are in the unsatisfiable core [2024-05-08 03:50:16,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 03:50:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 78 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-08 03:50:17,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 03:50:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 78 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-08 03:50:17,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905054522] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 03:50:17,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 03:50:17,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2024-05-08 03:50:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769802197] [2024-05-08 03:50:17,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 03:50:17,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-08 03:50:17,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 03:50:17,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-08 03:50:17,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2024-05-08 03:50:17,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:50:17,594 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 03:50:17,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 7.162162162162162) internal successors, (265), 37 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 03:50:17,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-08 03:50:17,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-08 03:50:17,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-08 03:50:17,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:50:18,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-05-08 03:50:18,216 INFO L85 PathProgramCache]: Analyzing trace with hash 407101555, now seen corresponding path program 2 times [2024-05-08 03:50:18,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:18,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 24 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-08 03:50:18,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:18,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 24 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-08 03:50:18,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-08 03:50:18,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-08 03:50:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-08 03:50:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-08 03:50:18,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-08 03:50:19,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15 [2024-05-08 03:50:19,093 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 03:50:19,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 03:50:19,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1881657625, now seen corresponding path program 4 times [2024-05-08 03:50:19,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 03:50:19,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14442981] [2024-05-08 03:50:19,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:19,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 70 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:19,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 03:50:19,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14442981] [2024-05-08 03:50:19,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14442981] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 03:50:19,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170806129] [2024-05-08 03:50:19,512 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-08 03:50:19,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 03:50:19,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 03:50:19,513 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 03:50:19,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-08 03:50:19,619 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-08 03:50:19,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 03:50:19,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-08 03:50:19,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 03:50:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 80 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-08 03:50:20,060 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 03:50:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 80 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-08 03:50:20,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170806129] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 03:50:20,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 03:50:20,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 46 [2024-05-08 03:50:20,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108791169] [2024-05-08 03:50:20,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 03:50:20,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-05-08 03:50:20,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 03:50:20,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-05-08 03:50:20,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=1737, Unknown=0, NotChecked=0, Total=2070 [2024-05-08 03:50:20,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:50:20,562 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 03:50:20,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 6.369565217391305) internal successors, (293), 46 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 03:50:20,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-08 03:50:20,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-08 03:50:20,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-08 03:50:20,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-08 03:50:20,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:50:21,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-05-08 03:50:21,227 INFO L85 PathProgramCache]: Analyzing trace with hash 384039055, now seen corresponding path program 3 times [2024-05-08 03:50:21,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:21,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 03:50:21,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 03:50:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 03:50:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-08 03:50:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-08 03:50:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-08 03:50:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-08 03:50:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 03:50:21,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-08 03:50:21,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-08 03:50:21,618 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 03:50:21,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 03:50:21,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1318370997, now seen corresponding path program 5 times [2024-05-08 03:50:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 03:50:21,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806419140] [2024-05-08 03:50:21,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:21,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 40 proven. 95 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-08 03:50:22,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 03:50:22,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806419140] [2024-05-08 03:50:22,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806419140] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 03:50:22,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926553469] [2024-05-08 03:50:22,030 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-08 03:50:22,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 03:50:22,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 03:50:22,032 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 03:50:22,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-08 03:50:22,158 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-05-08 03:50:22,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 03:50:22,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-08 03:50:22,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 03:50:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 27 proven. 59 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-08 03:50:22,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 03:50:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 31 proven. 4 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-05-08 03:50:22,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926553469] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 03:50:22,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 03:50:22,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 8] total 42 [2024-05-08 03:50:22,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27321509] [2024-05-08 03:50:22,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 03:50:22,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-05-08 03:50:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 03:50:23,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-05-08 03:50:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash 384039055, now seen corresponding path program 4 times [2024-05-08 03:50:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:23,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 03:50:23,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 03:50:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 03:50:23,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-05-08 03:50:23,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1649, Unknown=0, NotChecked=0, Total=1806 [2024-05-08 03:50:23,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:50:23,286 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 03:50:23,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.809523809523809) internal successors, (286), 42 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 03:50:23,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-08 03:50:23,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-08 03:50:23,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-08 03:50:23,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-08 03:50:23,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 03:50:23,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:50:25,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-05-08 03:50:25,956 INFO L85 PathProgramCache]: Analyzing trace with hash -676286371, now seen corresponding path program 5 times [2024-05-08 03:50:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:25,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 100 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 100 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:27,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-05-08 03:50:27,867 INFO L85 PathProgramCache]: Analyzing trace with hash -840011657, now seen corresponding path program 6 times [2024-05-08 03:50:27,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:27,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 100 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:28,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:28,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:29,061 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 100 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:29,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-05-08 03:50:29,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1297422315, now seen corresponding path program 7 times [2024-05-08 03:50:29,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:29,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:30,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:30,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:31,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-05-08 03:50:31,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1626090829, now seen corresponding path program 8 times [2024-05-08 03:50:31,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:31,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 168 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:31,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:31,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 168 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 03:50:32,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-08 03:50:32,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-08 03:50:32,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-08 03:50:32,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-08 03:50:32,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 03:50:32,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-05-08 03:50:32,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-08 03:50:32,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27 [2024-05-08 03:50:32,912 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 03:50:32,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 03:50:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1762581039, now seen corresponding path program 6 times [2024-05-08 03:50:32,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 03:50:32,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879030491] [2024-05-08 03:50:32,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:32,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 211 proven. 68 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-05-08 03:50:33,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 03:50:33,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879030491] [2024-05-08 03:50:33,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879030491] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 03:50:33,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557065048] [2024-05-08 03:50:33,418 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-08 03:50:33,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 03:50:33,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 03:50:33,419 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 03:50:33,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-08 03:50:33,722 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-05-08 03:50:33,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 03:50:33,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-08 03:50:33,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 03:50:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 261 proven. 52 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-08 03:50:34,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 03:50:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 261 proven. 52 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-08 03:50:35,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557065048] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 03:50:35,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 03:50:35,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 27] total 70 [2024-05-08 03:50:35,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109526294] [2024-05-08 03:50:35,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 03:50:35,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-05-08 03:50:35,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 03:50:35,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-05-08 03:50:35,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=4147, Unknown=0, NotChecked=0, Total=4830 [2024-05-08 03:50:35,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:50:35,423 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 03:50:35,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 6.1571428571428575) internal successors, (431), 70 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 03:50:35,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-08 03:50:35,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-08 03:50:35,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-08 03:50:35,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-08 03:50:35,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 03:50:35,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2024-05-08 03:50:35,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:50:36,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-05-08 03:50:36,406 INFO L85 PathProgramCache]: Analyzing trace with hash -654080591, now seen corresponding path program 9 times [2024-05-08 03:50:36,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:36,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 03:50:36,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 03:50:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 03:50:36,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-05-08 03:50:36,717 INFO L85 PathProgramCache]: Analyzing trace with hash -191301941, now seen corresponding path program 10 times [2024-05-08 03:50:36,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:36,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 03:50:36,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 03:50:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 03:50:36,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-05-08 03:50:37,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2003685057, now seen corresponding path program 11 times [2024-05-08 03:50:37,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:37,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 168 proven. 243 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-08 03:50:38,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:38,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:50:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 168 proven. 243 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-08 03:50:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-08 03:50:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-08 03:50:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-08 03:50:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-08 03:50:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 03:50:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-05-08 03:50:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-08 03:50:38,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-05-08 03:50:39,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,SelfDestructingSolverStorable28,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 03:50:39,122 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-08 03:50:39,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 03:50:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash 778376027, now seen corresponding path program 7 times [2024-05-08 03:50:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 03:50:39,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029090701] [2024-05-08 03:50:39,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:50:39,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:50:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 03:50:39,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 03:50:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 03:50:39,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-08 03:50:39,315 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-08 03:50:39,317 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-08 03:50:39,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-08 03:50:39,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-08 03:50:39,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-08 03:50:39,325 INFO L448 BasicCegarLoop]: Path program histogram: [11, 7, 1, 1, 1, 1, 1] [2024-05-08 03:50:39,330 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-08 03:50:39,330 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-08 03:50:39,424 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2024-05-08 03:50:39,425 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc15 [2024-05-08 03:50:39,426 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-08 03:50:39,426 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-08 03:50:39,427 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-08 03:50:39,427 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-08 03:50:39,428 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-08 03:50:39,428 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-08 03:50:39,428 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-08 03:50:39,429 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-08 03:50:39,429 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret8 [2024-05-08 03:50:39,430 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-08 03:50:39,430 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2024-05-08 03:50:39,430 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2024-05-08 03:50:39,435 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-08 03:50:39,447 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-08 03:50:39,447 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2024-05-08 03:50:39,447 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated [2024-05-08 03:50:39,448 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated [2024-05-08 03:50:39,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.05 03:50:39 BasicIcfg [2024-05-08 03:50:39,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-08 03:50:39,467 INFO L158 Benchmark]: Toolchain (without parser) took 31957.76ms. Allocated memory was 156.2MB in the beginning and 796.9MB in the end (delta: 640.7MB). Free memory was 88.5MB in the beginning and 517.3MB in the end (delta: -428.8MB). Peak memory consumption was 212.6MB. Max. memory is 8.0GB. [2024-05-08 03:50:39,467 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 156.2MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-08 03:50:39,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.47ms. Allocated memory is still 156.2MB. Free memory was 88.3MB in the beginning and 76.5MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-08 03:50:39,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.57ms. Allocated memory was 156.2MB in the beginning and 240.1MB in the end (delta: 83.9MB). Free memory was 76.5MB in the beginning and 211.3MB in the end (delta: -134.8MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2024-05-08 03:50:39,467 INFO L158 Benchmark]: Boogie Preprocessor took 30.26ms. Allocated memory is still 240.1MB. Free memory was 211.3MB in the beginning and 209.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-08 03:50:39,468 INFO L158 Benchmark]: RCFGBuilder took 499.25ms. Allocated memory is still 240.1MB. Free memory was 209.7MB in the beginning and 179.8MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2024-05-08 03:50:39,468 INFO L158 Benchmark]: TraceAbstraction took 31084.51ms. Allocated memory was 240.1MB in the beginning and 796.9MB in the end (delta: 556.8MB). Free memory was 178.8MB in the beginning and 517.3MB in the end (delta: -338.5MB). Peak memory consumption was 218.3MB. Max. memory is 8.0GB. [2024-05-08 03:50:39,469 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.11ms. Allocated memory is still 156.2MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.47ms. Allocated memory is still 156.2MB. Free memory was 88.3MB in the beginning and 76.5MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.57ms. Allocated memory was 156.2MB in the beginning and 240.1MB in the end (delta: 83.9MB). Free memory was 76.5MB in the beginning and 211.3MB in the end (delta: -134.8MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.26ms. Allocated memory is still 240.1MB. Free memory was 211.3MB in the beginning and 209.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 499.25ms. Allocated memory is still 240.1MB. Free memory was 209.7MB in the beginning and 179.8MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 31084.51ms. Allocated memory was 240.1MB in the beginning and 796.9MB in the end (delta: 556.8MB). Free memory was 178.8MB in the beginning and 517.3MB in the end (delta: -338.5MB). Peak memory consumption was 218.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc15 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4714, independent: 4096, independent conditional: 3682, independent unconditional: 414, dependent: 618, dependent conditional: 613, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4150, independent: 4096, independent conditional: 3682, independent unconditional: 414, dependent: 54, dependent conditional: 49, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4150, independent: 4096, independent conditional: 3682, independent unconditional: 414, dependent: 54, dependent conditional: 49, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4150, independent: 4096, independent conditional: 3682, independent unconditional: 414, dependent: 54, dependent conditional: 49, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4261, independent: 4096, independent conditional: 1905, independent unconditional: 2191, dependent: 165, dependent conditional: 109, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4261, independent: 4096, independent conditional: 1719, independent unconditional: 2377, dependent: 165, dependent conditional: 49, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4261, independent: 4096, independent conditional: 1719, independent unconditional: 2377, dependent: 165, dependent conditional: 49, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 251, independent: 234, independent conditional: 1, independent unconditional: 233, dependent: 17, dependent conditional: 11, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 251, independent: 233, independent conditional: 0, independent unconditional: 233, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 17, dependent conditional: 11, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 17, dependent conditional: 11, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 88, dependent conditional: 39, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4261, independent: 3862, independent conditional: 1718, independent unconditional: 2144, dependent: 148, dependent conditional: 38, dependent unconditional: 110, unknown: 251, unknown conditional: 12, unknown unconditional: 239] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 234, Positive conditional cache size: 1, Positive unconditional cache size: 233, Negative cache size: 17, Negative conditional cache size: 11, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 246, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4261, independent: 4096, independent conditional: 1905, independent unconditional: 2191, dependent: 165, dependent conditional: 109, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4261, independent: 4096, independent conditional: 1719, independent unconditional: 2377, dependent: 165, dependent conditional: 49, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4261, independent: 4096, independent conditional: 1719, independent unconditional: 2377, dependent: 165, dependent conditional: 49, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 251, independent: 234, independent conditional: 1, independent unconditional: 233, dependent: 17, dependent conditional: 11, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 251, independent: 233, independent conditional: 0, independent unconditional: 233, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 17, dependent conditional: 11, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 17, dependent conditional: 11, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 88, dependent conditional: 39, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4261, independent: 3862, independent conditional: 1718, independent unconditional: 2144, dependent: 148, dependent conditional: 38, dependent unconditional: 110, unknown: 251, unknown conditional: 12, unknown unconditional: 239] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 234, Positive conditional cache size: 1, Positive unconditional cache size: 233, Negative cache size: 17, Negative conditional cache size: 11, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 246 ], Independence queries for same thread: 564 - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; VAL [A={0:0}] [L42] 0 int counter, N; VAL [A={0:0}, N=0, counter=0] [L75] 0 pthread_t t1, t2; VAL [A={0:0}, N=0, counter=0, t1={6:0}, t2={5:0}] [L77] 0 N = __VERIFIER_nondet_int() VAL [A={0:0}, N=7, counter=0, t1={6:0}, t2={5:0}] [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) VAL [A={0:0}, N=7, \old(cond)=1, cond=1, counter=0] [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) VAL [A={0:0}, N=7, \old(cond)=1, cond=1, counter=0] [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, size=7] [L97] 0 int i = 0; VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=0, size=7] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=0, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=0, size=7] [L97] 0 i++ VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=1, size=7] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=1, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=1, size=7] [L97] 0 i++ VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=2, size=7] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=2, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=2, size=7] [L97] 0 i++ VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=3, size=7] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=3, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=3, size=7] [L97] 0 i++ VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=4, size=7] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=4, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=4, size=7] [L97] 0 i++ VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=5, size=7] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=5, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=5, size=7] [L97] 0 i++ VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=6, size=7] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=6, size=7] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=6, size=7] [L97] 0 i++ VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=7, size=7] [L97] COND FALSE 0 !(i < size) VAL [A={0:0}, N=7, \old(size)=7, arr={3:0}, counter=0, i=7, size=7] [L100] 0 return arr; VAL [A={0:0}, N=7, \old(size)=7, \result={3:0}, arr={3:0}, counter=0, size=7] [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) VAL [A={3:0}, N=7, counter=0, t1={6:0}, t2={5:0}] [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, N=7, counter=0, t1={6:0}, t2={5:0}] [L49] 1 int i=0; VAL [A={3:0}, N=7, counter=0, i=0] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, N=7, counter=0, t1={6:0}, t2={5:0}] [L62] 2 int i=0; VAL [A={3:0}, N=7, counter=0, i=0] [L83] 0 \read(t1) VAL [A={3:0}, N=7, counter=0, t1={6:0}, t2={5:0}] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=7, counter=10, i=0, tmp=10] [L49] 1 i++ VAL [A={3:0}, N=7, counter=10, i=1, tmp=10] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, N=7, counter=0, i=0, tmp=0] [L62] 2 i++ VAL [A={3:0}, N=7, counter=0, i=1, tmp=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=7, counter=7, i=1, tmp=7] [L49] 1 i++ VAL [A={3:0}, N=7, counter=7, i=2, tmp=7] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, N=7, counter=0, i=1, tmp=0] [L62] 2 i++ VAL [A={3:0}, N=7, counter=0, i=2, tmp=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=7, counter=-9, i=2, tmp=-9] [L49] 1 i++ VAL [A={3:0}, N=7, counter=-9, i=3, tmp=-9] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, N=7, counter=0, i=2, tmp=0] [L62] 2 i++ VAL [A={3:0}, N=7, counter=0, i=3, tmp=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=7, counter=14, i=3, tmp=14] [L49] 1 i++ VAL [A={3:0}, N=7, counter=14, i=4, tmp=14] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, N=7, counter=0, i=3, tmp=0] [L62] 2 i++ VAL [A={3:0}, N=7, counter=0, i=4, tmp=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=7, counter=-4, i=4, tmp=-4] [L49] 1 i++ VAL [A={3:0}, N=7, counter=-4, i=5, tmp=-4] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, N=7, counter=0, i=4, tmp=0] [L62] 2 i++ VAL [A={3:0}, N=7, counter=0, i=5, tmp=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, N=7, counter=-11, i=5, tmp=-11] [L62] 2 i++ VAL [A={3:0}, N=7, counter=-11, i=6, tmp=-11] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=7, counter=11, i=5, tmp=11] [L49] 1 i++ VAL [A={3:0}, N=7, counter=11, i=6, tmp=11] [L67] 2 counter = tmp VAL [A={3:0}, N=7, counter=-11, i=6, tmp=-11] [L62] 2 i++ VAL [A={3:0}, N=7, counter=-11, i=7, tmp=-11] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=7, counter=-11, i=6, tmp=-11] [L49] 1 i++ VAL [A={3:0}, N=7, counter=-11, i=7, tmp=-11] [L62] COND FALSE 2 !(i