/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 IA --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-05 18:15:31,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-05 18:15:31,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-05 18:15:31,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-05 18:15:31,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-05 18:15:31,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-05 18:15:31,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-05 18:15:31,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-05 18:15:31,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-05 18:15:31,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-05 18:15:31,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-05 18:15:31,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-05 18:15:31,449 INFO L153 SettingsManager]: * Use SBE=true [2024-05-05 18:15:31,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-05 18:15:31,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-05 18:15:31,450 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-05 18:15:31,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-05 18:15:31,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-05 18:15:31,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-05 18:15:31,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-05 18:15:31,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-05 18:15:31,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-05 18:15:31,457 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-05 18:15:31,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-05 18:15:31,464 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-05 18:15:31,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-05 18:15:31,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-05 18:15:31,465 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-05 18:15:31,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-05 18:15:31,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 18:15:31,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-05 18:15:31,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-05 18:15:31,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-05 18:15:31,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-05 18:15:31,467 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-05 18:15:31,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-05 18:15:31,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-05 18:15:31,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-05 18:15:31,468 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-05 18:15:31,468 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 -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 [2024-05-05 18:15:31,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-05 18:15:31,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-05 18:15:31,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-05 18:15:31,715 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-05 18:15:31,715 INFO L274 PluginConnector]: CDTParser initialized [2024-05-05 18:15:31,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2024-05-05 18:15:32,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-05 18:15:33,098 INFO L384 CDTParser]: Found 1 translation units. [2024-05-05 18:15:33,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2024-05-05 18:15:33,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/37b5d48f5/04377cfab56c416ca69c89f37c619852/FLAG0ee4775ee [2024-05-05 18:15:33,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/37b5d48f5/04377cfab56c416ca69c89f37c619852 [2024-05-05 18:15:33,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-05 18:15:33,124 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-05 18:15:33,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-05 18:15:33,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-05 18:15:33,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-05 18:15:33,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 06:15:33" (1/1) ... [2024-05-05 18:15:33,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7523f633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:15:33, skipping insertion in model container [2024-05-05 18:15:33,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 06:15:33" (1/1) ... [2024-05-05 18:15:33,156 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-05 18:15:33,317 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-more-nonblocking-counter-alt2.wvr.c[2147,2160] [2024-05-05 18:15:33,321 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 18:15:33,328 INFO L202 MainTranslator]: Completed pre-run [2024-05-05 18:15:33,345 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-more-nonblocking-counter-alt2.wvr.c[2147,2160] [2024-05-05 18:15:33,346 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 18:15:33,352 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 18:15:33,353 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 18:15:33,359 INFO L206 MainTranslator]: Completed translation [2024-05-05 18:15:33,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:15:33 WrapperNode [2024-05-05 18:15:33,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-05 18:15:33,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-05 18:15:33,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-05 18:15:33,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-05 18:15:33,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:15:33" (1/1) ... [2024-05-05 18:15:33,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:15:33" (1/1) ... [2024-05-05 18:15:33,395 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2024-05-05 18:15:33,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-05 18:15:33,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-05 18:15:33,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-05 18:15:33,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-05 18:15:33,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:15:33" (1/1) ... [2024-05-05 18:15:33,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:15:33" (1/1) ... [2024-05-05 18:15:33,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:15:33" (1/1) ... [2024-05-05 18:15:33,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:15:33" (1/1) ... [2024-05-05 18:15:33,420 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:15:33" (1/1) ... [2024-05-05 18:15:33,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:15:33" (1/1) ... [2024-05-05 18:15:33,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:15:33" (1/1) ... [2024-05-05 18:15:33,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:15:33" (1/1) ... [2024-05-05 18:15:33,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-05 18:15:33,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-05 18:15:33,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-05 18:15:33,437 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-05 18:15:33,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:15:33" (1/1) ... [2024-05-05 18:15:33,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 18:15:33,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 18:15:33,469 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-05 18:15:33,497 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-05 18:15:33,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-05 18:15:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-05 18:15:33,527 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-05 18:15:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-05 18:15:33,527 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-05 18:15:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-05 18:15:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-05 18:15:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-05 18:15:33,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-05 18:15:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-05 18:15:33,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-05 18:15:33,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-05 18:15:33,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-05 18:15:33,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-05 18:15:33,531 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-05 18:15:33,640 INFO L241 CfgBuilder]: Building ICFG [2024-05-05 18:15:33,642 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-05 18:15:33,828 INFO L282 CfgBuilder]: Performing block encoding [2024-05-05 18:15:33,868 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-05 18:15:33,869 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-05 18:15:33,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 06:15:33 BoogieIcfgContainer [2024-05-05 18:15:33,870 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-05 18:15:33,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-05 18:15:33,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-05 18:15:33,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-05 18:15:33,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.05 06:15:33" (1/3) ... [2024-05-05 18:15:33,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ff78d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 06:15:33, skipping insertion in model container [2024-05-05 18:15:33,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 06:15:33" (2/3) ... [2024-05-05 18:15:33,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ff78d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 06:15:33, skipping insertion in model container [2024-05-05 18:15:33,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 06:15:33" (3/3) ... [2024-05-05 18:15:33,878 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-nonblocking-counter-alt2.wvr.c [2024-05-05 18:15:33,885 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-05 18:15:33,894 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-05 18:15:33,895 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-05 18:15:33,895 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-05 18:15:33,945 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-05 18:15:33,980 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 18:15:33,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 18:15:33,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 18:15:33,982 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-05 18:15:33,984 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-05 18:15:34,020 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 18:15:34,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 18:15:34,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 18:15:34,048 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;@64720a3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false [2024-05-05 18:15:34,048 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-05 18:15:34,151 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-05 18:15:34,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 18:15:34,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1170405292, now seen corresponding path program 1 times [2024-05-05 18:15:34,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 18:15:34,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517532064] [2024-05-05 18:15:34,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:15:34,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:15:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:15:34,378 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-05 18:15:34,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 18:15:34,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517532064] [2024-05-05 18:15:34,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517532064] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 18:15:34,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 18:15:34,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-05 18:15:34,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955116540] [2024-05-05 18:15:34,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 18:15:34,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-05 18:15:34,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 18:15:34,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-05 18:15:34,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-05 18:15:34,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:15:34,482 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 18:15:34,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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-05 18:15:34,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:15:34,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:15:34,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-05 18:15:34,523 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-05 18:15:34,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 18:15:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2044128722, now seen corresponding path program 1 times [2024-05-05 18:15:34,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 18:15:34,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056678585] [2024-05-05 18:15:34,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:15:34,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:15:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:15:34,964 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-05 18:15:34,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 18:15:34,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056678585] [2024-05-05 18:15:34,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056678585] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 18:15:34,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 18:15:34,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-05 18:15:34,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584740608] [2024-05-05 18:15:34,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 18:15:34,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-05 18:15:34,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 18:15:34,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-05 18:15:34,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-05 18:15:34,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:15:34,986 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 18:15:34,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-05 18:15:34,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:15:34,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:15:35,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:15:35,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-05 18:15:35,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-05 18:15:35,109 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-05 18:15:35,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 18:15:35,110 INFO L85 PathProgramCache]: Analyzing trace with hash 849842810, now seen corresponding path program 1 times [2024-05-05 18:15:35,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 18:15:35,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400084046] [2024-05-05 18:15:35,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:15:35,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:15:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:15:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 18:15:35,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 18:15:35,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400084046] [2024-05-05 18:15:35,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400084046] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 18:15:35,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750495521] [2024-05-05 18:15:35,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:15:35,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 18:15:35,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 18:15:35,606 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-05 18:15:35,627 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-05 18:15:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:15:35,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-05 18:15:35,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 18:15:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 18:15:35,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 18:15:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 18:15:36,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750495521] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 18:15:36,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 18:15:36,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2024-05-05 18:15:36,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713209108] [2024-05-05 18:15:36,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 18:15:36,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-05-05 18:15:36,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 18:15:36,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-05-05 18:15:36,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-05-05 18:15:36,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:15:36,550 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 18:15:36,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 20 states have internal predecessors, (108), 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-05 18:15:36,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:15:36,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-05 18:15:36,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:15:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:15:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-05 18:15:37,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-05 18:15:37,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-05 18:15:37,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-05 18:15:37,625 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-05 18:15:37,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 18:15:37,626 INFO L85 PathProgramCache]: Analyzing trace with hash -470519814, now seen corresponding path program 2 times [2024-05-05 18:15:37,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 18:15:37,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55768385] [2024-05-05 18:15:37,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:15:37,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:15:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:15:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 18:15:38,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 18:15:38,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55768385] [2024-05-05 18:15:38,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55768385] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 18:15:38,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110392570] [2024-05-05 18:15:38,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-05 18:15:38,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 18:15:38,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 18:15:38,960 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-05 18:15:38,985 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-05 18:15:39,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-05 18:15:39,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 18:15:39,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 30 conjunts are in the unsatisfiable core [2024-05-05 18:15:39,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 18:15:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 18:15:40,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 18:15:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 18:15:46,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110392570] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 18:15:46,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 18:15:46,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 20] total 52 [2024-05-05 18:15:46,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033979424] [2024-05-05 18:15:46,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 18:15:46,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-05-05 18:15:46,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 18:15:46,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-05-05 18:15:46,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=2224, Unknown=0, NotChecked=0, Total=2652 [2024-05-05 18:15:46,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:15:46,207 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 18:15:46,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.519230769230769) internal successors, (183), 52 states have internal predecessors, (183), 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-05 18:15:46,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:15:46,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-05 18:15:46,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-05 18:15:46,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:15:56,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:16:16,684 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-05-05 18:16:28,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:16:30,966 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-05-05 18:16:36,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-05 18:16:39,397 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-05-05 18:16:59,541 WARN L293 SmtUtils]: Spent 12.54s on a formula simplification. DAG size of input: 103 DAG size of output: 84 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:17:13,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:17:13,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-05 18:17:13,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-05 18:17:13,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-05-05 18:17:13,498 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-05 18:17:13,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 18:17:13,699 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-05 18:17:13,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 18:17:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash 884804186, now seen corresponding path program 3 times [2024-05-05 18:17:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 18:17:13,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143092085] [2024-05-05 18:17:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 18:17:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 18:17:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 18:17:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 46 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-05 18:17:19,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 18:17:19,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143092085] [2024-05-05 18:17:19,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143092085] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-05 18:17:19,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142400580] [2024-05-05 18:17:19,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-05 18:17:19,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 18:17:19,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 18:17:19,332 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-05 18:17:19,334 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-05 18:17:20,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-05-05 18:17:20,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-05 18:17:20,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 62 conjunts are in the unsatisfiable core [2024-05-05 18:17:20,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-05 18:17:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 88 proven. 189 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-05 18:17:44,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-05 18:19:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 88 proven. 183 refuted. 6 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-05 18:19:40,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142400580] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-05 18:19:40,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-05 18:19:40,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 104 [2024-05-05 18:19:40,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656638702] [2024-05-05 18:19:40,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-05 18:19:40,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2024-05-05 18:19:40,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 18:19:40,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2024-05-05 18:19:40,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1530, Invalid=9170, Unknown=12, NotChecked=0, Total=10712 [2024-05-05 18:19:40,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:19:40,207 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 18:19:40,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 2.5288461538461537) internal successors, (263), 104 states have internal predecessors, (263), 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-05 18:19:40,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:19:40,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-05 18:19:40,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-05 18:19:40,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2024-05-05 18:19:40,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 18:20:21,832 WARN L293 SmtUtils]: Spent 26.01s on a formula simplification. DAG size of input: 164 DAG size of output: 139 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:20:24,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:20:28,393 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-05-05 18:20:31,501 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-05-05 18:20:33,692 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-05-05 18:20:35,703 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-05-05 18:21:03,278 WARN L293 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 163 DAG size of output: 118 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:21:05,552 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse67 (mod c_~M~0 4294967296))) (let ((.cse85 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 2) 4294967296)) (.cse87 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 3) 4294967296)) (.cse76 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 4) 4294967296)) (.cse21 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse24 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse20 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse22 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse89 (* (- 1) c_thread2Thread1of1ForFork1_~i~1)) (.cse93 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse80 (mod (+ c_~C~0 c_~counter~0) 4294967296)) (.cse95 (mod c_~counter~0 4294967296)) (.cse17 (+ c_thread2Thread1of1ForFork1_~i~1 3)) (.cse91 (+ c_thread2Thread1of1ForFork1_~i~1 4)) (.cse97 (+ 2 c_thread2Thread1of1ForFork1_~i~1)) (.cse88 (+ c_thread2Thread1of1ForFork1_~i~1 1)) (.cse96 (* (- 1) .cse67))) (let ((.cse77 (< (+ 4294967294 (* (div (+ .cse96 c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) 4294967296)) c_thread2Thread1of1ForFork1_~i~1)) (.cse78 (mod c_~C~0 4294967296)) (.cse79 (< (+ .cse67 (* (div c_thread2Thread1of1ForFork1_~i~1 4294967296) 4294967296)) .cse88)) (.cse68 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse51 (< (+ 4294967293 (* (div (+ .cse96 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296)) c_thread2Thread1of1ForFork1_~i~1)) (.cse52 (< (+ .cse67 (* (div .cse88 4294967296) 4294967296)) .cse97)) (.cse74 (< (+ 4294967291 (* (div (+ .cse96 c_thread2Thread1of1ForFork1_~i~1 4) 4294967296) 4294967296)) c_thread2Thread1of1ForFork1_~i~1)) (.cse75 (< (+ .cse67 (* 4294967296 (div .cse17 4294967296))) .cse91)) (.cse6 (< .cse95 1)) (.cse53 (< (+ .cse67 (* 4294967296 (div .cse97 4294967296))) .cse17)) (.cse54 (< (+ 4294967292 (* (div (+ .cse96 c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) 4294967296)) c_thread2Thread1of1ForFork1_~i~1)) (.cse10 (< 0 .cse95)) (.cse11 (< .cse80 1)) (.cse18 (+ .cse93 1)) (.cse14 (let ((.cse94 (+ 7 c_thread2Thread1of1ForFork1_~i~1))) (+ (* (div .cse94 4294967296) 4294967296) (* (div (+ .cse89 8589934584) 4294967296) 4294967296) (mod .cse94 4294967296)))) (.cse84 (+ 4294967297 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse83 (+ .cse22 4294967297)) (.cse61 (+ .cse20 4294967297)) (.cse82 (+ 4294967297 .cse93)) (.cse31 (+ 4294967297 .cse24)) (.cse30 (let ((.cse92 (+ c_thread2Thread1of1ForFork1_~i~1 6))) (+ (* (div .cse92 4294967296) 4294967296) (mod .cse92 4294967296) (* (div (+ .cse89 8589934585) 4294967296) 4294967296)))) (.cse15 (+ 4294967297 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 6) 4294967296))) (.cse81 (+ (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 4294967297)) (.cse7 (+ (* (div (+ .cse89 8589934587) 4294967296) 4294967296) (* (div .cse91 4294967296) 4294967296) (mod .cse91 4294967296))) (.cse64 (+ 4294967297 .cse21)) (.cse8 (+ 4294967297 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 5) 4294967296))) (.cse13 (+ .cse76 4294967297)) (.cse12 (+ .cse87 4294967297)) (.cse1 (let ((.cse90 (+ 5 c_thread2Thread1of1ForFork1_~i~1))) (+ (* (div (+ 8589934586 .cse89) 4294967296) 4294967296) (mod .cse90 4294967296) (* 4294967296 (div .cse90 4294967296))))) (.cse9 (+ .cse85 4294967297)) (.cse86 (mod (+ |c_thread1Thread1of1ForFork0_#t~post1| 1) 4294967296))) (let ((.cse2 (+ 4294967297 .cse86)) (.cse0 (< .cse1 .cse9)) (.cse3 (< .cse1 .cse12)) (.cse4 (< .cse1 .cse13)) (.cse5 (< .cse1 .cse8)) (.cse56 (< .cse7 .cse64)) (.cse55 (< .cse1 .cse81)) (.cse39 (< .cse30 .cse15)) (.cse16 (+ (mod (+ 7 |c_thread1Thread1of1ForFork0_#t~post1|) 4294967296) 4294967297)) (.cse40 (< .cse30 .cse13)) (.cse41 (< .cse30 .cse12)) (.cse42 (< .cse30 .cse8)) (.cse25 (< .cse1 .cse31)) (.cse26 (< .cse1 .cse82)) (.cse27 (< .cse1 .cse61)) (.cse28 (< .cse1 .cse83)) (.cse29 (< .cse1 .cse84)) (.cse43 (< .cse7 .cse31)) (.cse44 (< .cse7 .cse61)) (.cse45 (< .cse7 .cse84)) (.cse46 (< .cse7 .cse82)) (.cse47 (< .cse7 .cse83)) (.cse59 (< .cse14 .cse82)) (.cse60 (< .cse14 .cse81)) (.cse62 (< .cse14 .cse84)) (.cse63 (< .cse14 .cse83)) (.cse66 (+ 4294967297 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse69 (< (mod .cse88 4294967296) .cse67)) (.cse19 (< (mod (+ c_~counter~0 (* c_~C~0 2)) 4294967296) 1)) (.cse73 (< .cse67 .cse18)) (.cse58 (< .cse67 (+ .cse87 1))) (.cse37 (< .cse67 (+ .cse86 1))) (.cse38 (< .cse67 (+ .cse85 1))) (.cse72 (and (or .cse74 .cse75 .cse6) (or .cse53 .cse54 .cse10 .cse11))) (.cse32 (< .cse30 .cse84)) (.cse33 (< .cse30 .cse83)) (.cse34 (< .cse30 .cse82)) (.cse65 (< .cse30 .cse81)) (.cse35 (< .cse30 .cse61)) (.cse48 (< .cse67 (+ .cse22 1))) (.cse57 (and (or .cse53 .cse54 .cse6) (or .cse51 .cse10 .cse11 .cse52))) (.cse70 (< .cse68 .cse67)) (.cse71 (< .cse67 (+ .cse21 1))) (.cse23 (< 0 .cse80)) (.cse49 (< .cse67 (+ .cse20 1))) (.cse36 (and (or .cse77 .cse10 (< (+ (* 4294967296 (div (+ (- 1) c_~counter~0 .cse78) 4294967296)) 4294967295) (+ c_~counter~0 .cse78)) .cse79) (or .cse51 .cse6 .cse52))) (.cse50 (< .cse67 (+ .cse24 1)))) (and (or .cse0 (< .cse1 .cse2) .cse3 .cse4 .cse5 .cse6) (or (< .cse7 .cse8) (< .cse7 .cse9) .cse10 (< .cse7 .cse2) .cse11 (< .cse7 .cse12) (< .cse7 .cse13)) (or (< .cse14 .cse15) (< .cse14 .cse13) .cse6 (< .cse14 .cse8) (< .cse14 .cse12) (< .cse14 .cse16)) (or (< (mod .cse17 4294967296) .cse18) .cse19 (< 4294967294 .cse20) (< 4294967294 .cse21) (< 4294967294 .cse22) .cse23 (< 4294967294 .cse24)) (or .cse25 .cse10 .cse26 .cse27 .cse11 .cse28 .cse29) (or (< .cse30 .cse31) .cse6 .cse32 .cse33 .cse34 .cse35) (or .cse25 .cse26 .cse27 .cse6 .cse28 .cse29) (or .cse36 .cse37 .cse38) (or .cse39 (< .cse30 .cse9) .cse6 .cse40 .cse41 .cse42) (or .cse43 .cse19 .cse44 .cse23 .cse45 .cse46 .cse47) (or .cse48 .cse49 .cse50 (and (or .cse19 .cse51 .cse23 .cse52) (or .cse53 .cse54 .cse11))) (or .cse10 .cse26 .cse27 .cse11 .cse55 .cse28 .cse29) (or .cse43 .cse10 .cse44 .cse11 .cse46 .cse47 .cse56) (or .cse57 .cse58 .cse37 .cse38) (or .cse0 .cse10 .cse3 .cse4 .cse11 .cse5 (< .cse1 .cse15)) (or .cse59 .cse60 .cse6 (< .cse14 .cse61) .cse62 .cse63) (or .cse25 (< .cse1 .cse64) .cse26 .cse27 .cse6 .cse28) (or .cse43 .cse44 .cse11 .cse46 .cse47 .cse56) (or .cse19 .cse26 .cse27 .cse23 .cse55 .cse28 .cse29) (or .cse39 (< .cse30 .cse16) .cse10 .cse11 .cse40 .cse41 .cse42) (or .cse25 .cse26 .cse27 .cse11 .cse28 .cse29) (or .cse43 .cse10 .cse44 .cse11 .cse45 .cse46 .cse47) (or .cse10 .cse11 .cse32 .cse33 .cse34 .cse65 .cse35) (or .cse6 .cse32 .cse33 .cse34 .cse65 .cse35) (or (< .cse14 .cse66) .cse59 .cse60 .cse6 .cse62 .cse63) (or (< .cse67 (+ .cse68 1)) .cse69 .cse50 .cse11) (or .cse10 (< .cse30 .cse66) .cse11 .cse32 .cse33 .cse34 .cse65) (= c_~counter~0 0) (or (and (or .cse69 .cse6) (or .cse10 .cse70)) .cse71) (or .cse48 .cse72 .cse49 .cse50 .cse73) (or .cse48 .cse49 .cse50 (and (or .cse53 .cse19 .cse54 .cse23) (or .cse74 .cse75 .cse11)) .cse73) (or .cse72 (< .cse67 (+ .cse76 1)) .cse58 .cse37 .cse38) (or .cse48 .cse72 .cse49 .cse50 .cse71) (or .cse11 .cse32 .cse33 .cse34 .cse65 .cse35) (or .cse49 .cse57 .cse50 .cse71) (or .cse48 .cse49 .cse57 .cse50) (or .cse71 .cse70) (or .cse36 .cse50 .cse71) (or .cse49 .cse50 (and (or .cse51 .cse11 .cse52) (or .cse77 (< (+ 4294967295 (* (div (+ (- 1) c_~C~0 c_~counter~0 .cse78) 4294967296) 4294967296)) (+ c_~C~0 c_~counter~0 .cse78)) .cse23 .cse79))) (or .cse49 .cse36 .cse50)))))) is different from false [2024-05-05 18:21:46,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:21:58,816 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-05-05 18:22:35,209 WARN L293 SmtUtils]: Spent 12.90s on a formula simplification. DAG size of input: 358 DAG size of output: 89 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:23:04,721 WARN L293 SmtUtils]: Spent 7.42s on a formula simplification. DAG size of input: 282 DAG size of output: 66 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:23:08,155 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse3 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse5 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse56 (+ c_thread2Thread1of1ForFork1_~i~1 4)) (.cse40 (mod c_~M~0 4294967296)) (.cse61 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse59 (* (- 1) c_thread2Thread1of1ForFork1_~i~1))) (let ((.cse47 (mod c_~counter~0 4294967296)) (.cse49 (mod (+ c_~C~0 c_~counter~0) 4294967296)) (.cse46 (+ 2 c_thread2Thread1of1ForFork1_~i~1)) (.cse50 (let ((.cse62 (+ c_thread2Thread1of1ForFork1_~i~1 6))) (+ (* (div .cse62 4294967296) 4294967296) (mod .cse62 4294967296) (* (div (+ .cse59 8589934585) 4294967296) 4294967296)))) (.cse1 (+ .cse61 1)) (.cse0 (+ c_thread2Thread1of1ForFork1_~i~1 3)) (.cse48 (* (- 1) .cse40)) (.cse45 (+ c_thread2Thread1of1ForFork1_~i~1 1)) (.cse41 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse29 (+ (* (div (+ .cse59 8589934587) 4294967296) 4294967296) (* (div .cse56 4294967296) 4294967296) (mod .cse56 4294967296))) (.cse55 (+ 4294967297 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse54 (+ .cse5 4294967297)) (.cse51 (+ .cse3 4294967297)) (.cse53 (+ 4294967297 .cse61)) (.cse57 (+ 4294967297 .cse7)) (.cse58 (let ((.cse60 (+ 5 c_thread2Thread1of1ForFork1_~i~1))) (+ (* (div (+ 8589934586 .cse59) 4294967296) 4294967296) (mod .cse60 4294967296) (* 4294967296 (div .cse60 4294967296))))) (.cse52 (+ (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 4294967297))) (let ((.cse28 (< .cse58 .cse52)) (.cse8 (< .cse58 .cse57)) (.cse9 (< .cse58 .cse53)) (.cse10 (< .cse58 .cse51)) (.cse12 (< .cse58 .cse54)) (.cse13 (< .cse58 .cse55)) (.cse14 (< .cse29 .cse57)) (.cse15 (< .cse29 .cse51)) (.cse16 (< .cse29 .cse55)) (.cse17 (< .cse29 .cse53)) (.cse18 (< .cse29 .cse54)) (.cse30 (< .cse40 (+ .cse41 1))) (.cse31 (< (mod .cse45 4294967296) .cse40)) (.cse2 (< (mod (+ c_~counter~0 (* c_~C~0 2)) 4294967296) 1)) (.cse37 (< (+ 4294967291 (* (div (+ .cse48 c_thread2Thread1of1ForFork1_~i~1 4) 4294967296) 4294967296)) c_thread2Thread1of1ForFork1_~i~1)) (.cse38 (< (+ .cse40 (* 4294967296 (div .cse0 4294967296))) .cse56)) (.cse39 (< .cse40 .cse1)) (.cse32 (< .cse50 .cse55)) (.cse33 (< .cse50 .cse54)) (.cse34 (< .cse50 .cse53)) (.cse35 (< .cse50 .cse52)) (.cse36 (< .cse50 .cse51)) (.cse19 (< .cse40 (+ .cse5 1))) (.cse24 (< (+ .cse40 (* 4294967296 (div .cse46 4294967296))) .cse0)) (.cse25 (< (+ 4294967292 (* (div (+ .cse48 c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) 4294967296)) c_thread2Thread1of1ForFork1_~i~1)) (.cse4 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse26 (< .cse49 1)) (.cse6 (< 0 .cse49)) (.cse20 (< .cse40 (+ .cse3 1))) (.cse42 (< (+ 4294967294 (* (div (+ .cse48 c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) 4294967296)) c_thread2Thread1of1ForFork1_~i~1)) (.cse27 (< 0 .cse47)) (.cse43 (mod c_~C~0 4294967296)) (.cse44 (< (+ .cse40 (* (div c_thread2Thread1of1ForFork1_~i~1 4294967296) 4294967296)) .cse45)) (.cse22 (< (+ 4294967293 (* (div (+ .cse48 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 4294967296)) c_thread2Thread1of1ForFork1_~i~1)) (.cse11 (< .cse47 1)) (.cse23 (< (+ .cse40 (* (div .cse45 4294967296) 4294967296)) .cse46)) (.cse21 (< .cse40 (+ .cse7 1)))) (and (or (< (mod .cse0 4294967296) .cse1) .cse2 (< 4294967294 .cse3) (< 4294967294 .cse4) (< 4294967294 .cse5) .cse6 (< 4294967294 .cse7)) (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse2 .cse15 .cse6 .cse16 .cse17 .cse18) (or .cse19 .cse20 .cse21 (and (or .cse2 .cse22 .cse6 .cse23) (or .cse24 .cse25 .cse26))) (or .cse27 .cse9 .cse10 .cse26 .cse28 .cse12 .cse13) (or .cse14 .cse15 .cse26 .cse17 .cse18 (< .cse29 (+ 4294967297 .cse4))) (or .cse2 .cse9 .cse10 .cse6 .cse28 .cse12 .cse13) (or .cse8 .cse9 .cse10 .cse26 .cse12 .cse13) (or .cse30 .cse31 .cse21 .cse11) (or .cse14 .cse27 .cse15 .cse26 .cse16 .cse17 .cse18) (or .cse11 .cse32 .cse33 .cse34 .cse35 .cse36) (or .cse30 .cse31 .cse21 .cse26) (or .cse19 (and (or .cse37 .cse38 .cse11) (or .cse24 .cse25 .cse27 .cse26)) .cse20 .cse21 .cse39) (or .cse19 .cse20 .cse21 (and (or .cse24 .cse2 .cse25 .cse6) (or .cse37 .cse38 .cse26)) .cse39) (or .cse26 .cse32 .cse33 .cse34 .cse35 .cse36) (or .cse19 .cse20 (and (or .cse24 .cse25 .cse11) (or .cse22 .cse27 .cse26 .cse23)) .cse21) (or (< .cse40 (+ .cse4 1)) (< .cse41 .cse40)) (or .cse20 .cse21 (and (or .cse22 .cse26 .cse23) (or .cse42 (< (+ 4294967295 (* (div (+ (- 1) c_~C~0 c_~counter~0 .cse43) 4294967296) 4294967296)) (+ c_~C~0 c_~counter~0 .cse43)) .cse6 .cse44))) (or .cse20 (and (or .cse42 .cse27 (< (+ (* 4294967296 (div (+ (- 1) c_~counter~0 .cse43) 4294967296)) 4294967295) (+ c_~counter~0 .cse43)) .cse44) (or .cse22 .cse11 .cse23)) .cse21))))) is different from false [2024-05-05 18:25:53,798 WARN L293 SmtUtils]: Spent 2.27m on a formula simplification. DAG size of input: 170 DAG size of output: 151 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:25:55,804 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-05-05 18:25:58,484 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-05-05 18:26:00,489 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-05-05 18:26:01,592 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-05-05 18:26:03,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:26:05,659 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-05-05 18:26:07,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:26:09,178 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-05-05 18:28:55,014 WARN L293 SmtUtils]: Spent 2.32m on a formula simplification. DAG size of input: 168 DAG size of output: 149 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-05 18:28:57,161 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-05-05 18:28:59,585 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-05-05 18:29:01,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:29:04,643 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-05-05 18:29:06,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:29:08,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-05 18:29:10,302 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-05-05 18:29:12,352 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-05-05 18:29:14,361 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 [] Received shutdown request... [2024-05-05 18:29:58,143 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-05-05 18:29:58,143 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-05 18:29:58,143 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-05-05 18:29:58,667 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-05 18:29:58,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-05 18:29:58,862 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 170 known predicates. [2024-05-05 18:29:58,864 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-05 18:29:58,864 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-05 18:29:58,865 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-05 18:29:58,868 INFO L448 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-05-05 18:29:58,871 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-05 18:29:58,871 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-05 18:29:58,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.05 06:29:58 BasicIcfg [2024-05-05 18:29:58,873 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-05 18:29:58,875 INFO L158 Benchmark]: Toolchain (without parser) took 865750.34ms. Allocated memory was 156.2MB in the beginning and 389.0MB in the end (delta: 232.8MB). Free memory was 82.4MB in the beginning and 313.5MB in the end (delta: -231.2MB). Peak memory consumption was 201.3MB. Max. memory is 8.0GB. [2024-05-05 18:29:58,875 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 156.2MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-05 18:29:58,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.51ms. Allocated memory was 156.2MB in the beginning and 269.5MB in the end (delta: 113.2MB). Free memory was 82.2MB in the beginning and 237.2MB in the end (delta: -155.0MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2024-05-05 18:29:58,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.38ms. Allocated memory is still 269.5MB. Free memory was 237.2MB in the beginning and 235.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-05 18:29:58,876 INFO L158 Benchmark]: Boogie Preprocessor took 39.34ms. Allocated memory is still 269.5MB. Free memory was 235.6MB in the beginning and 234.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-05 18:29:58,876 INFO L158 Benchmark]: RCFGBuilder took 433.69ms. Allocated memory is still 269.5MB. Free memory was 234.0MB in the beginning and 218.8MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-05-05 18:29:58,876 INFO L158 Benchmark]: TraceAbstraction took 865000.61ms. Allocated memory was 269.5MB in the beginning and 389.0MB in the end (delta: 119.5MB). Free memory was 217.8MB in the beginning and 313.5MB in the end (delta: -95.8MB). Peak memory consumption was 221.9MB. Max. memory is 8.0GB. [2024-05-05 18:29:58,878 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 156.2MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.51ms. Allocated memory was 156.2MB in the beginning and 269.5MB in the end (delta: 113.2MB). Free memory was 82.2MB in the beginning and 237.2MB in the end (delta: -155.0MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.38ms. Allocated memory is still 269.5MB. Free memory was 237.2MB in the beginning and 235.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.34ms. Allocated memory is still 269.5MB. Free memory was 235.6MB in the beginning and 234.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 433.69ms. Allocated memory is still 269.5MB. Free memory was 234.0MB in the beginning and 218.8MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 865000.61ms. Allocated memory was 269.5MB in the beginning and 389.0MB in the end (delta: 119.5MB). Free memory was 217.8MB in the beginning and 313.5MB in the end (delta: -95.8MB). Peak memory consumption was 221.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1605, independent: 1320, independent conditional: 1318, independent unconditional: 2, dependent: 285, dependent conditional: 285, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1323, independent: 1320, independent conditional: 1318, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1323, independent: 1320, independent conditional: 1318, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1323, independent: 1320, independent conditional: 1318, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1328, independent: 1320, independent conditional: 485, independent unconditional: 835, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1328, independent: 1320, independent conditional: 479, independent unconditional: 841, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1328, independent: 1320, independent conditional: 479, independent unconditional: 841, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 123, independent: 122, independent conditional: 32, independent unconditional: 90, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 123, independent: 122, independent conditional: 0, independent unconditional: 122, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1328, independent: 1198, independent conditional: 447, independent unconditional: 751, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 123, unknown conditional: 32, unknown unconditional: 91] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 122, Positive conditional cache size: 32, Positive unconditional cache size: 90, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1328, independent: 1320, independent conditional: 485, independent unconditional: 835, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1328, independent: 1320, independent conditional: 479, independent unconditional: 841, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1328, independent: 1320, independent conditional: 479, independent unconditional: 841, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 123, independent: 122, independent conditional: 32, independent unconditional: 90, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 123, independent: 122, independent conditional: 0, independent unconditional: 122, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1328, independent: 1198, independent conditional: 447, independent unconditional: 751, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 123, unknown conditional: 32, unknown unconditional: 91] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 122, Positive conditional cache size: 32, Positive unconditional cache size: 90, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8 ], Independence queries for same thread: 282 - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 170 known predicates. - TimeoutResultAtElement [Line: 72]: 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 170 known predicates. - TimeoutResultAtElement [Line: 73]: 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 170 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 96 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 864.9s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 706.9s, 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: 202, 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, 1.6s SatisfiabilityAnalysisTime, 155.1s InterpolantComputationTime, 688 NumberOfCodeBlocks, 688 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 956 ConstructedInterpolants, 1 QuantifiedInterpolants, 21137 SizeOfPredicates, 51 NumberOfNonLiveVariables, 561 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 256/1007 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, ConditionalCommutativityCheckTime: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown