/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 NONE -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-04 20:10:07,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-04 20:10:07,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-04 20:10:07,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-04 20:10:07,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-04 20:10:07,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-04 20:10:07,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-04 20:10:07,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-04 20:10:07,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-04 20:10:07,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-04 20:10:07,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-04 20:10:07,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-04 20:10:07,975 INFO L153 SettingsManager]: * Use SBE=true [2024-05-04 20:10:07,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-04 20:10:07,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-04 20:10:07,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-04 20:10:07,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-04 20:10:07,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-04 20:10:07,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-04 20:10:07,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-04 20:10:07,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-04 20:10:07,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-04 20:10:07,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-04 20:10:07,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-04 20:10:07,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-04 20:10:07,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-04 20:10:07,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-04 20:10:07,980 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-04 20:10:07,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-04 20:10:07,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 20:10:07,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-04 20:10:07,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-04 20:10:07,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-04 20:10:07,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-04 20:10:07,982 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-04 20:10:07,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-04 20:10:07,982 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-04 20:10:07,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-04 20:10:07,982 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-04 20:10:07,983 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 -> NONE [2024-05-04 20:10:08,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-04 20:10:08,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-04 20:10:08,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-04 20:10:08,250 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-04 20:10:08,250 INFO L274 PluginConnector]: CDTParser initialized [2024-05-04 20:10:08,251 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-04 20:10:09,413 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-04 20:10:09,598 INFO L384 CDTParser]: Found 1 translation units. [2024-05-04 20:10:09,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2024-05-04 20:10:09,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5fbcb63d5/2331550800e143d6a3d6cf949a3441d6/FLAG9262abc97 [2024-05-04 20:10:09,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5fbcb63d5/2331550800e143d6a3d6cf949a3441d6 [2024-05-04 20:10:09,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-04 20:10:09,621 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-04 20:10:09,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-04 20:10:09,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-04 20:10:09,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-04 20:10:09,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:10:09" (1/1) ... [2024-05-04 20:10:09,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68bb5084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:10:09, skipping insertion in model container [2024-05-04 20:10:09,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:10:09" (1/1) ... [2024-05-04 20:10:09,661 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-04 20:10:09,809 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-04 20:10:09,813 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-04 20:10:09,821 INFO L202 MainTranslator]: Completed pre-run [2024-05-04 20:10:09,842 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-04 20:10:09,843 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-04 20:10:09,857 INFO L206 MainTranslator]: Completed translation [2024-05-04 20:10:09,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:10:09 WrapperNode [2024-05-04 20:10:09,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-04 20:10:09,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-04 20:10:09,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-04 20:10:09,859 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-04 20:10:09,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:10:09" (1/1) ... [2024-05-04 20:10:09,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:10:09" (1/1) ... [2024-05-04 20:10:09,892 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-05-04 20:10:09,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-04 20:10:09,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-04 20:10:09,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-04 20:10:09,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-04 20:10:09,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:10:09" (1/1) ... [2024-05-04 20:10:09,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:10:09" (1/1) ... [2024-05-04 20:10:09,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:10:09" (1/1) ... [2024-05-04 20:10:09,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:10:09" (1/1) ... [2024-05-04 20:10:09,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:10:09" (1/1) ... [2024-05-04 20:10:09,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:10:09" (1/1) ... [2024-05-04 20:10:09,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:10:09" (1/1) ... [2024-05-04 20:10:09,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:10:09" (1/1) ... [2024-05-04 20:10:09,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-04 20:10:09,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-04 20:10:09,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-04 20:10:09,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-04 20:10:09,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:10:09" (1/1) ... [2024-05-04 20:10:09,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 20:10:09,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 20:10:09,970 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-04 20:10:09,993 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-04 20:10:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-04 20:10:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-04 20:10:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-04 20:10:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-04 20:10:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-04 20:10:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-04 20:10:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-04 20:10:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-04 20:10:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-04 20:10:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-04 20:10:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-04 20:10:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-04 20:10:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-04 20:10:10,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-04 20:10:10,026 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-04 20:10:10,118 INFO L241 CfgBuilder]: Building ICFG [2024-05-04 20:10:10,120 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-04 20:10:10,292 INFO L282 CfgBuilder]: Performing block encoding [2024-05-04 20:10:10,302 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-04 20:10:10,303 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-04 20:10:10,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:10:10 BoogieIcfgContainer [2024-05-04 20:10:10,304 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-04 20:10:10,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-04 20:10:10,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-04 20:10:10,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-04 20:10:10,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 08:10:09" (1/3) ... [2024-05-04 20:10:10,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8e9f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:10:10, skipping insertion in model container [2024-05-04 20:10:10,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:10:09" (2/3) ... [2024-05-04 20:10:10,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8e9f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:10:10, skipping insertion in model container [2024-05-04 20:10:10,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:10:10" (3/3) ... [2024-05-04 20:10:10,312 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2024-05-04 20:10:10,319 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-04 20:10:10,340 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-04 20:10:10,341 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-04 20:10:10,341 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-04 20:10:10,460 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-04 20:10:10,495 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-04 20:10:10,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-04 20:10:10,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 20:10:10,497 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-04 20:10:10,499 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-04 20:10:10,546 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-04 20:10:10,559 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-04 20:10:10,566 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;@12d14b64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=NONE, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-04 20:10:10,567 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-04 20:10:10,828 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-04 20:10:10,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 20:10:10,833 INFO L85 PathProgramCache]: Analyzing trace with hash -445322638, now seen corresponding path program 1 times [2024-05-04 20:10:10,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 20:10:10,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596790229] [2024-05-04 20:10:10,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 20:10:10,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 20:10:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 20:10:11,156 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-04 20:10:11,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 20:10:11,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596790229] [2024-05-04 20:10:11,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596790229] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 20:10:11,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 20:10:11,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-04 20:10:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137528494] [2024-05-04 20:10:11,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 20:10:11,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-04 20:10:11,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 20:10:11,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-04 20:10:11,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-04 20:10:11,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 20:10:11,188 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 20:10:11,189 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-04 20:10:11,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 20:10:11,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 20:10:11,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-04 20:10:11,266 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-04 20:10:11,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 20:10:11,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1122714043, now seen corresponding path program 1 times [2024-05-04 20:10:11,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 20:10:11,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023359092] [2024-05-04 20:10:11,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 20:10:11,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 20:10:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 20:10:12,666 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-04 20:10:12,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 20:10:12,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023359092] [2024-05-04 20:10:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023359092] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 20:10:12,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566881974] [2024-05-04 20:10:12,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 20:10:12,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 20:10:12,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 20:10:12,706 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-04 20:10:12,710 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-04 20:10:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 20:10:12,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 24 conjunts are in the unsatisfiable core [2024-05-04 20:10:12,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 20:10:13,348 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-04 20:10:13,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 20:10:14,086 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-04 20:10:14,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566881974] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 20:10:14,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 20:10:14,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 35 [2024-05-04 20:10:14,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699953530] [2024-05-04 20:10:14,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 20:10:14,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-05-04 20:10:14,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 20:10:14,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-05-04 20:10:14,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2024-05-04 20:10:14,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 20:10:14,092 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 20:10:14,093 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-04 20:10:14,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 20:10:14,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 20:10:16,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 20:10:16,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-04 20:10:16,191 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-04 20:10:16,386 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-04 20:10:16,387 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-04 20:10:16,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 20:10:16,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1115789919, now seen corresponding path program 1 times [2024-05-04 20:10:16,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 20:10:16,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520695333] [2024-05-04 20:10:16,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 20:10:16,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 20:10:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 20:10:18,123 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-04 20:10:18,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 20:10:18,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520695333] [2024-05-04 20:10:18,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520695333] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 20:10:18,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665205961] [2024-05-04 20:10:18,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 20:10:18,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 20:10:18,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 20:10:18,129 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-04 20:10:18,151 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-04 20:10:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 20:10:18,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 40 conjunts are in the unsatisfiable core [2024-05-04 20:10:18,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 20:10:21,936 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-04 20:10:21,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 20:10:26,771 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-04 20:10:26,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665205961] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 20:10:26,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 20:10:26,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 60 [2024-05-04 20:10:26,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997674968] [2024-05-04 20:10:26,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 20:10:26,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-05-04 20:10:26,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 20:10:26,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-05-04 20:10:26,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=3169, Unknown=0, NotChecked=0, Total=3540 [2024-05-04 20:10:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 20:10:26,776 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 20:10:26,776 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-04 20:10:26,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 20:10:26,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-05-04 20:10:26,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 20:11:08,609 WARN L293 SmtUtils]: Spent 6.39s 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-04 20:11:17,958 WARN L293 SmtUtils]: Spent 6.17s 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-04 20:12:16,919 WARN L293 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 117 DAG size of output: 113 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-04 20:12:38,665 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-04 20:13:04,361 WARN L293 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 122 DAG size of output: 117 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-04 20:13:17,835 WARN L293 SmtUtils]: Spent 8.45s 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-04 20:13:27,325 WARN L293 SmtUtils]: Spent 5.86s 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-04 20:13:29,329 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-04 20:13:51,157 WARN L293 SmtUtils]: Spent 9.12s 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-04 20:13:52,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 20:14:48,815 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-04 20:14:50,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 20:14:50,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-04 20:14:50,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2024-05-04 20:14:50,164 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-04 20:14:50,356 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-04 20:14:50,357 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-04 20:14:50,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 20:14:50,357 INFO L85 PathProgramCache]: Analyzing trace with hash -176537540, now seen corresponding path program 2 times [2024-05-04 20:14:50,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 20:14:50,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676624558] [2024-05-04 20:14:50,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 20:14:50,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 20:14:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 20:14:52,836 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-04 20:14:52,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 20:14:52,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676624558] [2024-05-04 20:14:52,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676624558] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 20:14:52,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690773360] [2024-05-04 20:14:52,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-04 20:14:52,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 20:14:52,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 20:14:52,839 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-04 20:14:52,841 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-04 20:14:52,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-04 20:14:52,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-04 20:14:52,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 74 conjunts are in the unsatisfiable core [2024-05-04 20:14:52,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 20:14:55,171 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-04 20:14:55,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 20:15:02,363 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-04 20:15:02,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690773360] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 20:15:02,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 20:15:02,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 39] total 110 [2024-05-04 20:15:02,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873666916] [2024-05-04 20:15:02,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 20:15:02,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2024-05-04 20:15:02,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 20:15:02,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2024-05-04 20:15:02,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=696, Invalid=11294, Unknown=0, NotChecked=0, Total=11990 [2024-05-04 20:15:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 20:15:02,375 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 20:15:02,375 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-04 20:15:02,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 20:15:02,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-05-04 20:15:02,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 228 states. [2024-05-04 20:15:02,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 20:15:29,907 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-04 20:17:21,687 WARN L293 SmtUtils]: Spent 19.16s 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-04 20:18:49,251 WARN L293 SmtUtils]: Spent 28.10s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-04 20:18:52,162 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-04 20:18:54,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 20:18:56,330 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-04 20:18:58,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 20:21:04,094 WARN L293 SmtUtils]: Spent 49.91s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-04 20:21:06,098 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-04 20:21:07,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-04 20:21:09,502 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-04 20:23:20,924 WARN L293 SmtUtils]: Spent 1.35m on a formula simplification that was a NOOP. DAG size: 117 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-04 20:23:22,929 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-04 20:23:24,935 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-04 20:23:26,941 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-04 20:24:37,236 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-04 20:24:37,236 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-04 20:24:37,236 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-04 20:24:38,010 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-04 20:24:38,203 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-04 20:24:38,204 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 339 known predicates. [2024-05-04 20:24:38,206 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-04 20:24:38,206 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-04 20:24:38,207 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-04 20:24:38,207 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-04 20:24:38,210 INFO L448 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-05-04 20:24:38,214 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-04 20:24:38,214 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-04 20:24:38,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 08:24:38 BasicIcfg [2024-05-04 20:24:38,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-04 20:24:38,216 INFO L158 Benchmark]: Toolchain (without parser) took 868595.10ms. Allocated memory was 229.6MB in the beginning and 503.3MB in the end (delta: 273.7MB). Free memory was 157.6MB in the beginning and 328.7MB in the end (delta: -171.1MB). Peak memory consumption was 103.4MB. Max. memory is 8.0GB. [2024-05-04 20:24:38,216 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 229.6MB. Free memory is still 198.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-04 20:24:38,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.73ms. Allocated memory is still 229.6MB. Free memory was 157.3MB in the beginning and 146.2MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-04 20:24:38,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.98ms. Allocated memory is still 229.6MB. Free memory was 145.9MB in the beginning and 144.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-04 20:24:38,217 INFO L158 Benchmark]: Boogie Preprocessor took 21.88ms. Allocated memory is still 229.6MB. Free memory was 144.5MB in the beginning and 143.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-04 20:24:38,217 INFO L158 Benchmark]: RCFGBuilder took 383.99ms. Allocated memory is still 229.6MB. Free memory was 143.2MB in the beginning and 128.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-04 20:24:38,218 INFO L158 Benchmark]: TraceAbstraction took 867908.97ms. Allocated memory was 229.6MB in the beginning and 503.3MB in the end (delta: 273.7MB). Free memory was 127.4MB in the beginning and 328.7MB in the end (delta: -201.2MB). Peak memory consumption was 72.9MB. Max. memory is 8.0GB. [2024-05-04 20:24:38,219 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 229.6MB. Free memory is still 198.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.73ms. Allocated memory is still 229.6MB. Free memory was 157.3MB in the beginning and 146.2MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.98ms. Allocated memory is still 229.6MB. Free memory was 145.9MB in the beginning and 144.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.88ms. Allocated memory is still 229.6MB. Free memory was 144.5MB in the beginning and 143.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 383.99ms. Allocated memory is still 229.6MB. Free memory was 143.2MB in the beginning and 128.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 867908.97ms. Allocated memory was 229.6MB in the beginning and 503.3MB in the end (delta: 273.7MB). Free memory was 127.4MB in the beginning and 328.7MB in the end (delta: -201.2MB). Peak memory consumption was 72.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: 12088, independent: 10371, independent conditional: 10371, independent unconditional: 0, dependent: 1717, dependent conditional: 1717, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10371, independent: 10371, independent conditional: 10371, independent unconditional: 0, 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: 10371, independent: 10371, independent conditional: 10371, independent unconditional: 0, 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: 10371, independent: 10371, independent conditional: 10371, independent unconditional: 0, 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: 10371, independent: 10371, independent conditional: 0, independent unconditional: 10371, 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: 10371, independent: 10371, independent conditional: 0, independent unconditional: 10371, 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: 10371, independent: 10371, independent conditional: 0, independent unconditional: 10371, 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: 686, independent: 686, independent conditional: 0, independent unconditional: 686, 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: 686, independent: 686, independent conditional: 0, independent unconditional: 686, 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: 10371, independent: 9685, independent conditional: 0, independent unconditional: 9685, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 686, unknown conditional: 0, unknown unconditional: 686] , Statistics on independence cache: Total cache size (in pairs): 686, Positive cache size: 686, Positive conditional cache size: 0, Positive unconditional cache size: 686, 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: 0, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10371, independent: 10371, independent conditional: 0, independent unconditional: 10371, 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: 10371, independent: 10371, independent conditional: 0, independent unconditional: 10371, 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: 10371, independent: 10371, independent conditional: 0, independent unconditional: 10371, 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: 686, independent: 686, independent conditional: 0, independent unconditional: 686, 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: 686, independent: 686, independent conditional: 0, independent unconditional: 686, 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: 10371, independent: 9685, independent conditional: 0, independent unconditional: 9685, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 686, unknown conditional: 0, unknown unconditional: 686] , Statistics on independence cache: Total cache size (in pairs): 686, Positive cache size: 686, Positive conditional cache size: 0, Positive unconditional cache size: 686, 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: 0 ], Independence queries for same thread: 1717 - 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 339 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 339 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 339 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 339 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: 867.7s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 841.4s, 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: 515, 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.6s SatisfiabilityAnalysisTime, 24.6s 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.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown