/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 --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 21:53:04,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 21:53:04,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 21:53:04,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 21:53:04,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 21:53:04,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 21:53:04,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 21:53:04,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 21:53:04,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 21:53:04,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 21:53:04,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 21:53:04,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 21:53:04,607 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 21:53:04,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 21:53:04,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 21:53:04,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 21:53:04,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 21:53:04,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 21:53:04,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 21:53:04,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 21:53:04,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 21:53:04,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 21:53:04,610 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 21:53:04,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 21:53:04,611 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 21:53:04,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 21:53:04,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 21:53:04,611 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 21:53:04,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 21:53:04,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 21:53:04,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 21:53:04,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 21:53:04,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 21:53:04,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 21:53:04,613 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 21:53:04,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 21:53:04,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 21:53:04,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 21:53:04,613 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 21:53:04,614 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-06 21:53:04,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 21:53:04,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 21:53:04,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 21:53:04,868 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 21:53:04,868 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 21:53:04,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2024-05-06 21:53:05,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 21:53:06,070 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 21:53:06,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2024-05-06 21:53:06,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7daec945a/2022131a9e8d4807afbcae395fec7d96/FLAG38337da00 [2024-05-06 21:53:06,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7daec945a/2022131a9e8d4807afbcae395fec7d96 [2024-05-06 21:53:06,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 21:53:06,092 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 21:53:06,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 21:53:06,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 21:53:06,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 21:53:06,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 09:53:06" (1/1) ... [2024-05-06 21:53:06,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154e8b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:53:06, skipping insertion in model container [2024-05-06 21:53:06,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 09:53:06" (1/1) ... [2024-05-06 21:53:06,113 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 21:53:06,261 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/mult-dist.wvr.c[2116,2129] [2024-05-06 21:53:06,271 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 21:53:06,280 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 21:53:06,307 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/mult-dist.wvr.c[2116,2129] [2024-05-06 21:53:06,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 21:53:06,318 INFO L206 MainTranslator]: Completed translation [2024-05-06 21:53:06,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:53:06 WrapperNode [2024-05-06 21:53:06,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 21:53:06,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 21:53:06,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 21:53:06,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 21:53:06,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:53:06" (1/1) ... [2024-05-06 21:53:06,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:53:06" (1/1) ... [2024-05-06 21:53:06,355 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-05-06 21:53:06,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 21:53:06,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 21:53:06,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 21:53:06,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 21:53:06,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:53:06" (1/1) ... [2024-05-06 21:53:06,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:53:06" (1/1) ... [2024-05-06 21:53:06,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:53:06" (1/1) ... [2024-05-06 21:53:06,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:53:06" (1/1) ... [2024-05-06 21:53:06,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:53:06" (1/1) ... [2024-05-06 21:53:06,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:53:06" (1/1) ... [2024-05-06 21:53:06,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:53:06" (1/1) ... [2024-05-06 21:53:06,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:53:06" (1/1) ... [2024-05-06 21:53:06,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 21:53:06,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 21:53:06,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 21:53:06,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 21:53:06,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:53:06" (1/1) ... [2024-05-06 21:53:06,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 21:53:06,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 21:53:06,441 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-06 21:53:06,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-06 21:53:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 21:53:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-06 21:53:06,503 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-06 21:53:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-06 21:53:06,503 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-06 21:53:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-06 21:53:06,503 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-06 21:53:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 21:53:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 21:53:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 21:53:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 21:53:06,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 21:53:06,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 21:53:06,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 21:53:06,506 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 21:53:06,614 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 21:53:06,616 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 21:53:06,865 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 21:53:06,875 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 21:53:06,875 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-06 21:53:06,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 09:53:06 BoogieIcfgContainer [2024-05-06 21:53:06,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 21:53:06,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 21:53:06,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 21:53:06,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 21:53:06,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 09:53:06" (1/3) ... [2024-05-06 21:53:06,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6673656a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 09:53:06, skipping insertion in model container [2024-05-06 21:53:06,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 09:53:06" (2/3) ... [2024-05-06 21:53:06,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6673656a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 09:53:06, skipping insertion in model container [2024-05-06 21:53:06,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 09:53:06" (3/3) ... [2024-05-06 21:53:06,883 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2024-05-06 21:53:06,889 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 21:53:06,896 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 21:53:06,896 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 21:53:06,896 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 21:53:06,942 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-06 21:53:06,977 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 21:53:06,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 21:53:06,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 21:53:06,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-06 21:53:06,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-06 21:53:07,023 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 21:53:07,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 21:53:07,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 21:53:07,043 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;@52c90e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 21:53:07,044 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-06 21:53:07,310 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 21:53:07,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 21:53:07,317 INFO L85 PathProgramCache]: Analyzing trace with hash -445322638, now seen corresponding path program 1 times [2024-05-06 21:53:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 21:53:07,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173909326] [2024-05-06 21:53:07,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:53:07,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:53:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:53:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-06 21:53:07,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 21:53:07,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173909326] [2024-05-06 21:53:07,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173909326] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 21:53:07,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 21:53:07,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 21:53:07,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580172369] [2024-05-06 21:53:07,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 21:53:07,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-06 21:53:07,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 21:53:07,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 21:53:07,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-06 21:53:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:53:07,629 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 21:53:07,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 21:53:07,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:53:07,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:53:07,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 21:53:07,753 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 21:53:07,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 21:53:07,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1122714043, now seen corresponding path program 1 times [2024-05-06 21:53:07,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 21:53:07,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932258154] [2024-05-06 21:53:07,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:53:07,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:53:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:53:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:53:08,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 21:53:08,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932258154] [2024-05-06 21:53:08,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932258154] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 21:53:08,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979904682] [2024-05-06 21:53:08,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:53:08,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 21:53:08,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 21:53:08,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 21:53:08,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-06 21:53:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:53:09,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 24 conjunts are in the unsatisfiable core [2024-05-06 21:53:09,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 21:53:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:53:09,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 21:53:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:53:10,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979904682] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 21:53:10,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 21:53:10,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 35 [2024-05-06 21:53:10,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276485889] [2024-05-06 21:53:10,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 21:53:10,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-05-06 21:53:10,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 21:53:10,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-05-06 21:53:10,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2024-05-06 21:53:10,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:53:10,129 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 21:53:10,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.371428571428571) internal successors, (153), 35 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 21:53:10,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:53:10,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:53:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:53:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-06 21:53:12,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-06 21:53:12,247 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-05-06 21:53:12,247 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 21:53:12,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 21:53:12,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1115789919, now seen corresponding path program 1 times [2024-05-06 21:53:12,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 21:53:12,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786486624] [2024-05-06 21:53:12,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:53:12,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:53:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:53:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:53:13,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 21:53:13,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786486624] [2024-05-06 21:53:13,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786486624] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 21:53:13,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048148540] [2024-05-06 21:53:13,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:53:13,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 21:53:13,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 21:53:13,529 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 21:53:13,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-06 21:53:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:53:13,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 40 conjunts are in the unsatisfiable core [2024-05-06 21:53:13,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 21:53:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:53:15,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 21:53:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:53:23,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048148540] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 21:53:23,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 21:53:23,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 60 [2024-05-06 21:53:23,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094660579] [2024-05-06 21:53:23,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 21:53:23,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-05-06 21:53:23,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 21:53:23,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-05-06 21:53:23,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=3169, Unknown=1, NotChecked=0, Total=3540 [2024-05-06 21:53:23,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:53:23,032 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 21:53:23,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 3.4833333333333334) internal successors, (209), 60 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 21:53:23,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:53:23,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-06 21:53:23,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:53:59,230 WARN L293 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 112 DAG size of output: 106 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 21:54:10,227 WARN L293 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 111 DAG size of output: 106 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 21:54:21,589 WARN L293 SmtUtils]: Spent 7.29s on a formula simplification. DAG size of input: 122 DAG size of output: 118 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 21:54:23,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 21:54:32,862 WARN L293 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 117 DAG size of output: 111 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 21:54:49,535 WARN L293 SmtUtils]: Spent 5.40s on a formula simplification. DAG size of input: 116 DAG size of output: 111 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 21:55:41,910 WARN L293 SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 116 DAG size of output: 111 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 21:55:54,290 WARN L293 SmtUtils]: Spent 5.44s on a formula simplification. DAG size of input: 100 DAG size of output: 95 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 21:56:28,227 WARN L293 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 127 DAG size of output: 122 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 21:56:50,334 WARN L293 SmtUtils]: Spent 9.26s on a formula simplification. DAG size of input: 127 DAG size of output: 122 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 21:57:14,694 WARN L293 SmtUtils]: Spent 12.06s on a formula simplification. DAG size of input: 124 DAG size of output: 119 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 21:57:33,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 21:58:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:58:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-06 21:58:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2024-05-06 21:58:13,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-06 21:58:13,701 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-05-06 21:58:13,702 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 21:58:13,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 21:58:13,703 INFO L85 PathProgramCache]: Analyzing trace with hash -176537540, now seen corresponding path program 2 times [2024-05-06 21:58:13,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 21:58:13,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136494830] [2024-05-06 21:58:13,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 21:58:13,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 21:58:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 21:58:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 6 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:58:15,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 21:58:15,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136494830] [2024-05-06 21:58:15,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136494830] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 21:58:15,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605018456] [2024-05-06 21:58:15,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-06 21:58:15,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 21:58:15,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 21:58:15,861 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 21:58:15,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-06 21:58:15,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-06 21:58:15,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-06 21:58:15,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 74 conjunts are in the unsatisfiable core [2024-05-06 21:58:15,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 21:58:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 6 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:58:18,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 21:58:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 6 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 21:58:25,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605018456] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 21:58:25,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 21:58:25,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 39] total 110 [2024-05-06 21:58:25,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484169570] [2024-05-06 21:58:25,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 21:58:25,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2024-05-06 21:58:25,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 21:58:25,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2024-05-06 21:58:25,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=696, Invalid=11294, Unknown=0, NotChecked=0, Total=11990 [2024-05-06 21:58:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:58:25,354 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 21:58:25,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 110 states, 110 states have (on average 3.1272727272727274) internal successors, (344), 110 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 21:58:25,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:58:25,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-05-06 21:58:25,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 229 states. [2024-05-06 21:58:25,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 21:58:53,252 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse3 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse23 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse29 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse12 (mod c_~a~0 4294967296))) (let ((.cse32 (< .cse12 (+ 2 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)))) (.cse31 (+ 4294967295 .cse29)) (.cse5 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse4 (mod c_thread1Thread1of1ForFork2_~i~0 4294967296)) (.cse20 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse36 (+ 2 .cse29)) (.cse21 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse35 (+ .cse23 2)) (.cse2 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse7 (+ .cse3 2)) (.cse17 (+ .cse0 2)) (.cse24 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296))) (let ((.cse14 (+ .cse24 4294967294)) (.cse22 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) .cse17)) (.cse18 (< .cse2 .cse7)) (.cse8 (+ .cse23 4294967294)) (.cse25 (< .cse21 .cse35)) (.cse16 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse27 (< .cse20 .cse36)) (.cse26 (+ .cse0 4294967294)) (.cse1 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse6 (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) 4294967296)) (.cse15 (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 4) 4294967296)) (.cse9 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse10 (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 2) 4294967296)) (.cse28 (+ .cse3 4294967294)) (.cse11 (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296)) (.cse19 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse33 (< .cse4 .cse12)) (.cse13 (let ((.cse37 (+ .cse12 .cse5))) (and (or .cse32 (< .cse31 .cse37)) (<= .cse29 .cse37))))) (and (<= .cse0 (+ .cse1 .cse2 1)) (<= .cse3 (+ .cse4 .cse5 1)) (or (< .cse6 .cse7) (< .cse8 (+ .cse9 .cse10))) (or (< .cse11 .cse12) .cse13) (or (< .cse14 (+ .cse15 .cse16)) (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 5) 4294967296) .cse17)) (or .cse18 (< .cse8 (+ .cse19 .cse20))) (or (< .cse14 (+ .cse1 .cse21)) .cse22) (<= .cse23 (+ .cse9 .cse20 1)) (or (< .cse14 (+ .cse16 .cse21)) .cse22) (or .cse18 (< .cse8 (+ .cse9 .cse20))) (<= .cse3 (+ .cse19 .cse4 1)) (<= .cse23 (+ .cse19 .cse20 1)) (<= .cse24 (+ .cse16 1 .cse21)) (or .cse25 (< .cse26 (+ .cse1 .cse2))) (or .cse27 (< .cse28 (+ .cse4 .cse5))) (<= .cse3 (+ .cse11 .cse19 1)) (or .cse25 (< .cse26 (+ .cse9 .cse2))) (<= .cse24 (+ .cse1 1 .cse21)) (<= .cse24 (+ .cse15 .cse16 1)) (or (let ((.cse30 (+ .cse12 (mod (+ |c_thread2Thread1of1ForFork0_#t~post2| 1) 4294967296)))) (and (<= .cse29 .cse30) (or (< .cse31 .cse30) .cse32))) .cse33) (<= .cse0 (+ .cse1 .cse6 1)) (or (let ((.cse34 (+ (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) .cse12))) (and (or (< .cse31 .cse34) .cse32) (<= .cse29 .cse34))) .cse33) (or .cse27 (< .cse28 (+ .cse19 .cse4))) (<= .cse23 (+ .cse9 .cse10 1)) (or (< .cse26 (+ .cse1 .cse6)) (< .cse15 .cse35)) (<= .cse0 (+ .cse9 .cse2 1)) (or (< .cse10 .cse36) (< .cse28 (+ .cse11 .cse19))) (or .cse33 .cse13))))) is different from false [2024-05-06 22:00:36,935 WARN L293 SmtUtils]: Spent 13.69s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 22:00:38,954 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse6 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse0 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse2 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse4 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse7 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse8 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse9 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse11 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse1 (mod c_thread1Thread1of1ForFork2_~i~0 4294967296)) (.cse10 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse12 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse3 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296))) (and (<= .cse0 (+ .cse1 .cse2 1)) (or (< .cse3 (+ .cse0 2)) (< (+ .cse4 4294967294) (+ .cse5 .cse6))) (or (< (+ .cse7 4294967294) (+ .cse8 .cse9)) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) (+ .cse10 2))) (<= .cse4 (+ .cse5 .cse6 1)) (or (< .cse6 (+ 2 .cse11)) (< (+ .cse0 4294967294) (+ .cse1 .cse2))) (or (< .cse9 (+ .cse4 2)) (< (+ .cse10 4294967294) (+ .cse12 .cse3))) (<= .cse7 (+ .cse8 1 .cse9)) (or (< (mod c_~b~0 4294967296) (+ (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) 1)) (< .cse11 (mod (+ c_~b~0 c_~a~0) 4294967296)) (< .cse1 (mod c_~a~0 4294967296))) (<= .cse10 (+ .cse12 .cse3 1)))) is different from false [2024-05-06 22:00:40,961 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-06 22:00:42,967 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-06 22:00:44,974 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-06 22:00:46,984 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-06 22:00:48,993 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-06 22:00:51,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-05-06 22:00:53,426 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-06 22:00:55,435 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (mod c_thread1Thread1of1ForFork2_~i~0 4294967296)) (.cse17 (mod c_~a~0 4294967296))) (let ((.cse8 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse10 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse11 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse12 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse7 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse3 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse4 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse5 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse0 (< (mod c_~b~0 4294967296) (+ (mod c_thread2Thread1of1ForFork0_~i~1 4294967296) 1))) (.cse2 (mod (+ c_~b~0 c_~a~0) 4294967296)) (.cse9 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse13 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse14 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse1 (< .cse15 .cse17)) (.cse6 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse16 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296))) (and (or .cse0 .cse1 (< (mod (+ |c_thread3Thread1of1ForFork1_#t~post3| 1) 4294967296) .cse2)) (<= .cse3 (+ .cse4 .cse5 1)) (or .cse0 (< .cse6 .cse2)) (<= .cse7 (+ .cse8 .cse9 1)) (or (< (+ .cse10 4294967294) (+ .cse11 .cse12)) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) (+ .cse3 2))) (or (< .cse5 (+ .cse13 2)) (< (+ .cse7 4294967294) (+ .cse8 .cse9))) (<= .cse13 (+ .cse14 .cse15 1)) (<= .cse10 (+ .cse11 1 .cse12)) (or (< .cse12 (+ .cse7 2)) (< (+ .cse3 4294967294) (+ .cse4 .cse5))) (or .cse0 (< .cse16 .cse2) .cse1) (or (< .cse9 (+ 2 .cse16)) (< (+ .cse13 4294967294) (+ .cse14 .cse15))) (or .cse1 (let ((.cse18 (+ .cse17 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)))) (and (or (< .cse17 (+ 2 .cse6)) (< (+ 4294967295 .cse16) .cse18)) (<= .cse16 .cse18))))))) is different from false [2024-05-06 22:00:59,091 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-06 22:01:01,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:01:03,032 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-06 22:03:57,798 WARN L293 SmtUtils]: Spent 1.25m on a formula simplification. DAG size of input: 117 DAG size of output: 115 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 22:03:59,803 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-06 22:04:01,156 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-05-06 22:04:04,474 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse3 (mod c_~a~0 4294967296))) (let ((.cse6 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse8 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse9 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse10 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse5 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse0 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse1 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse2 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse7 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse11 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse12 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse13 (mod c_thread1Thread1of1ForFork2_~i~0 4294967296)) (.cse4 (let ((.cse15 (+ .cse3 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)))) (and (or (< .cse3 (+ 2 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296))) (< (+ 4294967295 .cse14) .cse15)) (<= .cse14 .cse15))))) (and (<= .cse0 (+ .cse1 .cse2 1)) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296) .cse3) .cse4) (<= .cse5 (+ .cse6 .cse7 1)) (or (< (+ .cse8 4294967294) (+ .cse9 .cse10)) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) (+ .cse0 2))) (or (< .cse2 (+ .cse11 2)) (< (+ .cse5 4294967294) (+ .cse6 .cse7))) (<= .cse11 (+ .cse12 .cse13 1)) (or (< .cse7 .cse3) .cse4) (<= .cse8 (+ .cse9 1 .cse10)) (or (< .cse10 (+ .cse5 2)) (< (+ .cse0 4294967294) (+ .cse1 .cse2))) (or (< .cse7 (+ 2 .cse14)) (< (+ .cse11 4294967294) (+ .cse12 .cse13))) (or (< .cse13 .cse3) .cse4)))) is different from false [2024-05-06 22:04:06,480 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-06 22:04:08,753 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-06 22:04:09,917 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-06 22:04:11,925 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse6 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse7 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse8 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse3 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse0 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse1 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse2 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse5 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse9 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse10 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse11 (mod c_thread1Thread1of1ForFork2_~i~0 4294967296)) (.cse13 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse12 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296))) (and (<= .cse0 (+ .cse1 .cse2 1)) (<= .cse3 (+ .cse4 .cse5 1)) (or (< (+ .cse6 4294967294) (+ .cse7 .cse8)) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) (+ .cse0 2))) (or (< .cse2 (+ .cse9 2)) (< (+ .cse3 4294967294) (+ .cse4 .cse5))) (<= .cse9 (+ .cse10 .cse11 1)) (<= .cse6 (+ .cse7 1 .cse8)) (or (< .cse8 (+ .cse3 2)) (< (+ .cse0 4294967294) (+ .cse1 .cse2))) (or (< .cse5 (+ 2 .cse12)) (< (+ .cse9 4294967294) (+ .cse10 .cse11))) (< .cse13 (mod (+ c_~b~0 c_~a~0) 4294967296)) (let ((.cse14 (mod c_~a~0 4294967296))) (or (< .cse11 .cse14) (let ((.cse15 (+ .cse14 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)))) (and (or (< .cse14 (+ 2 .cse13)) (< (+ 4294967295 .cse12) .cse15)) (<= .cse12 .cse15))))))) is different from false [2024-05-06 22:04:14,270 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-06 22:04:15,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:04:17,306 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-06 22:04:19,774 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-06 22:04:21,780 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-06 22:04:23,786 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-06 22:04:25,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-06 22:04:27,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-06 22:04:29,404 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-06 22:04:31,441 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse19 (mod c_thread1Thread1of1ForFork2_~i~0 4294967296)) (.cse28 (mod c_~a~0 4294967296)) (.cse8 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse24 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse2 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse17 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse9 (mod (+ 5 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse0 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse11 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse6 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296))) (let ((.cse7 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse4 (mod (+ |c_thread2Thread1of1ForFork0_#t~post2| 4) 4294967296)) (.cse13 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse5 (< .cse11 (+ .cse6 2))) (.cse3 (+ .cse0 4294967294)) (.cse1 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse12 (+ .cse9 4294967294)) (.cse10 (mod (+ |c_thread2Thread1of1ForFork0_#t~post2| 5) 4294967296)) (.cse14 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) (+ .cse0 2))) (.cse16 (+ .cse6 4294967294)) (.cse23 (mod (+ |c_thread2Thread1of1ForFork0_#t~post2| 3) 4294967296)) (.cse15 (< .cse2 (+ .cse17 2))) (.cse21 (mod (+ |c_thread2Thread1of1ForFork0_#t~post2| 2) 4294967296)) (.cse22 (< .cse8 (+ 2 .cse24))) (.cse20 (+ .cse17 4294967294)) (.cse18 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse29 (< .cse19 .cse28)) (.cse27 (< .cse28 (+ 2 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)))) (.cse26 (+ 4294967295 .cse24))) (and (<= .cse0 (+ .cse1 .cse2 1)) (or (< .cse3 (+ .cse2 .cse4)) .cse5) (<= .cse6 (+ .cse7 .cse8 1)) (<= .cse9 (+ .cse10 1 .cse11)) (or (< .cse12 (+ .cse13 .cse11)) .cse14) (or .cse15 (< .cse16 (+ .cse7 .cse8))) (<= .cse0 (+ .cse2 .cse4 1)) (<= .cse17 (+ .cse18 .cse19 1)) (or (< .cse20 (+ .cse21 .cse19)) .cse22) (<= .cse9 (+ .cse13 1 .cse11)) (or .cse5 (< .cse3 (+ .cse1 .cse2))) (<= .cse6 (+ .cse23 .cse8 1)) (or (< .cse12 (+ .cse10 .cse11)) .cse14) (or (< .cse16 (+ .cse23 .cse8)) .cse15) (or (let ((.cse25 (+ .cse28 (mod (+ |c_thread2Thread1of1ForFork0_#t~post2| 1) 4294967296)))) (and (<= .cse24 .cse25) (or (< .cse26 .cse25) .cse27))) .cse29) (<= .cse17 (+ .cse21 .cse19 1)) (or .cse22 (< .cse20 (+ .cse18 .cse19))) (or .cse29 (let ((.cse30 (+ .cse28 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)))) (and (or .cse27 (< .cse26 .cse30)) (<= .cse24 .cse30))))))) is different from false [2024-05-06 22:06:29,875 WARN L293 SmtUtils]: Spent 24.25s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-06 22:06:32,080 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-06 22:06:33,331 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 [] Received shutdown request... [2024-05-06 22:07:42,635 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-06 22:07:42,650 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-06 22:07:42,651 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-06 22:07:42,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-06 22:07:42,854 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-05-06 22:07:42,854 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 343 known predicates. [2024-05-06 22:07:42,857 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-06 22:07:42,857 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-06 22:07:42,857 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-06 22:07:42,857 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-06 22:07:42,860 INFO L448 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-05-06 22:07:42,864 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 22:07:42,864 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 22:07:42,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 10:07:42 BasicIcfg [2024-05-06 22:07:42,866 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 22:07:42,866 INFO L158 Benchmark]: Toolchain (without parser) took 876774.35ms. Allocated memory was 268.4MB in the beginning and 596.6MB in the end (delta: 328.2MB). Free memory was 196.9MB in the beginning and 397.5MB in the end (delta: -200.6MB). Peak memory consumption was 128.7MB. Max. memory is 8.0GB. [2024-05-06 22:07:42,866 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 268.4MB. Free memory is still 236.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 22:07:42,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.10ms. Allocated memory is still 268.4MB. Free memory was 196.7MB in the beginning and 185.5MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-06 22:07:42,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.73ms. Allocated memory is still 268.4MB. Free memory was 185.3MB in the beginning and 183.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 22:07:42,867 INFO L158 Benchmark]: Boogie Preprocessor took 29.00ms. Allocated memory is still 268.4MB. Free memory was 183.8MB in the beginning and 182.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 22:07:42,867 INFO L158 Benchmark]: RCFGBuilder took 491.35ms. Allocated memory is still 268.4MB. Free memory was 182.4MB in the beginning and 234.7MB in the end (delta: -52.4MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. [2024-05-06 22:07:42,867 INFO L158 Benchmark]: TraceAbstraction took 875987.63ms. Allocated memory was 268.4MB in the beginning and 596.6MB in the end (delta: 328.2MB). Free memory was 233.7MB in the beginning and 397.5MB in the end (delta: -163.8MB). Peak memory consumption was 164.4MB. Max. memory is 8.0GB. [2024-05-06 22:07:42,868 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 268.4MB. Free memory is still 236.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.10ms. Allocated memory is still 268.4MB. Free memory was 196.7MB in the beginning and 185.5MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.73ms. Allocated memory is still 268.4MB. Free memory was 185.3MB in the beginning and 183.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.00ms. Allocated memory is still 268.4MB. Free memory was 183.8MB in the beginning and 182.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 491.35ms. Allocated memory is still 268.4MB. Free memory was 182.4MB in the beginning and 234.7MB in the end (delta: -52.4MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. * TraceAbstraction took 875987.63ms. Allocated memory was 268.4MB in the beginning and 596.6MB in the end (delta: 328.2MB). Free memory was 233.7MB in the beginning and 397.5MB in the end (delta: -163.8MB). Peak memory consumption was 164.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 21625, independent: 19900, independent conditional: 13761, independent unconditional: 6139, dependent: 1725, dependent conditional: 1725, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19900, independent: 19900, independent conditional: 13761, independent unconditional: 6139, 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: 19900, independent: 19900, independent conditional: 13761, independent unconditional: 6139, 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: 19900, independent: 19900, independent conditional: 13761, independent unconditional: 6139, 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: 19900, independent: 19900, independent conditional: 3348, independent unconditional: 16552, 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: 19900, independent: 19900, independent conditional: 2619, independent unconditional: 17281, 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: 19900, independent: 19900, independent conditional: 2619, independent unconditional: 17281, 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: 803, independent: 803, independent conditional: 12, independent unconditional: 791, 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: 803, independent: 803, independent conditional: 0, independent unconditional: 803, 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: 19900, independent: 19097, independent conditional: 2607, independent unconditional: 16490, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 803, unknown conditional: 12, unknown unconditional: 791] , Statistics on independence cache: Total cache size (in pairs): 803, Positive cache size: 803, Positive conditional cache size: 12, Positive unconditional cache size: 791, 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: 729, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19900, independent: 19900, independent conditional: 3348, independent unconditional: 16552, 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: 19900, independent: 19900, independent conditional: 2619, independent unconditional: 17281, 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: 19900, independent: 19900, independent conditional: 2619, independent unconditional: 17281, 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: 803, independent: 803, independent conditional: 12, independent unconditional: 791, 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: 803, independent: 803, independent conditional: 0, independent unconditional: 803, 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: 19900, independent: 19097, independent conditional: 2607, independent unconditional: 16490, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 803, unknown conditional: 12, unknown unconditional: 791] , Statistics on independence cache: Total cache size (in pairs): 803, Positive cache size: 803, Positive conditional cache size: 12, Positive unconditional cache size: 791, 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: 729 ], Independence queries for same thread: 1725 - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 343 known predicates. - TimeoutResultAtElement [Line: 74]: 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 343 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 343 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 343 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 136 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 875.9s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 850.1s, 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: 522, 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.5s SatisfiabilityAnalysisTime, 24.2s InterpolantComputationTime, 801 NumberOfCodeBlocks, 801 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1146 ConstructedInterpolants, 0 QuantifiedInterpolants, 17204 SizeOfPredicates, 71 NumberOfNonLiveVariables, 778 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 29/701 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.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown