/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-04 00:33:46,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-04 00:33:46,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-04 00:33:46,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-04 00:33:46,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-04 00:33:46,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-04 00:33:46,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-04 00:33:46,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-04 00:33:46,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-04 00:33:46,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-04 00:33:46,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-04 00:33:46,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-04 00:33:46,360 INFO L153 SettingsManager]: * Use SBE=true [2024-04-04 00:33:46,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-04 00:33:46,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-04 00:33:46,362 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-04 00:33:46,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-04 00:33:46,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-04 00:33:46,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-04 00:33:46,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-04 00:33:46,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-04 00:33:46,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-04 00:33:46,363 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-04 00:33:46,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-04 00:33:46,363 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-04 00:33:46,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-04 00:33:46,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-04 00:33:46,364 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-04 00:33:46,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-04 00:33:46,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 00:33:46,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-04 00:33:46,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-04 00:33:46,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-04 00:33:46,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-04 00:33:46,365 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-04 00:33:46,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-04 00:33:46,366 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-04 00:33:46,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-04 00:33:46,366 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-04 00:33:46,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT [2024-04-04 00:33:46,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-04 00:33:46,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-04 00:33:46,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-04 00:33:46,611 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-04 00:33:46,611 INFO L274 PluginConnector]: CDTParser initialized [2024-04-04 00:33:46,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2024-04-04 00:33:47,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-04 00:33:47,832 INFO L384 CDTParser]: Found 1 translation units. [2024-04-04 00:33:47,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2024-04-04 00:33:47,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/983a80819/1bbab0a207204bc6b4460c3dcee3ac8c/FLAG65b17f98d [2024-04-04 00:33:47,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/983a80819/1bbab0a207204bc6b4460c3dcee3ac8c [2024-04-04 00:33:47,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-04 00:33:47,862 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-04 00:33:47,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-04 00:33:47,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-04 00:33:47,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-04 00:33:47,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 12:33:47" (1/1) ... [2024-04-04 00:33:47,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312fce0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:33:47, skipping insertion in model container [2024-04-04 00:33:47,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 12:33:47" (1/1) ... [2024-04-04 00:33:47,893 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-04 00:33:48,046 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2428,2441] [2024-04-04 00:33:48,053 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 00:33:48,060 INFO L202 MainTranslator]: Completed pre-run [2024-04-04 00:33:48,075 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2428,2441] [2024-04-04 00:33:48,077 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 00:33:48,089 INFO L206 MainTranslator]: Completed translation [2024-04-04 00:33:48,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:33:48 WrapperNode [2024-04-04 00:33:48,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-04 00:33:48,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-04 00:33:48,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-04 00:33:48,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-04 00:33:48,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:33:48" (1/1) ... [2024-04-04 00:33:48,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:33:48" (1/1) ... [2024-04-04 00:33:48,131 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 137 [2024-04-04 00:33:48,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-04 00:33:48,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-04 00:33:48,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-04 00:33:48,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-04 00:33:48,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:33:48" (1/1) ... [2024-04-04 00:33:48,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:33:48" (1/1) ... [2024-04-04 00:33:48,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:33:48" (1/1) ... [2024-04-04 00:33:48,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:33:48" (1/1) ... [2024-04-04 00:33:48,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:33:48" (1/1) ... [2024-04-04 00:33:48,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:33:48" (1/1) ... [2024-04-04 00:33:48,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:33:48" (1/1) ... [2024-04-04 00:33:48,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:33:48" (1/1) ... [2024-04-04 00:33:48,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-04 00:33:48,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-04 00:33:48,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-04 00:33:48,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-04 00:33:48,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:33:48" (1/1) ... [2024-04-04 00:33:48,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 00:33:48,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:33:48,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-04 00:33:48,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-04 00:33:48,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-04 00:33:48,256 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-04 00:33:48,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-04 00:33:48,256 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-04 00:33:48,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-04 00:33:48,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-04 00:33:48,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-04 00:33:48,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-04 00:33:48,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-04-04 00:33:48,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-04 00:33:48,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-04 00:33:48,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-04 00:33:48,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-04 00:33:48,258 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-04 00:33:48,325 INFO L241 CfgBuilder]: Building ICFG [2024-04-04 00:33:48,326 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-04 00:33:48,531 INFO L282 CfgBuilder]: Performing block encoding [2024-04-04 00:33:48,540 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-04 00:33:48,541 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-04-04 00:33:48,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 12:33:48 BoogieIcfgContainer [2024-04-04 00:33:48,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-04 00:33:48,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-04 00:33:48,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-04 00:33:48,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-04 00:33:48,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.04 12:33:47" (1/3) ... [2024-04-04 00:33:48,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126731b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 12:33:48, skipping insertion in model container [2024-04-04 00:33:48,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 12:33:48" (2/3) ... [2024-04-04 00:33:48,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126731b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 12:33:48, skipping insertion in model container [2024-04-04 00:33:48,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 12:33:48" (3/3) ... [2024-04-04 00:33:48,548 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2024-04-04 00:33:48,554 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-04 00:33:48,561 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-04 00:33:48,561 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-04 00:33:48,561 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-04 00:33:48,611 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-04 00:33:48,659 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-04 00:33:48,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-04 00:33:48,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:33:48,662 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-04 00:33:48,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-04-04 00:33:48,727 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-04 00:33:48,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:33:48,742 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-04 00:33:48,749 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;@7d7c896b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-04 00:33:48,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-04 00:33:48,925 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-04 00:33:48,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:33:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash -713008577, now seen corresponding path program 1 times [2024-04-04 00:33:48,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:33:48,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540352131] [2024-04-04 00:33:48,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:33:48,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:33:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:33:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-04 00:33:49,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:33:49,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540352131] [2024-04-04 00:33:49,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540352131] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 00:33:49,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 00:33:49,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-04 00:33:49,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572132121] [2024-04-04 00:33:49,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 00:33:49,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-04 00:33:49,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:33:49,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-04 00:33:49,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-04 00:33:49,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:49,405 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:33:49,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-04 00:33:49,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:49,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:49,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-04 00:33:49,475 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-04 00:33:49,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:33:49,475 INFO L85 PathProgramCache]: Analyzing trace with hash -423421568, now seen corresponding path program 1 times [2024-04-04 00:33:49,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:33:49,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121193445] [2024-04-04 00:33:49,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:33:49,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:33:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:33:49,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:33:49,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:33:49,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121193445] [2024-04-04 00:33:49,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121193445] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 00:33:49,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 00:33:49,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-04 00:33:49,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389141340] [2024-04-04 00:33:49,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 00:33:49,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-04 00:33:49,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:33:49,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-04 00:33:49,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-04-04 00:33:49,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:49,897 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:33:49,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-04 00:33:49,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:49,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:50,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-04 00:33:50,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-04 00:33:50,049 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-04 00:33:50,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:33:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash -510566555, now seen corresponding path program 1 times [2024-04-04 00:33:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:33:50,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861428999] [2024-04-04 00:33:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:33:50,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:33:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:33:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-04-04 00:33:50,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:33:50,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861428999] [2024-04-04 00:33:50,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861428999] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 00:33:50,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 00:33:50,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-04 00:33:50,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146737843] [2024-04-04 00:33:50,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 00:33:50,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-04 00:33:50,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:33:50,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-04 00:33:50,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-04-04 00:33:50,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:50,415 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:33:50,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-04 00:33:50,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:50,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-04 00:33:50,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-04 00:33:50,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-04 00:33:50,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-04 00:33:50,508 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-04 00:33:50,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:33:50,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1786374414, now seen corresponding path program 1 times [2024-04-04 00:33:50,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:33:50,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843035828] [2024-04-04 00:33:50,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:33:50,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:33:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:33:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:33:51,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:33:51,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843035828] [2024-04-04 00:33:51,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843035828] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 00:33:51,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997413674] [2024-04-04 00:33:51,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:33:51,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:33:51,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:33:51,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-04 00:33:51,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-04 00:33:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:33:52,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 47 conjunts are in the unsatisfiable core [2024-04-04 00:33:52,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 00:33:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:33:53,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 00:33:53,664 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2024-04-04 00:33:53,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 82 [2024-04-04 00:33:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-04 00:33:54,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997413674] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 00:33:54,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 00:33:54,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 22] total 53 [2024-04-04 00:33:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951231513] [2024-04-04 00:33:54,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 00:33:54,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-04-04 00:33:54,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:33:54,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-04-04 00:33:54,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=2396, Unknown=0, NotChecked=0, Total=2756 [2024-04-04 00:33:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:54,417 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:33:54,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 6.113207547169812) internal successors, (324), 53 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-04 00:33:54,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:54,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-04 00:33:54,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-04 00:33:54,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:55,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-04 00:33:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-04 00:33:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-04-04 00:33:55,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-04-04 00:33:56,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:33:56,141 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-04 00:33:56,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:33:56,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1380064860, now seen corresponding path program 2 times [2024-04-04 00:33:56,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:33:56,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893013015] [2024-04-04 00:33:56,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:33:56,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:33:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:33:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-04 00:33:56,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:33:56,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893013015] [2024-04-04 00:33:56,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893013015] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 00:33:56,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601342305] [2024-04-04 00:33:56,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-04 00:33:56,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:33:56,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:33:56,819 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-04 00:33:56,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-04-04 00:33:57,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-04 00:33:57,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 00:33:57,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 27 conjunts are in the unsatisfiable core [2024-04-04 00:33:57,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 00:33:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-04 00:33:57,658 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 00:33:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-04 00:33:58,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601342305] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 00:33:58,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 00:33:58,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2024-04-04 00:33:58,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338633333] [2024-04-04 00:33:58,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 00:33:58,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-04-04 00:33:58,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:33:58,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-04-04 00:33:58,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2024-04-04 00:33:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:58,605 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:33:58,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 9.261904761904763) internal successors, (389), 42 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-04 00:33:58,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:33:58,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-04 00:33:58,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-04 00:33:58,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-04-04 00:33:58,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:34:02,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:34:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-04 00:34:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-04 00:34:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-04-04 00:34:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-04-04 00:34:02,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-04-04 00:34:02,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:34:02,542 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-04 00:34:02,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 00:34:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash -453621307, now seen corresponding path program 3 times [2024-04-04 00:34:02,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 00:34:02,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21955449] [2024-04-04 00:34:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 00:34:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 00:34:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 00:34:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 6 proven. 576 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-04 00:34:04,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 00:34:04,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21955449] [2024-04-04 00:34:04,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21955449] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 00:34:04,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266199466] [2024-04-04 00:34:04,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-04 00:34:04,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:34:04,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 00:34:04,097 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-04 00:34:04,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-04-04 00:34:04,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-04-04 00:34:04,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 00:34:04,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 54 conjunts are in the unsatisfiable core [2024-04-04 00:34:04,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 00:34:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 6 proven. 576 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-04 00:34:05,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 00:34:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 6 proven. 576 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-04 00:34:07,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266199466] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 00:34:07,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 00:34:07,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 29, 29] total 70 [2024-04-04 00:34:07,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355080783] [2024-04-04 00:34:07,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 00:34:07,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-04-04 00:34:07,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 00:34:07,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-04-04 00:34:07,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=4480, Unknown=0, NotChecked=0, Total=4830 [2024-04-04 00:34:07,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:34:07,705 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 00:34:07,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 9.614285714285714) internal successors, (673), 70 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-04 00:34:07,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:34:07,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-04 00:34:07,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-04 00:34:07,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-04-04 00:34:07,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-04-04 00:34:07,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 00:36:09,288 WARN L293 SmtUtils]: Spent 37.26s on a formula simplification. DAG size of input: 78 DAG size of output: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 00:36:10,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:36:13,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:36:15,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:36:17,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:37:36,913 WARN L293 SmtUtils]: Spent 26.23s on a formula simplification. DAG size of input: 65 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 00:37:39,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:37:41,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:37:45,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:37:47,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:37:49,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:37:55,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:37:57,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:38:03,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:38:05,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:38:08,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:38:10,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:38:12,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:38:15,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:39:44,944 WARN L293 SmtUtils]: Spent 29.04s on a formula simplification. DAG size of input: 78 DAG size of output: 63 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 00:39:46,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:39:49,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:39:53,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:39:55,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:39:58,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:40:00,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:40:02,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:40:04,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:40:06,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:40:08,325 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* (div (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 2) 2)) (.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 4) 4294967296) 1)) (.cse2 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)) (.cse3 (+ (mod (+ 2 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (.cse1 (* 2 (div (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2))) (.cse4 (* (div (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2) 2)) (.cse6 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse7 (* (mod c_~n~0 2147483648) 2))) (and (< .cse0 (+ (mod (+ 3 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)) (< .cse1 .cse2) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3) 4294967296) 1)) (< .cse0 .cse3) (< .cse4 .cse5) (< .cse0 .cse5) (< (div (mod (+ 6 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2) 4) (< (* (div .cse6 2) 2) .cse2) (< .cse1 .cse3) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post6#1| 1) 4294967296) 1)) (< .cse4 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) .cse7) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) .cse7) (< .cse6 .cse7))) is different from false [2024-04-04 00:40:26,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:41:35,931 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification. DAG size of input: 66 DAG size of output: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 00:42:53,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:42:55,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:43:46,394 WARN L293 SmtUtils]: Spent 12.88s on a formula simplification. DAG size of input: 68 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 00:44:12,737 WARN L293 SmtUtils]: Spent 7.09s on a formula simplification. DAG size of input: 54 DAG size of output: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 00:44:58,913 WARN L293 SmtUtils]: Spent 16.94s on a formula simplification. DAG size of input: 67 DAG size of output: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 00:45:02,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:45:58,387 WARN L293 SmtUtils]: Spent 16.77s on a formula simplification. DAG size of input: 70 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 00:47:08,594 WARN L293 SmtUtils]: Spent 23.24s on a formula simplification. DAG size of input: 75 DAG size of output: 71 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 00:47:12,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:47:13,724 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-04-04 00:47:15,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:48:03,464 WARN L293 SmtUtils]: Spent 12.19s on a formula simplification. DAG size of input: 67 DAG size of output: 63 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 00:48:05,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:48:12,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 00:48:14,564 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* (div (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 2) 2)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 4) 4294967296) 1)) (.cse4 (* 2 (div (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2))) (.cse3 (* (div (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2) 2)) (.cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (.cse5 (+ (mod (+ 2 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (.cse6 (* (mod c_~n~0 2147483648) 2))) (and (< (* (div (mod (+ 6 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 2) 2) .cse0) (< (* 2 (div (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 2)) .cse1) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3) 4294967296) 1)) (< .cse3 .cse1) (< .cse2 .cse1) (< .cse3 .cse0) (< .cse4 .cse5) (< (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) .cse6) (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) .cse6) (< .cse3 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse6) (< (* 2 (div (mod (+ 6 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2)) .cse0) (< (* 2 (div (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 2)) .cse5) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) .cse6))) is different from false Received shutdown request... [2024-04-04 00:48:23,373 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-04 00:48:23,380 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-04-04 00:48:23,393 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-04 00:48:24,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-04-04 00:48:24,406 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-04-04 00:48:24,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2024-04-04 00:48:24,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 00:48:24,606 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-04-04 00:48:24,608 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-04-04 00:48:24,608 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-04-04 00:48:24,609 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-04-04 00:48:24,612 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-04-04 00:48:24,616 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-04 00:48:24,616 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-04 00:48:24,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.04 12:48:24 BasicIcfg [2024-04-04 00:48:24,618 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-04 00:48:24,619 INFO L158 Benchmark]: Toolchain (without parser) took 876756.86ms. Allocated memory was 158.3MB in the beginning and 552.6MB in the end (delta: 394.3MB). Free memory was 90.4MB in the beginning and 378.1MB in the end (delta: -287.7MB). Peak memory consumption was 106.9MB. Max. memory is 8.0GB. [2024-04-04 00:48:24,619 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 158.3MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-04 00:48:24,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.96ms. Allocated memory was 158.3MB in the beginning and 220.2MB in the end (delta: 61.9MB). Free memory was 90.3MB in the beginning and 187.5MB in the end (delta: -97.2MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2024-04-04 00:48:24,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.04ms. Allocated memory is still 220.2MB. Free memory was 187.0MB in the beginning and 185.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-04 00:48:24,619 INFO L158 Benchmark]: Boogie Preprocessor took 52.10ms. Allocated memory is still 220.2MB. Free memory was 185.4MB in the beginning and 183.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-04 00:48:24,619 INFO L158 Benchmark]: RCFGBuilder took 356.98ms. Allocated memory is still 220.2MB. Free memory was 183.8MB in the beginning and 166.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-04-04 00:48:24,619 INFO L158 Benchmark]: TraceAbstraction took 876074.33ms. Allocated memory was 220.2MB in the beginning and 552.6MB in the end (delta: 332.4MB). Free memory was 164.9MB in the beginning and 378.1MB in the end (delta: -213.2MB). Peak memory consumption was 118.7MB. Max. memory is 8.0GB. [2024-04-04 00:48:24,620 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.51ms. Allocated memory is still 158.3MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.96ms. Allocated memory was 158.3MB in the beginning and 220.2MB in the end (delta: 61.9MB). Free memory was 90.3MB in the beginning and 187.5MB in the end (delta: -97.2MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.04ms. Allocated memory is still 220.2MB. Free memory was 187.0MB in the beginning and 185.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.10ms. Allocated memory is still 220.2MB. Free memory was 185.4MB in the beginning and 183.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 356.98ms. Allocated memory is still 220.2MB. Free memory was 183.8MB in the beginning and 166.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 876074.33ms. Allocated memory was 220.2MB in the beginning and 552.6MB in the end (delta: 332.4MB). Free memory was 164.9MB in the beginning and 378.1MB in the end (delta: -213.2MB). Peak memory consumption was 118.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8481, independent: 6753, independent conditional: 6750, independent unconditional: 3, dependent: 1728, dependent conditional: 1710, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6753, independent: 6753, independent conditional: 6750, independent unconditional: 3, 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: 6753, independent: 6753, independent conditional: 6750, independent unconditional: 3, 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: 6753, independent: 6753, independent conditional: 6750, independent unconditional: 3, 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: 6753, independent: 6753, independent conditional: 1163, independent unconditional: 5590, 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: 6753, independent: 6753, independent conditional: 1042, independent unconditional: 5711, 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: 6753, independent: 6753, independent conditional: 1042, independent unconditional: 5711, 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: 1149, independent: 1149, independent conditional: 34, independent unconditional: 1115, 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: 1149, independent: 1149, independent conditional: 0, independent unconditional: 1149, 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: 6753, independent: 5604, independent conditional: 1008, independent unconditional: 4596, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1149, unknown conditional: 34, unknown unconditional: 1115] , Statistics on independence cache: Total cache size (in pairs): 1149, Positive cache size: 1149, Positive conditional cache size: 34, Positive unconditional cache size: 1115, 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: 121, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6753, independent: 6753, independent conditional: 1163, independent unconditional: 5590, 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: 6753, independent: 6753, independent conditional: 1042, independent unconditional: 5711, 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: 6753, independent: 6753, independent conditional: 1042, independent unconditional: 5711, 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: 1149, independent: 1149, independent conditional: 34, independent unconditional: 1115, 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: 1149, independent: 1149, independent conditional: 0, independent unconditional: 1149, 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: 6753, independent: 5604, independent conditional: 1008, independent unconditional: 4596, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1149, unknown conditional: 34, unknown unconditional: 1115] , Statistics on independence cache: Total cache size (in pairs): 1149, Positive cache size: 1149, Positive conditional cache size: 34, Positive unconditional cache size: 1115, 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: 121 ], Independence queries for same thread: 1728 - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 209 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 875.9s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 862.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: 246, 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.9s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 1754 NumberOfCodeBlocks, 1754 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2435 ConstructedInterpolants, 0 QuantifiedInterpolants, 20094 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1242 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 97/2082 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown