/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 BOTH --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-04 17:14:30,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-04 17:14:30,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-04 17:14:30,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-04 17:14:30,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-04 17:14:30,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-04 17:14:30,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-04 17:14:30,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-04 17:14:30,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-04 17:14:30,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-04 17:14:30,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-04 17:14:30,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-04 17:14:30,352 INFO L153 SettingsManager]: * Use SBE=true [2024-04-04 17:14:30,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-04 17:14:30,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-04 17:14:30,353 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-04 17:14:30,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-04 17:14:30,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-04 17:14:30,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-04 17:14:30,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-04 17:14:30,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-04 17:14:30,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-04 17:14:30,355 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-04 17:14:30,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-04 17:14:30,355 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-04 17:14:30,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-04 17:14:30,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-04 17:14:30,356 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-04 17:14:30,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-04 17:14:30,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 17:14:30,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-04 17:14:30,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-04 17:14:30,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-04 17:14:30,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-04 17:14:30,358 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-04 17:14:30,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-04 17:14:30,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-04 17:14:30,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-04 17:14:30,359 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-04 17:14:30,359 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 -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-04-04 17:14:30,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-04 17:14:30,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-04 17:14:30,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-04 17:14:30,557 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-04 17:14:30,557 INFO L274 PluginConnector]: CDTParser initialized [2024-04-04 17:14:30,558 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 17:14:31,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-04 17:14:31,796 INFO L384 CDTParser]: Found 1 translation units. [2024-04-04 17:14:31,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2024-04-04 17:14:31,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8a8a9d4c6/c58b02abe0534a2984f6bd2865f0197b/FLAG4584cdb2a [2024-04-04 17:14:31,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8a8a9d4c6/c58b02abe0534a2984f6bd2865f0197b [2024-04-04 17:14:31,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-04 17:14:31,822 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-04 17:14:31,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-04 17:14:31,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-04 17:14:31,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-04 17:14:31,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 05:14:31" (1/1) ... [2024-04-04 17:14:31,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b5c6e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 05:14:31, skipping insertion in model container [2024-04-04 17:14:31,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 05:14:31" (1/1) ... [2024-04-04 17:14:31,851 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-04 17:14:31,962 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 17:14:31,969 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 17:14:31,975 INFO L202 MainTranslator]: Completed pre-run [2024-04-04 17:14:31,989 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 17:14:31,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-04 17:14:32,001 INFO L206 MainTranslator]: Completed translation [2024-04-04 17:14:32,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 05:14:32 WrapperNode [2024-04-04 17:14:32,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-04 17:14:32,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-04 17:14:32,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-04 17:14:32,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-04 17:14:32,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 05:14:32" (1/1) ... [2024-04-04 17:14:32,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 05:14:32" (1/1) ... [2024-04-04 17:14:32,031 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 137 [2024-04-04 17:14:32,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-04 17:14:32,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-04 17:14:32,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-04 17:14:32,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-04 17:14:32,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 05:14:32" (1/1) ... [2024-04-04 17:14:32,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 05:14:32" (1/1) ... [2024-04-04 17:14:32,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 05:14:32" (1/1) ... [2024-04-04 17:14:32,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 05:14:32" (1/1) ... [2024-04-04 17:14:32,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 05:14:32" (1/1) ... [2024-04-04 17:14:32,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 05:14:32" (1/1) ... [2024-04-04 17:14:32,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 05:14:32" (1/1) ... [2024-04-04 17:14:32,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 05:14:32" (1/1) ... [2024-04-04 17:14:32,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-04 17:14:32,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-04 17:14:32,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-04 17:14:32,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-04 17:14:32,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 05:14:32" (1/1) ... [2024-04-04 17:14:32,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-04 17:14:32,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 17:14:32,095 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 17:14:32,112 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 17:14:32,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-04 17:14:32,170 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-04 17:14:32,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-04 17:14:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-04 17:14:32,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-04 17:14:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-04 17:14:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-04 17:14:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-04 17:14:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-04-04 17:14:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-04 17:14:32,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-04 17:14:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-04 17:14:32,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-04 17:14:32,172 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 17:14:32,237 INFO L241 CfgBuilder]: Building ICFG [2024-04-04 17:14:32,239 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-04 17:14:32,452 INFO L282 CfgBuilder]: Performing block encoding [2024-04-04 17:14:32,462 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-04 17:14:32,462 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-04-04 17:14:32,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 05:14:32 BoogieIcfgContainer [2024-04-04 17:14:32,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-04 17:14:32,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-04 17:14:32,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-04 17:14:32,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-04 17:14:32,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.04 05:14:31" (1/3) ... [2024-04-04 17:14:32,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f13d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 05:14:32, skipping insertion in model container [2024-04-04 17:14:32,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 05:14:32" (2/3) ... [2024-04-04 17:14:32,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f13d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 05:14:32, skipping insertion in model container [2024-04-04 17:14:32,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 05:14:32" (3/3) ... [2024-04-04 17:14:32,469 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2024-04-04 17:14:32,475 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-04 17:14:32,481 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-04 17:14:32,481 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-04 17:14:32,482 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-04 17:14:32,542 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-04 17:14:32,583 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-04 17:14:32,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-04 17:14:32,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 17:14:32,587 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 17:14:32,588 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 17:14:32,617 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-04 17:14:32,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 17:14:32,628 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-04 17:14:32,633 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;@24e112b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-04 17:14:32,633 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-04 17:14:33,138 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 17:14:33,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 17:14:33,143 INFO L85 PathProgramCache]: Analyzing trace with hash -713008577, now seen corresponding path program 1 times [2024-04-04 17:14:33,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 17:14:33,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466430807] [2024-04-04 17:14:33,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 17:14:33,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 17:14:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 17:14:33,489 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 17:14:33,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 17:14:33,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466430807] [2024-04-04 17:14:33,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466430807] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 17:14:33,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 17:14:33,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-04 17:14:33,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952981765] [2024-04-04 17:14:33,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 17:14:33,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-04 17:14:33,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 17:14:33,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-04 17:14:33,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-04 17:14:33,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:33,643 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 17:14:33,647 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 17:14:33,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:33,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:33,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-04 17:14:33,713 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 17:14:33,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 17:14:33,715 INFO L85 PathProgramCache]: Analyzing trace with hash -423421568, now seen corresponding path program 1 times [2024-04-04 17:14:33,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 17:14:33,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189825419] [2024-04-04 17:14:33,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 17:14:33,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 17:14:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 17:14:34,073 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 17:14:34,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 17:14:34,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189825419] [2024-04-04 17:14:34,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189825419] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 17:14:34,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 17:14:34,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-04-04 17:14:34,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266493382] [2024-04-04 17:14:34,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 17:14:34,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-04-04 17:14:34,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 17:14:34,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-04 17:14:34,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-04-04 17:14:34,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:34,082 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 17:14:34,082 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 17:14:34,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:34,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:34,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:34,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-04 17:14:34,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-04 17:14:34,201 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 17:14:34,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 17:14:34,202 INFO L85 PathProgramCache]: Analyzing trace with hash -510566555, now seen corresponding path program 1 times [2024-04-04 17:14:34,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 17:14:34,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201489939] [2024-04-04 17:14:34,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 17:14:34,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 17:14:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 17:14:34,545 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 17:14:34,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 17:14:34,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201489939] [2024-04-04 17:14:34,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201489939] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-04 17:14:34,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-04 17:14:34,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-04 17:14:34,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624212505] [2024-04-04 17:14:34,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-04 17:14:34,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-04 17:14:34,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 17:14:34,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-04 17:14:34,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-04-04 17:14:34,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:34,556 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 17:14:34,556 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 17:14:34,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:34,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-04 17:14:34,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-04 17:14:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-04 17:14:34,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-04 17:14:34,674 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 17:14:34,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 17:14:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1786374414, now seen corresponding path program 1 times [2024-04-04 17:14:34,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 17:14:34,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020862313] [2024-04-04 17:14:34,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 17:14:34,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 17:14:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 17:14:36,054 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 17:14:36,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 17:14:36,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020862313] [2024-04-04 17:14:36,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020862313] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 17:14:36,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618640655] [2024-04-04 17:14:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 17:14:36,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 17:14:36,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 17:14:36,130 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 17:14:36,157 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 17:14:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 17:14:36,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 47 conjunts are in the unsatisfiable core [2024-04-04 17:14:36,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 17:14:37,315 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 17:14:37,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 17:14:37,859 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2024-04-04 17:14:37,859 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 17:14:38,490 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 17:14:38,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618640655] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 17:14:38,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 17:14:38,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 22] total 53 [2024-04-04 17:14:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790257263] [2024-04-04 17:14:38,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 17:14:38,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-04-04 17:14:38,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 17:14:38,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-04-04 17:14:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=2396, Unknown=0, NotChecked=0, Total=2756 [2024-04-04 17:14:38,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:38,515 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 17:14:38,515 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 17:14:38,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:38,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-04 17:14:38,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-04 17:14:38,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:40,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:40,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-04 17:14:40,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-04 17:14:40,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-04-04 17:14:40,041 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 17:14:40,238 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 17:14:40,239 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 17:14:40,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 17:14:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1380064860, now seen corresponding path program 2 times [2024-04-04 17:14:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 17:14:40,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614259396] [2024-04-04 17:14:40,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 17:14:40,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 17:14:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 17:14:40,961 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 17:14:40,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 17:14:40,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614259396] [2024-04-04 17:14:40,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614259396] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 17:14:40,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209838776] [2024-04-04 17:14:40,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-04 17:14:40,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 17:14:40,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 17:14:40,977 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 17:14:40,977 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 17:14:41,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-04 17:14:41,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 17:14:41,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 27 conjunts are in the unsatisfiable core [2024-04-04 17:14:41,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 17:14:41,802 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 17:14:41,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 17:14:42,689 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 17:14:42,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209838776] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 17:14:42,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 17:14:42,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2024-04-04 17:14:42,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420772157] [2024-04-04 17:14:42,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 17:14:42,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-04-04 17:14:42,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 17:14:42,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-04-04 17:14:42,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2024-04-04 17:14:42,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:42,717 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 17:14:42,717 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 17:14:42,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:42,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-04 17:14:42,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-04 17:14:42,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-04-04 17:14:42,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-04 17:14:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-04 17:14:46,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-04-04 17:14:46,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-04-04 17:14:46,716 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 17:14:46,911 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 17:14:46,911 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 17:14:46,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-04 17:14:46,912 INFO L85 PathProgramCache]: Analyzing trace with hash -453621307, now seen corresponding path program 3 times [2024-04-04 17:14:46,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-04 17:14:46,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824346578] [2024-04-04 17:14:46,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-04 17:14:46,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-04 17:14:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-04 17:14:48,779 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 17:14:48,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-04 17:14:48,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824346578] [2024-04-04 17:14:48,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824346578] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-04 17:14:48,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124184529] [2024-04-04 17:14:48,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-04 17:14:48,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-04 17:14:48,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-04 17:14:48,782 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 17:14:48,783 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 17:14:49,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-04-04 17:14:49,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-04 17:14:49,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 54 conjunts are in the unsatisfiable core [2024-04-04 17:14:49,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-04 17:14:50,093 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 17:14:50,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-04 17:14:52,190 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 17:14:52,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124184529] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-04 17:14:52,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-04 17:14:52,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 29, 29] total 70 [2024-04-04 17:14:52,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268706830] [2024-04-04 17:14:52,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-04 17:14:52,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-04-04 17:14:52,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-04 17:14:52,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-04-04 17:14:52,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=4480, Unknown=0, NotChecked=0, Total=4830 [2024-04-04 17:14:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:52,253 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-04 17:14:52,253 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 17:14:52,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:14:52,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-04 17:14:52,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-04 17:14:52,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-04-04 17:14:52,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-04-04 17:14:52,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-04 17:16:28,709 WARN L293 SmtUtils]: Spent 29.91s 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 17:16:30,714 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 17:16:33,776 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* (div (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 2) 2)) (.cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 4) 4294967296) 1)) (.cse1 (+ (mod (+ 2 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (.cse5 (* 2 (div (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2))) (.cse2 (* (div (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2) 2)) (.cse4 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse6 (* (mod c_~n~0 2147483648) 2))) (and (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3) 4294967296) 1)) (< .cse0 .cse1) (< .cse2 .cse3) (< .cse0 .cse3) (< (div (mod (+ 6 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2) 4) (< (* (div .cse4 2) 2) (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1)) (< .cse5 .cse1) (< .cse5 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 1) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) .cse6) (< .cse2 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) .cse6) (< .cse4 .cse6))) is different from false [2024-04-04 17:16:48,810 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 17:17:09,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-04 17:17:11,576 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 17:17:13,582 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 17:17:15,600 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 17:17:17,609 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 17:17:48,930 WARN L293 SmtUtils]: Spent 5.51s 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 17:18:34,946 WARN L293 SmtUtils]: Spent 17.51s 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 17:18:37,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 17:18:39,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 17:18:43,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 17:19:31,701 WARN L293 SmtUtils]: Spent 9.63s on a formula simplification. DAG size of input: 70 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 17:22:37,222 WARN L293 SmtUtils]: Spent 13.27s 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 17:22:40,409 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 17:24:14,588 WARN L293 SmtUtils]: Spent 29.44s on a formula simplification. DAG size of input: 75 DAG size of output: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 17:24:16,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 17:24:17,484 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-04 17:24:19,488 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 17:24:21,794 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 17:24:23,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 17:24:25,460 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 17:24:27,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 17:25:07,768 WARN L293 SmtUtils]: Spent 7.11s on a formula simplification. DAG size of input: 67 DAG size of output: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 17:25:09,771 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 17:25:16,359 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 [2024-04-04 17:25:36,135 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 17:25:37,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 17:25:39,669 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 17:27:14,454 WARN L293 SmtUtils]: Spent 10.37s on a formula simplification. DAG size of input: 95 DAG size of output: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 17:27:18,611 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 17:27:20,614 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 17:27:22,641 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 17:27:26,606 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 4) 4294967296) 1)) (.cse2 (* (div (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2) 2)) (.cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (.cse4 (+ (mod (+ 2 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (.cse5 (* (mod c_~n~0 2147483648) 2)) (.cse3 (+ (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1))) (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 .cse1) (< (* (div (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 2) 2) .cse1) (< .cse2 .cse0) (< (* (div (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2) 2) .cse3) (< (* 2 (div (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2)) .cse4) (< (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) .cse5) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) .cse5) (< (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse5) (< (* 2 (div (mod (+ 6 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 2)) .cse0) (< (* 2 (div (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 2)) .cse4) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) .cse5) (< (* (div (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 2) 2) .cse3))) is different from false [2024-04-04 17:28:06,347 WARN L293 SmtUtils]: Spent 6.88s on a formula simplification. DAG size of input: 50 DAG size of output: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-04-04 17:28:08,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-04-04 17:28:10,133 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-04 17:29:05,723 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 17:29:05,734 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 17:29:05,734 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 17:29:06,732 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 17:29:06,739 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 17:29:06,935 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-04-04 17:29:06,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-04 17:29:06,947 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while executing Executor. [2024-04-04 17:29:06,949 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-04-04 17:29:06,949 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-04-04 17:29:06,949 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-04-04 17:29:06,953 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-04-04 17:29:06,956 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-04 17:29:06,956 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-04 17:29:06,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2024-04-04 17:29:06,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.04 05:29:06 BasicIcfg [2024-04-04 17:29:06,958 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-04 17:29:06,958 INFO L158 Benchmark]: Toolchain (without parser) took 875136.15ms. Allocated memory was 196.1MB in the beginning and 802.2MB in the end (delta: 606.1MB). Free memory was 128.5MB in the beginning and 654.5MB in the end (delta: -526.0MB). Peak memory consumption was 80.8MB. Max. memory is 8.0GB. [2024-04-04 17:29:06,958 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-04 17:29:06,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.33ms. Allocated memory is still 196.1MB. Free memory was 128.4MB in the beginning and 116.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-04-04 17:29:06,959 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.34ms. Allocated memory is still 196.1MB. Free memory was 116.7MB in the beginning and 114.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-04 17:29:06,959 INFO L158 Benchmark]: Boogie Preprocessor took 24.60ms. Allocated memory is still 196.1MB. Free memory was 114.8MB in the beginning and 113.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-04 17:29:06,959 INFO L158 Benchmark]: RCFGBuilder took 405.92ms. Allocated memory was 196.1MB in the beginning and 307.2MB in the end (delta: 111.1MB). Free memory was 113.2MB in the beginning and 264.4MB in the end (delta: -151.2MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2024-04-04 17:29:06,959 INFO L158 Benchmark]: TraceAbstraction took 874493.02ms. Allocated memory was 307.2MB in the beginning and 802.2MB in the end (delta: 494.9MB). Free memory was 263.3MB in the beginning and 654.5MB in the end (delta: -391.2MB). Peak memory consumption was 103.7MB. Max. memory is 8.0GB. [2024-04-04 17:29:06,960 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.33ms. Allocated memory is still 196.1MB. Free memory was 128.4MB in the beginning and 116.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.34ms. Allocated memory is still 196.1MB. Free memory was 116.7MB in the beginning and 114.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.60ms. Allocated memory is still 196.1MB. Free memory was 114.8MB in the beginning and 113.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 405.92ms. Allocated memory was 196.1MB in the beginning and 307.2MB in the end (delta: 111.1MB). Free memory was 113.2MB in the beginning and 264.4MB in the end (delta: -151.2MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * TraceAbstraction took 874493.02ms. Allocated memory was 307.2MB in the beginning and 802.2MB in the end (delta: 494.9MB). Free memory was 263.3MB in the beginning and 654.5MB in the end (delta: -391.2MB). Peak memory consumption was 103.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: 19244, independent: 14949, independent conditional: 14502, independent unconditional: 447, dependent: 4295, dependent conditional: 3775, dependent unconditional: 520, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14949, independent: 14949, independent conditional: 14502, independent unconditional: 447, 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: 14949, independent: 14949, independent conditional: 14502, independent unconditional: 447, 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: 14949, independent: 14949, independent conditional: 14502, independent unconditional: 447, 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: 14949, independent: 14949, independent conditional: 2402, independent unconditional: 12547, 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: 14949, independent: 14949, independent conditional: 1978, independent unconditional: 12971, 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: 14949, independent: 14949, independent conditional: 1978, independent unconditional: 12971, 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: 1143, independent: 1143, independent conditional: 0, independent unconditional: 1143, 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: 1143, independent: 1143, independent conditional: 0, independent unconditional: 1143, 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: 14949, independent: 13806, independent conditional: 1978, independent unconditional: 11828, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1143, unknown conditional: 0, unknown unconditional: 1143] , Statistics on independence cache: Total cache size (in pairs): 1143, Positive cache size: 1143, Positive conditional cache size: 0, Positive unconditional cache size: 1143, 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: 424, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14949, independent: 14949, independent conditional: 2402, independent unconditional: 12547, 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: 14949, independent: 14949, independent conditional: 1978, independent unconditional: 12971, 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: 14949, independent: 14949, independent conditional: 1978, independent unconditional: 12971, 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: 1143, independent: 1143, independent conditional: 0, independent unconditional: 1143, 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: 1143, independent: 1143, independent conditional: 0, independent unconditional: 1143, 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: 14949, independent: 13806, independent conditional: 1978, independent unconditional: 11828, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1143, unknown conditional: 0, unknown unconditional: 1143] , Statistics on independence cache: Total cache size (in pairs): 1143, Positive cache size: 1143, Positive conditional cache size: 0, Positive unconditional cache size: 1143, 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: 424 ], Independence queries for same thread: 4295 - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,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: 874.4s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 861.0s, 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: 325, 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, 11.2s 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