/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 SLEEP_SET -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-04 07:18:16,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-04 07:18:17,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-04 07:18:17,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-04 07:18:17,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-04 07:18:17,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-04 07:18:17,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-04 07:18:17,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-04 07:18:17,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-04 07:18:17,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-04 07:18:17,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-04 07:18:17,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-04 07:18:17,045 INFO L153 SettingsManager]: * Use SBE=true [2024-04-04 07:18:17,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-04 07:18:17,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-04 07:18:17,046 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-04 07:18:17,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-04 07:18:17,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-04 07:18:17,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-04 07:18:17,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-04 07:18:17,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-04 07:18:17,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-04 07:18:17,047 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-04 07:18:17,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-04 07:18:17,048 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-04 07:18:17,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-04 07:18:17,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-04 07:18:17,048 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-04 07:18:17,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-04 07:18:17,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 07:18:17,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-04 07:18:17,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-04 07:18:17,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-04 07:18:17,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-04 07:18:17,050 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-04 07:18:17,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-04 07:18:17,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-04 07:18:17,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-04 07:18:17,050 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-04 07:18:17,050 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 -> SLEEP_SET [2024-04-04 07:18:17,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-04 07:18:17,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-04 07:18:17,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-04 07:18:17,285 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-04 07:18:17,286 INFO L274 PluginConnector]: CDTParser initialized [2024-04-04 07:18:17,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2024-04-04 07:18:18,212 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-04 07:18:18,360 INFO L384 CDTParser]: Found 1 translation units. [2024-04-04 07:18:18,360 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2024-04-04 07:18:18,365 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/adb029008/0d17fac42c234c50aa2d2593ced517fb/FLAG1f72dfce9 [2024-04-04 07:18:18,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/adb029008/0d17fac42c234c50aa2d2593ced517fb [2024-04-04 07:18:18,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-04 07:18:18,385 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-04 07:18:18,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-04 07:18:18,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-04 07:18:18,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-04 07:18:18,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 07:18:18" (1/1) ... [2024-04-04 07:18:18,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77709a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:18:18, skipping insertion in model container [2024-04-04 07:18:18,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 07:18:18" (1/1) ... [2024-04-04 07:18:18,408 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-04 07:18:18,540 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/unroll-cond-4.wvr.c[2808,2821] [2024-04-04 07:18:18,546 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 07:18:18,552 INFO L202 MainTranslator]: Completed pre-run [2024-04-04 07:18:18,575 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/unroll-cond-4.wvr.c[2808,2821] [2024-04-04 07:18:18,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 07:18:18,593 INFO L206 MainTranslator]: Completed translation [2024-04-04 07:18:18,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:18:18 WrapperNode [2024-04-04 07:18:18,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-04 07:18:18,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-04 07:18:18,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-04 07:18:18,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-04 07:18:18,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:18:18" (1/1) ... [2024-04-04 07:18:18,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:18:18" (1/1) ... [2024-04-04 07:18:18,658 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 186 [2024-04-04 07:18:18,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-04 07:18:18,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-04 07:18:18,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-04 07:18:18,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-04 07:18:18,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:18:18" (1/1) ... [2024-04-04 07:18:18,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:18:18" (1/1) ... [2024-04-04 07:18:18,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:18:18" (1/1) ... [2024-04-04 07:18:18,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:18:18" (1/1) ... [2024-04-04 07:18:18,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:18:18" (1/1) ... [2024-04-04 07:18:18,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:18:18" (1/1) ... [2024-04-04 07:18:18,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:18:18" (1/1) ... [2024-04-04 07:18:18,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:18:18" (1/1) ... [2024-04-04 07:18:18,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-04 07:18:18,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-04 07:18:18,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-04 07:18:18,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-04 07:18:18,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:18:18" (1/1) ... [2024-04-04 07:18:18,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 07:18:18,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 07:18:18,725 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-04-04 07:18:18,731 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-04-04 07:18:18,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-04 07:18:18,761 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-04 07:18:18,761 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-04 07:18:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-04 07:18:18,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-04 07:18:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-04 07:18:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-04 07:18:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-04 07:18:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-04-04 07:18:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-04 07:18:18,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-04 07:18:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-04 07:18:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-04 07:18:18,765 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-04 07:18:18,870 INFO L241 CfgBuilder]: Building ICFG [2024-04-04 07:18:18,872 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-04 07:18:19,116 INFO L282 CfgBuilder]: Performing block encoding [2024-04-04 07:18:19,128 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-04 07:18:19,129 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-04-04 07:18:19,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 07:18:19 BoogieIcfgContainer [2024-04-04 07:18:19,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-04 07:18:19,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-04 07:18:19,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-04 07:18:19,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-04 07:18:19,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.04 07:18:18" (1/3) ... [2024-04-04 07:18:19,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57442adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 07:18:19, skipping insertion in model container [2024-04-04 07:18:19,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:18:18" (2/3) ... [2024-04-04 07:18:19,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57442adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 07:18:19, skipping insertion in model container [2024-04-04 07:18:19,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 07:18:19" (3/3) ... [2024-04-04 07:18:19,138 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2024-04-04 07:18:19,143 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-04 07:18:19,150 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-04 07:18:19,150 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-04 07:18:19,150 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-04 07:18:19,230 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-04 07:18:19,266 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-04 07:18:19,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-04 07:18:19,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 07:18:19,270 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-04-04 07:18:19,279 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-04-04 07:18:19,303 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-04 07:18:19,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 07:18:19,312 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-04 07:18:19,317 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;@1719edf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-04 07:18:19,317 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-04 07:18:19,561 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-04-04 07:18:19,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 07:18:19,564 INFO L85 PathProgramCache]: Analyzing trace with hash -124361033, now seen corresponding path program 1 times [2024-04-04 07:18:19,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 07:18:19,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690158122] [2024-04-04 07:18:19,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 07:18:19,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 07:18:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 07:18:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-04 07:18:19,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 07:18:19,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690158122] [2024-04-04 07:18:19,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690158122] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 07:18:19,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 07:18:19,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-04 07:18:19,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167045053] [2024-04-04 07:18:19,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 07:18:19,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-04 07:18:19,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 07:18:19,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-04 07:18:19,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-04 07:18:19,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:19,899 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 07:18:19,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 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-04-04 07:18:19,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:19,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:20,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-04 07:18:20,001 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-04-04 07:18:20,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 07:18:20,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2010415305, now seen corresponding path program 1 times [2024-04-04 07:18:20,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 07:18:20,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381813146] [2024-04-04 07:18:20,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 07:18:20,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 07:18:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 07:18:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 07:18:20,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 07:18:20,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381813146] [2024-04-04 07:18:20,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381813146] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 07:18:20,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876236416] [2024-04-04 07:18:20,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 07:18:20,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 07:18:20,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 07:18:20,886 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-04-04 07:18:20,890 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-04-04 07:18:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 07:18:21,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjunts are in the unsatisfiable core [2024-04-04 07:18:21,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 07:18:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 07:18:21,227 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-04 07:18:21,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876236416] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 07:18:21,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-04 07:18:21,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-04-04 07:18:21,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476582070] [2024-04-04 07:18:21,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 07:18:21,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-04 07:18:21,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 07:18:21,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-04 07:18:21,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-04-04 07:18:21,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:21,233 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 07:18:21,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 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-04-04 07:18:21,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:21,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:21,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:21,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-04 07:18:21,475 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-04-04 07:18:21,663 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,SelfDestructingSolverStorable1 [2024-04-04 07:18:21,663 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-04-04 07:18:21,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 07:18:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1699666781, now seen corresponding path program 1 times [2024-04-04 07:18:21,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 07:18:21,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244799155] [2024-04-04 07:18:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 07:18:21,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 07:18:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 07:18:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-04 07:18:22,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 07:18:22,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244799155] [2024-04-04 07:18:22,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244799155] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 07:18:22,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208579820] [2024-04-04 07:18:22,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 07:18:22,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 07:18:22,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 07:18:22,096 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-04-04 07:18:22,098 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-04-04 07:18:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 07:18:22,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 37 conjunts are in the unsatisfiable core [2024-04-04 07:18:22,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 07:18:22,886 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 15 treesize of output 7 [2024-04-04 07:18:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 07:18:22,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 07:18:23,359 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-04-04 07:18:23,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-04-04 07:18:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 07:18:23,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208579820] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 07:18:23,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 07:18:23,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 18] total 41 [2024-04-04 07:18:23,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918250955] [2024-04-04 07:18:23,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 07:18:23,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-04-04 07:18:23,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 07:18:23,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-04-04 07:18:23,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1486, Unknown=0, NotChecked=0, Total=1640 [2024-04-04 07:18:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:23,970 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 07:18:23,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.439024390243903) internal successors, (387), 41 states have internal predecessors, (387), 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-04-04 07:18:23,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:23,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-04 07:18:23,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:25,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-04 07:18:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-04-04 07:18:25,790 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-04-04 07:18:25,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 07:18:25,989 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-04-04 07:18:25,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 07:18:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1110464735, now seen corresponding path program 1 times [2024-04-04 07:18:25,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 07:18:25,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167531018] [2024-04-04 07:18:25,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 07:18:25,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 07:18:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 07:18:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-04 07:18:27,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 07:18:27,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167531018] [2024-04-04 07:18:27,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167531018] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 07:18:27,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986406077] [2024-04-04 07:18:27,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 07:18:27,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 07:18:27,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 07:18:27,006 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-04-04 07:18:27,010 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-04-04 07:18:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 07:18:27,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 17 conjunts are in the unsatisfiable core [2024-04-04 07:18:27,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 07:18:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-04 07:18:27,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 07:18:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-04 07:18:29,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986406077] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 07:18:29,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 07:18:29,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 36 [2024-04-04 07:18:29,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382169826] [2024-04-04 07:18:29,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 07:18:29,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-04-04 07:18:29,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 07:18:29,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-04-04 07:18:29,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2024-04-04 07:18:29,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:29,057 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 07:18:29,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 12.416666666666666) internal successors, (447), 36 states have internal predecessors, (447), 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-04-04 07:18:29,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:29,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-04 07:18:29,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-04-04 07:18:29,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:33,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:33,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-04 07:18:33,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-04-04 07:18:33,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-04-04 07:18:33,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-04-04 07:18:33,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 07:18:33,864 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-04-04 07:18:33,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 07:18:33,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1013286976, now seen corresponding path program 2 times [2024-04-04 07:18:33,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 07:18:33,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187415724] [2024-04-04 07:18:33,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 07:18:33,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 07:18:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 07:18:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-04 07:18:36,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 07:18:36,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187415724] [2024-04-04 07:18:36,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187415724] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 07:18:36,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125383910] [2024-04-04 07:18:36,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-04 07:18:36,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 07:18:36,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 07:18:36,205 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-04-04 07:18:36,224 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-04-04 07:18:36,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-04 07:18:36,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 07:18:36,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 94 conjunts are in the unsatisfiable core [2024-04-04 07:18:36,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 07:18:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-04 07:18:37,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 07:18:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-04 07:18:41,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125383910] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 07:18:41,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 07:18:41,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 101 [2024-04-04 07:18:41,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880811718] [2024-04-04 07:18:41,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 07:18:41,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2024-04-04 07:18:41,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 07:18:41,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2024-04-04 07:18:41,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=797, Invalid=9303, Unknown=0, NotChecked=0, Total=10100 [2024-04-04 07:18:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:41,848 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 07:18:41,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 7.03960396039604) internal successors, (711), 101 states have internal predecessors, (711), 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-04-04 07:18:41,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:41,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-04 07:18:41,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-04-04 07:18:41,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-04-04 07:18:41,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 07:18:52,443 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (.cse0 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse7 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse3 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse5 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296) 1)) (.cse2 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse6 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1))) (and (< .cse0 .cse1) (< .cse2 (+ (mod (+ 7 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) .cse4) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse0 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 8) 4294967296) 1)) (< .cse5 19) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse0 .cse6) (< .cse2 .cse7) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) .cse4) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse7) (< .cse3 .cse7) (< .cse3 .cse6) (< (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse1) (< .cse5 .cse1) (< .cse2 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse6))) is different from false [2024-04-04 07:19:02,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:19:03,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:19:08,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:19:11,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:21:05,293 WARN L293 SmtUtils]: Spent 23.12s on a formula simplification. DAG size of input: 75 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 07:21:07,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:21:10,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:21:13,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:22:02,832 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse0 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1)) (.cse2 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse4 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) (and (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post6#1| 17) 4294967296) 1)) (< .cse1 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse0 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 19) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse1 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse0 .cse3) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< .cse2 .cse3) (< .cse4 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post6#1| 13) 4294967296) 1)) (< .cse4 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)))) is different from false [2024-04-04 07:22:31,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:23:19,325 WARN L293 SmtUtils]: Spent 11.71s on a formula simplification. DAG size of input: 64 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 07:24:26,498 WARN L293 SmtUtils]: Spent 14.61s on a formula simplification. DAG size of input: 60 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 07:24:28,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:24:30,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:24:32,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:24:34,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:25:19,552 WARN L293 SmtUtils]: Spent 14.27s on a formula simplification. DAG size of input: 60 DAG size of output: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 07:26:42,162 WARN L293 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 49 DAG size of output: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 07:29:40,345 WARN L293 SmtUtils]: Spent 31.58s on a formula simplification. DAG size of input: 90 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 07:29:43,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:29:45,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:29:48,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:31:46,911 WARN L293 SmtUtils]: Spent 14.10s on a formula simplification. DAG size of input: 71 DAG size of output: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 07:31:48,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:31:50,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:31:52,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:31:53,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:31:55,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:32:00,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:32:05,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:32:06,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:32:08,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:32:10,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 07:32:14,650 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse0 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1)) (.cse1 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse4 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) (and (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post6#1| 17) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< .cse2 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse0 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 19) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse2 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse0 .cse3) (< .cse4 .cse5) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< .cse1 .cse5) (< .cse1 .cse3) (< .cse4 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post6#1| 13) 4294967296) 1)) (< .cse4 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)))) is different from false [2024-04-04 07:32:18,898 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (.cse0 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse6 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse3 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296) 1)) (.cse2 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1))) (and (< .cse0 .cse1) (< .cse2 (+ (mod (+ 7 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) .cse4) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse0 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 8) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse0 .cse5) (< .cse2 .cse6) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) .cse4) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse6) (< .cse3 .cse6) (< .cse3 .cse5) (< (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse1) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) .cse1) (< .cse2 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse5))) is different from false [2024-04-04 07:32:24,922 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse6 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse1 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1)) (.cse3 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse0 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) (and (< .cse0 (+ (mod (+ 7 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse2 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 14) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 8) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 18) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 19) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse3 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse2 .cse4) (< .cse0 .cse5) (< .cse3 .cse6) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< .cse0 .cse6) (< .cse1 .cse5) (< .cse1 .cse4) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 6) 4294967296) 1)) (< .cse0 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 10) 4294967296) 1)))) is different from false Received shutdown request... [2024-04-04 07:32:49,921 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-04 07:32:49,923 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-04 07:32:49,921 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-04 07:32:50,053 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-04-04 07:32:50,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 07:32:50,245 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 266 known predicates. [2024-04-04 07:32:50,247 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-04-04 07:32:50,248 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-04-04 07:32:50,248 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-04-04 07:32:50,251 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-04-04 07:32:50,252 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-04 07:32:50,252 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-04 07:32:50,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.04 07:32:50 BasicIcfg [2024-04-04 07:32:50,254 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-04 07:32:50,254 INFO L158 Benchmark]: Toolchain (without parser) took 871869.54ms. Allocated memory was 158.3MB in the beginning and 640.7MB in the end (delta: 482.3MB). Free memory was 86.6MB in the beginning and 242.3MB in the end (delta: -155.8MB). Peak memory consumption was 327.4MB. Max. memory is 8.0GB. [2024-04-04 07:32:50,254 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 158.3MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-04 07:32:50,255 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.00ms. Allocated memory was 158.3MB in the beginning and 238.0MB in the end (delta: 79.7MB). Free memory was 86.3MB in the beginning and 203.7MB in the end (delta: -117.4MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. [2024-04-04 07:32:50,255 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.77ms. Allocated memory is still 238.0MB. Free memory was 203.7MB in the beginning and 201.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-04 07:32:50,255 INFO L158 Benchmark]: Boogie Preprocessor took 27.75ms. Allocated memory is still 238.0MB. Free memory was 201.6MB in the beginning and 200.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-04 07:32:50,255 INFO L158 Benchmark]: RCFGBuilder took 442.14ms. Allocated memory is still 238.0MB. Free memory was 200.0MB in the beginning and 179.6MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-04-04 07:32:50,255 INFO L158 Benchmark]: TraceAbstraction took 871120.73ms. Allocated memory was 238.0MB in the beginning and 640.7MB in the end (delta: 402.7MB). Free memory was 178.5MB in the beginning and 242.3MB in the end (delta: -63.8MB). Peak memory consumption was 339.3MB. Max. memory is 8.0GB. [2024-04-04 07:32:50,256 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 158.3MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.00ms. Allocated memory was 158.3MB in the beginning and 238.0MB in the end (delta: 79.7MB). Free memory was 86.3MB in the beginning and 203.7MB in the end (delta: -117.4MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.77ms. Allocated memory is still 238.0MB. Free memory was 203.7MB in the beginning and 201.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.75ms. Allocated memory is still 238.0MB. Free memory was 201.6MB in the beginning and 200.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 442.14ms. Allocated memory is still 238.0MB. Free memory was 200.0MB in the beginning and 179.6MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 871120.73ms. Allocated memory was 238.0MB in the beginning and 640.7MB in the end (delta: 402.7MB). Free memory was 178.5MB in the beginning and 242.3MB in the end (delta: -63.8MB). Peak memory consumption was 339.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 28266, independent: 21831, independent conditional: 20488, independent unconditional: 1343, dependent: 6435, dependent conditional: 5111, dependent unconditional: 1324, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21831, independent: 21831, independent conditional: 20488, independent unconditional: 1343, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21831, independent: 21831, independent conditional: 20488, independent unconditional: 1343, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21831, independent: 21831, independent conditional: 20488, independent unconditional: 1343, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21831, independent: 21831, independent conditional: 952, independent unconditional: 20879, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21831, independent: 21831, independent conditional: 946, independent unconditional: 20885, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21831, independent: 21831, independent conditional: 946, independent unconditional: 20885, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1833, independent: 1833, independent conditional: 7, independent unconditional: 1826, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1833, independent: 1833, independent conditional: 0, independent unconditional: 1833, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 21831, independent: 19998, independent conditional: 939, independent unconditional: 19059, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1833, unknown conditional: 7, unknown unconditional: 1826] , Statistics on independence cache: Total cache size (in pairs): 1833, Positive cache size: 1833, Positive conditional cache size: 7, Positive unconditional cache size: 1826, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21831, independent: 21831, independent conditional: 952, independent unconditional: 20879, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21831, independent: 21831, independent conditional: 946, independent unconditional: 20885, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21831, independent: 21831, independent conditional: 946, independent unconditional: 20885, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1833, independent: 1833, independent conditional: 7, independent unconditional: 1826, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1833, independent: 1833, independent conditional: 0, independent unconditional: 1833, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 21831, independent: 19998, independent conditional: 939, independent unconditional: 19059, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1833, unknown conditional: 7, unknown unconditional: 1826] , Statistics on independence cache: Total cache size (in pairs): 1833, Positive cache size: 1833, Positive conditional cache size: 7, Positive unconditional cache size: 1826, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6 ], Independence queries for same thread: 6435 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 266 known predicates. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 266 known predicates. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 266 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 338 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 871.0s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 855.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 317, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 1951 NumberOfCodeBlocks, 1951 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2699 ConstructedInterpolants, 34 QuantifiedInterpolants, 25233 SizeOfPredicates, 88 NumberOfNonLiveVariables, 1623 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 63/1257 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown