/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 06:32:24,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 06:32:24,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 06:32:24,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 06:32:24,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 06:32:24,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 06:32:24,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 06:32:24,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 06:32:24,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 06:32:24,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 06:32:24,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 06:32:24,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 06:32:24,469 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 06:32:24,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 06:32:24,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 06:32:24,470 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 06:32:24,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 06:32:24,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 06:32:24,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 06:32:24,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 06:32:24,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 06:32:24,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 06:32:24,471 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 06:32:24,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 06:32:24,472 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 06:32:24,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 06:32:24,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 06:32:24,472 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 06:32:24,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 06:32:24,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 06:32:24,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 06:32:24,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 06:32:24,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 06:32:24,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 06:32:24,474 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 06:32:24,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 06:32:24,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 06:32:24,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 06:32:24,475 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 06:32:24,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 [2024-04-05 06:32:24,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 06:32:24,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 06:32:24,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 06:32:24,754 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 06:32:24,754 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 06:32:24,755 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-05 06:32:25,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 06:32:25,957 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 06:32:25,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2024-04-05 06:32:25,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e469dae9c/7c3a5d1fd80f48e2b96ab7dbe01000e6/FLAGccbe22255 [2024-04-05 06:32:25,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e469dae9c/7c3a5d1fd80f48e2b96ab7dbe01000e6 [2024-04-05 06:32:25,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 06:32:25,996 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 06:32:25,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 06:32:25,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 06:32:26,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 06:32:26,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:32:25" (1/1) ... [2024-04-05 06:32:26,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee4e4d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:32:26, skipping insertion in model container [2024-04-05 06:32:26,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:32:25" (1/1) ... [2024-04-05 06:32:26,030 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 06:32:26,192 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-05 06:32:26,206 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 06:32:26,216 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 06:32:26,247 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-05 06:32:26,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 06:32:26,266 INFO L206 MainTranslator]: Completed translation [2024-04-05 06:32:26,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:32:26 WrapperNode [2024-04-05 06:32:26,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 06:32:26,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 06:32:26,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 06:32:26,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 06:32:26,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:32:26" (1/1) ... [2024-04-05 06:32:26,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:32:26" (1/1) ... [2024-04-05 06:32:26,315 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 137 [2024-04-05 06:32:26,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 06:32:26,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 06:32:26,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 06:32:26,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 06:32:26,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:32:26" (1/1) ... [2024-04-05 06:32:26,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:32:26" (1/1) ... [2024-04-05 06:32:26,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:32:26" (1/1) ... [2024-04-05 06:32:26,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:32:26" (1/1) ... [2024-04-05 06:32:26,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:32:26" (1/1) ... [2024-04-05 06:32:26,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:32:26" (1/1) ... [2024-04-05 06:32:26,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:32:26" (1/1) ... [2024-04-05 06:32:26,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:32:26" (1/1) ... [2024-04-05 06:32:26,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 06:32:26,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 06:32:26,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 06:32:26,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 06:32:26,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:32:26" (1/1) ... [2024-04-05 06:32:26,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 06:32:26,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 06:32:26,389 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-05 06:32:26,395 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-05 06:32:26,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 06:32:26,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-05 06:32:26,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-05 06:32:26,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-05 06:32:26,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-05 06:32:26,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 06:32:26,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 06:32:26,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 06:32:26,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-04-05 06:32:26,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 06:32:26,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 06:32:26,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 06:32:26,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 06:32:26,429 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 06:32:26,500 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 06:32:26,502 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 06:32:26,688 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 06:32:26,698 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 06:32:26,698 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-04-05 06:32:26,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:32:26 BoogieIcfgContainer [2024-04-05 06:32:26,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 06:32:26,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 06:32:26,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 06:32:26,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 06:32:26,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 06:32:25" (1/3) ... [2024-04-05 06:32:26,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f0862c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:32:26, skipping insertion in model container [2024-04-05 06:32:26,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:32:26" (2/3) ... [2024-04-05 06:32:26,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f0862c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:32:26, skipping insertion in model container [2024-04-05 06:32:26,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:32:26" (3/3) ... [2024-04-05 06:32:26,706 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2024-04-05 06:32:26,713 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 06:32:26,721 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 06:32:26,721 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 06:32:26,721 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 06:32:26,779 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-05 06:32:26,821 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 06:32:26,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 06:32:26,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 06:32:26,825 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-05 06:32:26,833 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-05 06:32:26,872 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 06:32:26,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 06:32:26,884 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 06:32:26,889 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;@d3877a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213 [2024-04-05 06:32:26,890 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-05 06:32:27,312 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-05 06:32:27,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 06:32:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash -713008577, now seen corresponding path program 1 times [2024-04-05 06:32:27,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 06:32:27,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973194701] [2024-04-05 06:32:27,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 06:32:27,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 06:32:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 06:32:27,514 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-05 06:32:27,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 06:32:27,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973194701] [2024-04-05 06:32:27,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973194701] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 06:32:27,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 06:32:27,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 06:32:27,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744407076] [2024-04-05 06:32:27,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 06:32:27,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 06:32:27,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 06:32:27,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 06:32:27,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 06:32:27,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:27,628 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 06:32:27,629 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-05 06:32:27,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:27,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:27,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 06:32:27,786 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-05 06:32:27,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 06:32:27,787 INFO L85 PathProgramCache]: Analyzing trace with hash -423421568, now seen corresponding path program 1 times [2024-04-05 06:32:27,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 06:32:27,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518158767] [2024-04-05 06:32:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 06:32:27,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 06:32:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 06:32:28,252 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-05 06:32:28,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 06:32:28,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518158767] [2024-04-05 06:32:28,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518158767] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 06:32:28,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 06:32:28,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-05 06:32:28,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927395854] [2024-04-05 06:32:28,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 06:32:28,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-05 06:32:28,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 06:32:28,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-05 06:32:28,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-04-05 06:32:28,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:28,257 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 06:32:28,257 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-05 06:32:28,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:28,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:28,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:28,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 06:32:28,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 06:32:28,446 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-05 06:32:28,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 06:32:28,447 INFO L85 PathProgramCache]: Analyzing trace with hash -510566555, now seen corresponding path program 1 times [2024-04-05 06:32:28,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 06:32:28,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790725165] [2024-04-05 06:32:28,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 06:32:28,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 06:32:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 06:32:28,786 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-05 06:32:28,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 06:32:28,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790725165] [2024-04-05 06:32:28,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790725165] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 06:32:28,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 06:32:28,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 06:32:28,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958646441] [2024-04-05 06:32:28,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 06:32:28,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 06:32:28,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 06:32:28,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 06:32:28,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-04-05 06:32:28,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:28,792 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 06:32:28,792 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-05 06:32:28,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:28,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-05 06:32:28,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:28,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 06:32:28,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 06:32:28,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-05 06:32:28,965 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-05 06:32:28,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 06:32:28,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1786374414, now seen corresponding path program 1 times [2024-04-05 06:32:28,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 06:32:28,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063204488] [2024-04-05 06:32:28,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 06:32:28,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 06:32:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 06:32:30,327 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-05 06:32:30,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 06:32:30,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063204488] [2024-04-05 06:32:30,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063204488] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 06:32:30,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091144624] [2024-04-05 06:32:30,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 06:32:30,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 06:32:30,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 06:32:30,370 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-05 06:32:30,374 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-05 06:32:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 06:32:30,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 47 conjunts are in the unsatisfiable core [2024-04-05 06:32:30,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 06:32:31,539 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-05 06:32:31,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 06:32:32,089 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2024-04-05 06:32:32,090 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-05 06:32:32,675 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-05 06:32:32,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091144624] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 06:32:32,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 06:32:32,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 22] total 53 [2024-04-05 06:32:32,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176024711] [2024-04-05 06:32:32,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 06:32:32,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-04-05 06:32:32,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 06:32:32,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-04-05 06:32:32,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=2396, Unknown=0, NotChecked=0, Total=2756 [2024-04-05 06:32:32,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:32,686 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 06:32:32,686 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-05 06:32:32,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:32,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-05 06:32:32,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 06:32:32,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:34,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 06:32:34,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 06:32:34,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-04-05 06:32:34,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-04-05 06:32:34,412 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-05 06:32:34,412 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-05 06:32:34,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 06:32:34,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1380064860, now seen corresponding path program 2 times [2024-04-05 06:32:34,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 06:32:34,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23786601] [2024-04-05 06:32:34,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 06:32:34,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 06:32:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 06:32:35,139 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-05 06:32:35,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 06:32:35,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23786601] [2024-04-05 06:32:35,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23786601] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 06:32:35,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588698096] [2024-04-05 06:32:35,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 06:32:35,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 06:32:35,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 06:32:35,141 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-05 06:32:35,160 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-05 06:32:35,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-05 06:32:35,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 06:32:35,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 27 conjunts are in the unsatisfiable core [2024-04-05 06:32:35,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 06:32:36,011 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-05 06:32:36,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 06:32:36,902 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-05 06:32:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588698096] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 06:32:36,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 06:32:36,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2024-04-05 06:32:36,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175375311] [2024-04-05 06:32:36,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 06:32:36,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-04-05 06:32:36,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 06:32:36,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-04-05 06:32:36,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2024-04-05 06:32:36,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:36,905 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 06:32:36,905 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-05 06:32:36,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:36,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-05 06:32:36,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 06:32:36,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-04-05 06:32:36,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:41,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:41,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-05 06:32:41,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 06:32:41,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-04-05 06:32:41,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-04-05 06:32:41,081 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-05 06:32:41,280 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-05 06:32:41,281 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-05 06:32:41,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 06:32:41,282 INFO L85 PathProgramCache]: Analyzing trace with hash -453621307, now seen corresponding path program 3 times [2024-04-05 06:32:41,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 06:32:41,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604701735] [2024-04-05 06:32:41,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 06:32:41,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 06:32:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 06:32:42,862 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-05 06:32:42,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 06:32:42,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604701735] [2024-04-05 06:32:42,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604701735] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 06:32:42,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105845508] [2024-04-05 06:32:42,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-05 06:32:42,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 06:32:42,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 06:32:42,864 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-05 06:32:42,888 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-05 06:32:43,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-04-05 06:32:43,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 06:32:43,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 54 conjunts are in the unsatisfiable core [2024-04-05 06:32:43,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 06:32:44,236 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-05 06:32:44,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 06:32:46,349 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-05 06:32:46,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105845508] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 06:32:46,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 06:32:46,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 29, 29] total 70 [2024-04-05 06:32:46,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431542805] [2024-04-05 06:32:46,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 06:32:46,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-04-05 06:32:46,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 06:32:46,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-04-05 06:32:46,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=4480, Unknown=0, NotChecked=0, Total=4830 [2024-04-05 06:32:46,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:46,354 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 06:32:46,354 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-05 06:32:46,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:32:46,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-05 06:32:46,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 06:32:46,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-04-05 06:32:46,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-04-05 06:32:46,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 06:34:16,827 WARN L293 SmtUtils]: Spent 28.56s 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-05 06:34:20,259 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-05 06:35:37,748 WARN L293 SmtUtils]: Spent 22.07s on a formula simplification. DAG size of input: 65 DAG size of output: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 06:35:44,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-05 06:35:45,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:35:47,709 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-05 06:35:49,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:35:56,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:35:58,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:37:23,192 WARN L293 SmtUtils]: Spent 23.87s 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-05 06:37:25,230 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-05 06:37:28,652 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-05 06:37:30,660 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-05 06:37:32,665 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-05 06:37:34,672 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-05 06:37:36,677 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-05 06:37:38,681 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-05 06:37:41,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:37:43,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:37:45,130 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-05 06:37:48,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:37:50,255 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-05 06:37:52,391 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)) (.cse4 (* (div (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2) 2)) (.cse1 (* 2 (div (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 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)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 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-05 06:38:35,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:39:21,882 WARN L293 SmtUtils]: Spent 9.28s on a formula simplification. DAG size of input: 66 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 06:41:45,083 WARN L293 SmtUtils]: Spent 13.63s 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-05 06:41:49,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:42:13,935 WARN L293 SmtUtils]: Spent 5.47s 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-05 06:42:16,039 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* (div (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 2) 2)) (.cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 4) 4294967296) 1)) (.cse3 (* 2 (div (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2))) (.cse1 (* (div (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2) 2)) (.cse4 (* (mod c_~n~0 2147483648) 2))) (and (< .cse0 (+ (mod (+ 3 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3) 4294967296) 1)) (< .cse1 .cse2) (< .cse0 .cse2) (< .cse3 (+ (mod (+ 2 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post6#1| 1) 4294967296) 1)) (< .cse1 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) .cse4) (< .cse1 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) .cse4) (< (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) .cse4))) is different from false [2024-04-05 06:42:17,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:43:36,484 WARN L293 SmtUtils]: Spent 25.39s 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-05 06:43:38,564 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-05 06:43:40,568 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-05 06:43:42,572 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-05 06:43:46,311 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-05 06:43:48,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:44:35,392 WARN L293 SmtUtils]: Spent 16.90s on a formula simplification. DAG size of input: 67 DAG size of output: 65 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 06:44:37,395 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-05 06:46:31,307 WARN L293 SmtUtils]: Spent 32.32s on a formula simplification. DAG size of input: 83 DAG size of output: 75 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-05 06:46:34,060 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-05 06:46:35,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:46:37,891 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-05 06:46:40,812 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-05 06:46:43,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:46:45,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-05 06:46:46,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:46:48,951 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-05 06:46:51,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-05 06:46:53,129 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 [] Received shutdown request... [2024-04-05 06:46:58,060 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-05 06:46:58,063 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-05 06:46:58,090 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-05 06:46:58,090 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-05 06:46:58,255 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-05 06:46:58,255 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 168 known predicates. [2024-04-05 06:46:58,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-04-05 06:46:58,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-04-05 06:46:58,258 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-04-05 06:46:58,262 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-04-05 06:46:58,264 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-05 06:46:58,264 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-05 06:46:58,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 06:46:58 BasicIcfg [2024-04-05 06:46:58,266 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-05 06:46:58,266 INFO L158 Benchmark]: Toolchain (without parser) took 872269.92ms. Allocated memory was 307.2MB in the beginning and 688.9MB in the end (delta: 381.7MB). Free memory was 238.8MB in the beginning and 354.9MB in the end (delta: -116.1MB). Peak memory consumption was 266.8MB. Max. memory is 8.0GB. [2024-04-05 06:46:58,266 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 307.2MB. Free memory is still 275.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 06:46:58,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.50ms. Allocated memory is still 307.2MB. Free memory was 238.5MB in the beginning and 227.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-04-05 06:46:58,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.75ms. Allocated memory is still 307.2MB. Free memory was 227.0MB in the beginning and 225.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 06:46:58,267 INFO L158 Benchmark]: Boogie Preprocessor took 24.67ms. Allocated memory is still 307.2MB. Free memory was 225.0MB in the beginning and 223.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 06:46:58,267 INFO L158 Benchmark]: RCFGBuilder took 358.05ms. Allocated memory is still 307.2MB. Free memory was 223.4MB in the beginning and 205.3MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-04-05 06:46:58,267 INFO L158 Benchmark]: TraceAbstraction took 871564.67ms. Allocated memory was 307.2MB in the beginning and 688.9MB in the end (delta: 381.7MB). Free memory was 204.0MB in the beginning and 354.9MB in the end (delta: -150.9MB). Peak memory consumption was 232.2MB. Max. memory is 8.0GB. [2024-04-05 06:46:58,269 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.10ms. Allocated memory is still 307.2MB. Free memory is still 275.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.50ms. Allocated memory is still 307.2MB. Free memory was 238.5MB in the beginning and 227.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.75ms. Allocated memory is still 307.2MB. Free memory was 227.0MB in the beginning and 225.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.67ms. Allocated memory is still 307.2MB. Free memory was 225.0MB in the beginning and 223.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 358.05ms. Allocated memory is still 307.2MB. Free memory was 223.4MB in the beginning and 205.3MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 871564.67ms. Allocated memory was 307.2MB in the beginning and 688.9MB in the end (delta: 381.7MB). Free memory was 204.0MB in the beginning and 354.9MB in the end (delta: -150.9MB). Peak memory consumption was 232.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16316, independent: 12758, independent conditional: 12314, independent unconditional: 444, dependent: 3558, dependent conditional: 3056, dependent unconditional: 502, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12758, independent: 12758, independent conditional: 12314, independent unconditional: 444, 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: 12758, independent: 12758, independent conditional: 12314, independent unconditional: 444, 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: 12758, independent: 12758, independent conditional: 12314, independent unconditional: 444, 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: 12758, independent: 12758, independent conditional: 1140, independent unconditional: 11618, 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: 12758, independent: 12758, independent conditional: 837, independent unconditional: 11921, 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: 12758, independent: 12758, independent conditional: 837, independent unconditional: 11921, 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: 1141, independent: 1141, independent conditional: 0, independent unconditional: 1141, 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: 1141, independent: 1141, independent conditional: 0, independent unconditional: 1141, 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: 12758, independent: 11617, independent conditional: 837, independent unconditional: 10780, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1141, unknown conditional: 0, unknown unconditional: 1141] , Statistics on independence cache: Total cache size (in pairs): 1141, Positive cache size: 1141, Positive conditional cache size: 0, Positive unconditional cache size: 1141, 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: 303, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12758, independent: 12758, independent conditional: 1140, independent unconditional: 11618, 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: 12758, independent: 12758, independent conditional: 837, independent unconditional: 11921, 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: 12758, independent: 12758, independent conditional: 837, independent unconditional: 11921, 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: 1141, independent: 1141, independent conditional: 0, independent unconditional: 1141, 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: 1141, independent: 1141, independent conditional: 0, independent unconditional: 1141, 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: 12758, independent: 11617, independent conditional: 837, independent unconditional: 10780, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1141, unknown conditional: 0, unknown unconditional: 1141] , Statistics on independence cache: Total cache size (in pairs): 1141, Positive cache size: 1141, Positive conditional cache size: 0, Positive unconditional cache size: 1141, 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: 303 ], Independence queries for same thread: 3558 - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 168 known predicates. - TimeoutResultAtElement [Line: 83]: 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 168 known predicates. - TimeoutResultAtElement [Line: 82]: 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 168 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 209 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 871.4s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 858.3s, 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, 1.0s SatisfiabilityAnalysisTime, 10.9s 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