/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 DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT -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-06 03:40:58,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 03:40:58,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 03:40:58,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 03:40:58,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 03:40:58,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 03:40:58,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 03:40:58,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 03:40:58,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 03:40:58,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 03:40:58,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 03:40:58,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 03:40:58,336 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 03:40:58,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 03:40:58,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 03:40:58,338 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 03:40:58,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 03:40:58,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 03:40:58,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 03:40:58,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 03:40:58,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 03:40:58,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 03:40:58,340 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 03:40:58,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 03:40:58,340 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 03:40:58,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 03:40:58,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 03:40:58,340 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 03:40:58,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 03:40:58,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 03:40:58,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 03:40:58,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 03:40:58,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 03:40:58,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 03:40:58,342 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 03:40:58,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 03:40:58,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 03:40:58,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 03:40:58,343 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 03:40:58,343 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 -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT [2024-05-06 03:40:58,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 03:40:58,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 03:40:58,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 03:40:58,608 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 03:40:58,608 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 03:40:58,609 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-06 03:40:59,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 03:40:59,808 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 03:40:59,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-05-06 03:40:59,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/933ffa4ec/865ac38525c84f8983f34688324b6e03/FLAG4770973a5 [2024-05-06 03:40:59,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/933ffa4ec/865ac38525c84f8983f34688324b6e03 [2024-05-06 03:40:59,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 03:40:59,833 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 03:40:59,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 03:40:59,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 03:40:59,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 03:40:59,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 03:40:59" (1/1) ... [2024-05-06 03:40:59,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4381f571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:40:59, skipping insertion in model container [2024-05-06 03:40:59,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 03:40:59" (1/1) ... [2024-05-06 03:40:59,863 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 03:41:00,014 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-06 03:41:00,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 03:41:00,035 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 03:41:00,061 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-06 03:41:00,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 03:41:00,075 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 03:41:00,075 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 03:41:00,081 INFO L206 MainTranslator]: Completed translation [2024-05-06 03:41:00,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:41:00 WrapperNode [2024-05-06 03:41:00,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 03:41:00,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 03:41:00,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 03:41:00,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 03:41:00,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:41:00" (1/1) ... [2024-05-06 03:41:00,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:41:00" (1/1) ... [2024-05-06 03:41:00,123 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 148 [2024-05-06 03:41:00,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 03:41:00,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 03:41:00,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 03:41:00,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 03:41:00,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:41:00" (1/1) ... [2024-05-06 03:41:00,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:41:00" (1/1) ... [2024-05-06 03:41:00,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:41:00" (1/1) ... [2024-05-06 03:41:00,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:41:00" (1/1) ... [2024-05-06 03:41:00,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:41:00" (1/1) ... [2024-05-06 03:41:00,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:41:00" (1/1) ... [2024-05-06 03:41:00,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:41:00" (1/1) ... [2024-05-06 03:41:00,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:41:00" (1/1) ... [2024-05-06 03:41:00,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 03:41:00,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 03:41:00,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 03:41:00,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 03:41:00,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:41:00" (1/1) ... [2024-05-06 03:41:00,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 03:41:00,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 03:41:00,199 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-06 03:41:00,207 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-06 03:41:00,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 03:41:00,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 03:41:00,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 03:41:00,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 03:41:00,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-06 03:41:00,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-06 03:41:00,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-06 03:41:00,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-06 03:41:00,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 03:41:00,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 03:41:00,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 03:41:00,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-06 03:41:00,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 03:41:00,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 03:41:00,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 03:41:00,264 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 03:41:00,347 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 03:41:00,349 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 03:41:00,568 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 03:41:00,661 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 03:41:00,661 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-06 03:41:00,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 03:41:00 BoogieIcfgContainer [2024-05-06 03:41:00,663 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 03:41:00,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 03:41:00,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 03:41:00,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 03:41:00,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 03:40:59" (1/3) ... [2024-05-06 03:41:00,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729c87ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 03:41:00, skipping insertion in model container [2024-05-06 03:41:00,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 03:41:00" (2/3) ... [2024-05-06 03:41:00,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729c87ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 03:41:00, skipping insertion in model container [2024-05-06 03:41:00,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 03:41:00" (3/3) ... [2024-05-06 03:41:00,668 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-05-06 03:41:00,674 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 03:41:00,681 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 03:41:00,681 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 03:41:00,681 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 03:41:00,727 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-06 03:41:00,791 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 03:41:00,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 03:41:00,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 03:41:00,810 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-06 03:41:00,837 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-06 03:41:00,850 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 03:41:00,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 03:41:00,864 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 03:41:00,871 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;@14940ec5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 03:41:00,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-06 03:41:01,160 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-06 03:41:01,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1427562494, now seen corresponding path program 1 times [2024-05-06 03:41:01,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:01,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:01,495 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-06 03:41:01,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:01,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:01,573 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-06 03:41:01,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 03:41:01,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 03:41:01,696 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-06 03:41:01,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1567321929, now seen corresponding path program 1 times [2024-05-06 03:41:01,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:01,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:02,057 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-06 03:41:02,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:02,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:02,201 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-06 03:41:02,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 03:41:02,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-06 03:41:02,402 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-06 03:41:02,503 INFO L85 PathProgramCache]: Analyzing trace with hash -643313453, now seen corresponding path program 1 times [2024-05-06 03:41:02,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:02,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:02,743 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-06 03:41:02,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:02,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:02,861 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-06 03:41:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1532119857, now seen corresponding path program 2 times [2024-05-06 03:41:02,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:02,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:03,022 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-06 03:41:03,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:03,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:03,142 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-06 03:41:03,223 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-06 03:41:03,278 INFO L85 PathProgramCache]: Analyzing trace with hash -643313915, now seen corresponding path program 1 times [2024-05-06 03:41:03,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:03,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:03,374 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-06 03:41:03,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:03,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:03,507 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-06 03:41:03,521 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-06 03:41:03,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 03:41:03,522 INFO L85 PathProgramCache]: Analyzing trace with hash 175241813, now seen corresponding path program 1 times [2024-05-06 03:41:03,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 03:41:03,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606999799] [2024-05-06 03:41:03,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:03,632 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-06 03:41:03,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 03:41:03,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606999799] [2024-05-06 03:41:03,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606999799] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 03:41:03,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298926307] [2024-05-06 03:41:03,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:03,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 03:41:03,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 03:41:03,666 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-06 03:41:03,721 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-06 03:41:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:03,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-06 03:41:03,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 03:41:03,877 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-06 03:41:03,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 03:41:03,983 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-06 03:41:03,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298926307] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-06 03:41:03,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-06 03:41:03,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2024-05-06 03:41:03,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542769610] [2024-05-06 03:41:03,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 03:41:04,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 03:41:04,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 03:41:04,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 03:41:04,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-05-06 03:41:04,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 03:41:04,005 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 03:41:04,005 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-06 03:41:04,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 03:41:04,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 03:41:04,086 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-06 03:41:04,281 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,SelfDestructingSolverStorable10 [2024-05-06 03:41:04,281 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-06 03:41:04,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 03:41:04,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2045221921, now seen corresponding path program 1 times [2024-05-06 03:41:04,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 03:41:04,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518406159] [2024-05-06 03:41:04,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:04,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:04,443 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-06 03:41:04,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 03:41:04,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518406159] [2024-05-06 03:41:04,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518406159] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 03:41:04,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65227783] [2024-05-06 03:41:04,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:04,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 03:41:04,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 03:41:04,451 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-06 03:41:04,502 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-06 03:41:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:04,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-06 03:41:04,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 03:41:04,729 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-06 03:41:04,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 03:41:04,877 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-06 03:41:04,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65227783] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 03:41:04,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 03:41:04,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-05-06 03:41:04,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801661637] [2024-05-06 03:41:04,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 03:41:04,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-05-06 03:41:04,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 03:41:04,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-05-06 03:41:04,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-05-06 03:41:04,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 03:41:04,882 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 03:41:04,882 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-06 03:41:04,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 03:41:04,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 03:41:05,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 03:41:05,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 03:41:05,070 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-06 03:41:05,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 03:41:05,268 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-06 03:41:05,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 03:41:05,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1897562747, now seen corresponding path program 2 times [2024-05-06 03:41:05,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 03:41:05,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649683418] [2024-05-06 03:41:05,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:05,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:05,448 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-06 03:41:05,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 03:41:05,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649683418] [2024-05-06 03:41:05,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649683418] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 03:41:05,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731639447] [2024-05-06 03:41:05,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-06 03:41:05,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 03:41:05,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 03:41:05,450 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-06 03:41:05,476 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-06 03:41:05,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-06 03:41:05,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 03:41:05,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-06 03:41:05,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 03:41:05,658 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-06 03:41:05,658 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 03:41:05,752 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-06 03:41:05,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731639447] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 03:41:05,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 03:41:05,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 22 [2024-05-06 03:41:05,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322388606] [2024-05-06 03:41:05,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 03:41:05,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-06 03:41:05,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 03:41:05,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-06 03:41:05,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-05-06 03:41:05,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 03:41:05,754 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 03:41:05,754 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-06 03:41:05,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 03:41:05,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 03:41:05,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 03:41:06,491 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-06 03:41:06,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1139534935, now seen corresponding path program 1 times [2024-05-06 03:41:06,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:06,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:06,869 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-06 03:41:06,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:06,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:07,016 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-06 03:41:07,061 INFO L85 PathProgramCache]: Analyzing trace with hash 965845037, now seen corresponding path program 2 times [2024-05-06 03:41:07,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:07,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:07,204 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-06 03:41:07,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:07,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:07,363 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-06 03:41:07,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 03:41:07,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 03:41:07,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-06 03:41:07,489 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-06 03:41:07,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-05-06 03:41:07,672 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-06 03:41:07,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 03:41:07,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1024821117, now seen corresponding path program 3 times [2024-05-06 03:41:07,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 03:41:07,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156312419] [2024-05-06 03:41:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:07,902 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-06 03:41:07,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 03:41:07,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156312419] [2024-05-06 03:41:07,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156312419] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 03:41:07,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207985181] [2024-05-06 03:41:07,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-06 03:41:07,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 03:41:07,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 03:41:07,917 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-06 03:41:07,998 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-06 03:41:08,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-05-06 03:41:08,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 03:41:08,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 14 conjunts are in the unsatisfiable core [2024-05-06 03:41:08,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 03:41:08,461 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-06 03:41:08,461 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 03:41:08,774 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-06 03:41:08,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207985181] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 03:41:08,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 03:41:08,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2024-05-06 03:41:08,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444647924] [2024-05-06 03:41:08,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 03:41:08,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-06 03:41:08,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 03:41:08,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-06 03:41:08,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2024-05-06 03:41:08,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 03:41:08,777 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 03:41:08,777 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-06 03:41:08,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 03:41:08,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 03:41:08,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-06 03:41:08,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 03:41:09,209 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-06 03:41:09,311 INFO L85 PathProgramCache]: Analyzing trace with hash 407101555, now seen corresponding path program 3 times [2024-05-06 03:41:09,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:09,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:09,628 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-06 03:41:09,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:09,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:09,798 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-06 03:41:09,835 INFO L85 PathProgramCache]: Analyzing trace with hash -264753263, now seen corresponding path program 4 times [2024-05-06 03:41:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:09,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:10,027 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-06 03:41:10,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:10,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:10,222 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-06 03:41:10,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 03:41:10,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 03:41:10,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-06 03:41:10,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 03:41:10,267 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-06 03:41:10,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable17 [2024-05-06 03:41:10,465 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-06 03:41:10,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 03:41:10,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1881657625, now seen corresponding path program 4 times [2024-05-06 03:41:10,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 03:41:10,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026560180] [2024-05-06 03:41:10,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:10,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:10,849 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-06 03:41:10,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 03:41:10,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026560180] [2024-05-06 03:41:10,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026560180] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 03:41:10,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394153228] [2024-05-06 03:41:10,850 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-06 03:41:10,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 03:41:10,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 03:41:10,851 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-06 03:41:10,856 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-06 03:41:10,977 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-06 03:41:10,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 03:41:10,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-06 03:41:10,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 03:41:11,390 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-06 03:41:11,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 03:41:11,736 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-06 03:41:11,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394153228] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 03:41:11,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 03:41:11,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 46 [2024-05-06 03:41:11,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866346013] [2024-05-06 03:41:11,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 03:41:11,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-05-06 03:41:11,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 03:41:11,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-05-06 03:41:11,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=1737, Unknown=0, NotChecked=0, Total=2070 [2024-05-06 03:41:11,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 03:41:11,739 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 03:41:11,739 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-06 03:41:11,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 03:41:11,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 03:41:11,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-06 03:41:11,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-06 03:41:11,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 03:41:12,137 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-06 03:41:12,234 INFO L85 PathProgramCache]: Analyzing trace with hash 384039055, now seen corresponding path program 5 times [2024-05-06 03:41:12,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:12,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 03:41:12,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 03:41:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 03:41:12,404 INFO L85 PathProgramCache]: Analyzing trace with hash -979690763, now seen corresponding path program 6 times [2024-05-06 03:41:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:12,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 03:41:12,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 03:41:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 03:41:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 03:41:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 03:41:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-06 03:41:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 03:41:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 03:41:12,538 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-06 03:41:12,729 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,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24 [2024-05-06 03:41:12,730 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-06 03:41:12,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 03:41:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1318370997, now seen corresponding path program 5 times [2024-05-06 03:41:12,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 03:41:12,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946751315] [2024-05-06 03:41:12,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:12,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:13,051 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-06 03:41:13,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 03:41:13,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946751315] [2024-05-06 03:41:13,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946751315] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 03:41:13,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715415631] [2024-05-06 03:41:13,052 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-06 03:41:13,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 03:41:13,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 03:41:13,053 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-06 03:41:13,055 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-06 03:41:13,173 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-05-06 03:41:13,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 03:41:13,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-06 03:41:13,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 03:41:13,534 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-06 03:41:13,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 03:41:13,689 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-06 03:41:13,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715415631] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 03:41:13,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 03:41:13,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 8] total 42 [2024-05-06 03:41:13,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370132073] [2024-05-06 03:41:13,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 03:41:13,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-05-06 03:41:13,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 03:41:13,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-05-06 03:41:13,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1567, Unknown=0, NotChecked=0, Total=1722 [2024-05-06 03:41:13,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 03:41:13,692 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 03:41:13,692 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-06 03:41:13,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 03:41:13,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 03:41:13,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-06 03:41:13,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-06 03:41:13,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-06 03:41:13,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 03:41:15,776 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-06 03:41:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash -676286371, now seen corresponding path program 7 times [2024-05-06 03:41:15,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:17,037 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-06 03:41:17,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:17,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:17,423 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-06 03:41:17,463 INFO L85 PathProgramCache]: Analyzing trace with hash 509959411, now seen corresponding path program 8 times [2024-05-06 03:41:17,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:17,837 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-06 03:41:17,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:17,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:18,226 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-06 03:41:18,354 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-06 03:41:18,423 INFO L85 PathProgramCache]: Analyzing trace with hash -840011657, now seen corresponding path program 9 times [2024-05-06 03:41:18,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:18,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:18,891 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-06 03:41:18,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:19,289 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-06 03:41:19,317 INFO L85 PathProgramCache]: Analyzing trace with hash -270557159, now seen corresponding path program 10 times [2024-05-06 03:41:19,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:19,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 101 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 03:41:19,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:19,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 101 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 03:41:20,115 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-06 03:41:20,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1297422315, now seen corresponding path program 11 times [2024-05-06 03:41:20,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:20,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:20,956 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-06 03:41:20,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:20,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:21,436 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-06 03:41:21,537 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-06 03:41:21,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1626090829, now seen corresponding path program 12 times [2024-05-06 03:41:21,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:21,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:22,166 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-06 03:41:22,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:22,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:22,632 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-06 03:41:22,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1130791433, now seen corresponding path program 13 times [2024-05-06 03:41:22,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:22,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:23,079 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-06 03:41:23,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:23,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:23,552 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-06 03:41:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 03:41:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 03:41:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-06 03:41:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 03:41:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 03:41:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-05-06 03:41:23,612 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-06 03:41:23,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable25,SelfDestructingSolverStorable36,SelfDestructingSolverStorable26,SelfDestructingSolverStorable37,SelfDestructingSolverStorable27,SelfDestructingSolverStorable38,SelfDestructingSolverStorable28,SelfDestructingSolverStorable39 [2024-05-06 03:41:23,797 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-06 03:41:23,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 03:41:23,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1762581039, now seen corresponding path program 6 times [2024-05-06 03:41:23,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 03:41:23,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895413066] [2024-05-06 03:41:23,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:23,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:24,219 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-06 03:41:24,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 03:41:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895413066] [2024-05-06 03:41:24,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895413066] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 03:41:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481475651] [2024-05-06 03:41:24,219 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-06 03:41:24,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 03:41:24,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 03:41:24,232 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-06 03:41:24,264 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-06 03:41:24,541 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-05-06 03:41:24,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 03:41:24,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 36 conjunts are in the unsatisfiable core [2024-05-06 03:41:24,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 03:41:25,160 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-06 03:41:25,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 03:41:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 222 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 03:41:25,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481475651] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 03:41:25,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 03:41:25,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 30] total 73 [2024-05-06 03:41:25,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464101967] [2024-05-06 03:41:25,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 03:41:25,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-05-06 03:41:25,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 03:41:25,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-05-06 03:41:25,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=690, Invalid=4566, Unknown=0, NotChecked=0, Total=5256 [2024-05-06 03:41:25,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 03:41:25,796 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 03:41:25,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 6.054794520547945) internal successors, (442), 73 states have internal predecessors, (442), 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-06 03:41:25,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 03:41:25,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 03:41:25,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-06 03:41:25,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-06 03:41:25,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-06 03:41:25,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2024-05-06 03:41:25,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 03:41:26,786 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-06 03:41:26,866 INFO L85 PathProgramCache]: Analyzing trace with hash -654080591, now seen corresponding path program 14 times [2024-05-06 03:41:26,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:26,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 03:41:26,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 03:41:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 03:41:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1198338591, now seen corresponding path program 15 times [2024-05-06 03:41:27,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:27,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 03:41:27,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 03:41:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 03:41:27,220 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-06 03:41:27,299 INFO L85 PathProgramCache]: Analyzing trace with hash -191301941, now seen corresponding path program 16 times [2024-05-06 03:41:27,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:27,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 03:41:27,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 03:41:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 03:41:27,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1635392443, now seen corresponding path program 17 times [2024-05-06 03:41:27,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:27,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 03:41:27,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 03:41:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 03:41:27,784 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-06 03:41:27,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2003685057, now seen corresponding path program 18 times [2024-05-06 03:41:27,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:27,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:28,763 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-06 03:41:28,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:28,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:29,108 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-06 03:41:29,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-05-06 03:41:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1371404193, now seen corresponding path program 19 times [2024-05-06 03:41:29,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:29,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 169 proven. 243 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-06 03:41:29,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:29,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 169 proven. 243 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-06 03:41:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash -436142557, now seen corresponding path program 20 times [2024-05-06 03:41:29,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:29,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 169 proven. 243 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-06 03:41:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:30,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 03:41:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 169 proven. 243 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-06 03:41:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 03:41:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 03:41:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-06 03:41:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 03:41:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-06 03:41:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-05-06 03:41:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-06 03:41:30,680 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-06 03:41:30,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 03:41:30,881 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-06 03:41:30,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 03:41:30,881 INFO L85 PathProgramCache]: Analyzing trace with hash 778376027, now seen corresponding path program 7 times [2024-05-06 03:41:30,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 03:41:30,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724044651] [2024-05-06 03:41:30,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 03:41:30,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 03:41:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 03:41:30,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 03:41:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 03:41:31,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 03:41:31,003 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 03:41:31,004 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-06 03:41:31,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-06 03:41:31,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-06 03:41:31,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-06 03:41:31,009 INFO L448 BasicCegarLoop]: Path program histogram: [20, 7, 2, 1, 1, 1, 1] [2024-05-06 03:41:31,012 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 03:41:31,012 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 03:41:31,064 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2024-05-06 03:41:31,065 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc15 [2024-05-06 03:41:31,065 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-06 03:41:31,066 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-06 03:41:31,066 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-06 03:41:31,066 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-06 03:41:31,067 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-06 03:41:31,067 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-06 03:41:31,068 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2024-05-06 03:41:31,068 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-06 03:41:31,068 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret8 [2024-05-06 03:41:31,068 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 03:41:31,069 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2024-05-06 03:41:31,069 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2024-05-06 03:41:31,073 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-06 03:41:31,073 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-06 03:41:31,073 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2024-05-06 03:41:31,073 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated [2024-05-06 03:41:31,073 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated [2024-05-06 03:41:31,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 03:41:31 BasicIcfg [2024-05-06 03:41:31,087 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 03:41:31,087 INFO L158 Benchmark]: Toolchain (without parser) took 31253.86ms. Allocated memory was 237.0MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 167.1MB in the beginning and 952.7MB in the end (delta: -785.6MB). Peak memory consumption was 245.4MB. Max. memory is 8.0GB. [2024-05-06 03:41:31,087 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 237.0MB. Free memory is still 206.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 03:41:31,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.07ms. Allocated memory is still 237.0MB. Free memory was 166.8MB in the beginning and 155.0MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-06 03:41:31,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.28ms. Allocated memory is still 237.0MB. Free memory was 155.0MB in the beginning and 152.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 03:41:31,088 INFO L158 Benchmark]: Boogie Preprocessor took 30.05ms. Allocated memory is still 237.0MB. Free memory was 152.9MB in the beginning and 151.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 03:41:31,088 INFO L158 Benchmark]: RCFGBuilder took 508.34ms. Allocated memory is still 237.0MB. Free memory was 151.4MB in the beginning and 193.0MB in the end (delta: -41.7MB). Peak memory consumption was 23.6MB. Max. memory is 8.0GB. [2024-05-06 03:41:31,088 INFO L158 Benchmark]: TraceAbstraction took 30422.50ms. Allocated memory was 237.0MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 192.0MB in the beginning and 952.7MB in the end (delta: -760.7MB). Peak memory consumption was 269.0MB. Max. memory is 8.0GB. [2024-05-06 03:41:31,089 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.45ms. Allocated memory is still 237.0MB. Free memory is still 206.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.07ms. Allocated memory is still 237.0MB. Free memory was 166.8MB in the beginning and 155.0MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.28ms. Allocated memory is still 237.0MB. Free memory was 155.0MB in the beginning and 152.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.05ms. Allocated memory is still 237.0MB. Free memory was 152.9MB in the beginning and 151.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 508.34ms. Allocated memory is still 237.0MB. Free memory was 151.4MB in the beginning and 193.0MB in the end (delta: -41.7MB). Peak memory consumption was 23.6MB. Max. memory is 8.0GB. * TraceAbstraction took 30422.50ms. Allocated memory was 237.0MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 192.0MB in the beginning and 952.7MB in the end (delta: -760.7MB). Peak memory consumption was 269.0MB. 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: 3989, independent: 3377, independent conditional: 2963, independent unconditional: 414, dependent: 612, dependent conditional: 607, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3425, independent: 3377, independent conditional: 2963, independent unconditional: 414, dependent: 48, dependent conditional: 43, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3425, independent: 3377, independent conditional: 2963, independent unconditional: 414, dependent: 48, dependent conditional: 43, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3425, independent: 3377, independent conditional: 2963, independent unconditional: 414, dependent: 48, dependent conditional: 43, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3537, independent: 3377, independent conditional: 1186, independent unconditional: 2191, dependent: 160, dependent conditional: 104, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3537, independent: 3377, independent conditional: 1029, independent unconditional: 2348, dependent: 160, dependent conditional: 42, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3537, independent: 3377, independent conditional: 1029, independent unconditional: 2348, dependent: 160, dependent conditional: 42, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 253, independent: 235, independent conditional: 0, independent unconditional: 235, dependent: 18, dependent conditional: 12, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 253, independent: 235, independent conditional: 0, independent unconditional: 235, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 12, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 12, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 93, dependent conditional: 36, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3537, independent: 3142, independent conditional: 1029, independent unconditional: 2113, dependent: 142, dependent conditional: 30, dependent unconditional: 112, unknown: 253, unknown conditional: 12, unknown unconditional: 241] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 235, Positive conditional cache size: 0, Positive unconditional cache size: 235, Negative cache size: 18, Negative conditional cache size: 12, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 219, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3537, independent: 3377, independent conditional: 1186, independent unconditional: 2191, dependent: 160, dependent conditional: 104, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3537, independent: 3377, independent conditional: 1029, independent unconditional: 2348, dependent: 160, dependent conditional: 42, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3537, independent: 3377, independent conditional: 1029, independent unconditional: 2348, dependent: 160, dependent conditional: 42, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 253, independent: 235, independent conditional: 0, independent unconditional: 235, dependent: 18, dependent conditional: 12, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 253, independent: 235, independent conditional: 0, independent unconditional: 235, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 12, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 12, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 93, dependent conditional: 36, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3537, independent: 3142, independent conditional: 1029, independent unconditional: 2113, dependent: 142, dependent conditional: 30, dependent unconditional: 112, unknown: 253, unknown conditional: 12, unknown unconditional: 241] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 235, Positive conditional cache size: 0, Positive unconditional cache size: 235, Negative cache size: 18, Negative conditional cache size: 12, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 219 ], 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=3, i=1, tmp=3] [L49] 1 i++ VAL [A={-3:0}, N=7, counter=3, i=2, tmp=3] [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=7, i=2, tmp=7] [L49] 1 i++ VAL [A={-3:0}, N=7, counter=7, i=3, 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=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=9, i=5, tmp=9] [L62] 2 i++ VAL [A={-3:0}, N=7, counter=9, i=6, 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]); [L54] 1 counter = tmp VAL [A={-3:0}, N=7, counter=-9, i=5, tmp=-9] [L49] 1 i++ VAL [A={-3:0}, N=7, counter=-9, i=6, tmp=-9] [L67] 2 counter = tmp VAL [A={-3:0}, N=7, counter=17, i=6, tmp=17] [L62] 2 i++ VAL [A={-3:0}, N=7, counter=17, i=7, tmp=17] [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=6, tmp=9] [L49] 1 i++ VAL [A={-3:0}, N=7, counter=9, i=7, tmp=9] [L62] COND FALSE 2 !(i