/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 LOOP --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-cond-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-08 08:17:05,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-08 08:17:05,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-08 08:17:05,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-08 08:17:05,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-08 08:17:05,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-08 08:17:05,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-08 08:17:05,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-08 08:17:05,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-08 08:17:05,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-08 08:17:05,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-08 08:17:05,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-08 08:17:05,776 INFO L153 SettingsManager]: * Use SBE=true [2024-05-08 08:17:05,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-08 08:17:05,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-08 08:17:05,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-08 08:17:05,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-08 08:17:05,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-08 08:17:05,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-08 08:17:05,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-08 08:17:05,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-08 08:17:05,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-08 08:17:05,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-08 08:17:05,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-08 08:17:05,781 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-08 08:17:05,781 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-08 08:17:05,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-08 08:17:05,782 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-08 08:17:05,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-08 08:17:05,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 08:17:05,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-08 08:17:05,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-08 08:17:05,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-08 08:17:05,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-08 08:17:05,784 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-08 08:17:05,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-08 08:17:05,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-08 08:17:05,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-08 08:17:05,785 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-08 08:17:05,785 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 -> LOOP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-08 08:17:06,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-08 08:17:06,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-08 08:17:06,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-08 08:17:06,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-08 08:17:06,055 INFO L274 PluginConnector]: CDTParser initialized [2024-05-08 08:17:06,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2024-05-08 08:17:07,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-08 08:17:07,393 INFO L384 CDTParser]: Found 1 translation units. [2024-05-08 08:17:07,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2024-05-08 08:17:07,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/99e055859/686a4dd67c7047d695e690bc811f450c/FLAG456ee4931 [2024-05-08 08:17:07,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/99e055859/686a4dd67c7047d695e690bc811f450c [2024-05-08 08:17:07,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-08 08:17:07,414 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-08 08:17:07,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-08 08:17:07,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-08 08:17:07,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-08 08:17:07,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 08:17:07" (1/1) ... [2024-05-08 08:17:07,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@938ffac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 08:17:07, skipping insertion in model container [2024-05-08 08:17:07,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 08:17:07" (1/1) ... [2024-05-08 08:17:07,456 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-08 08:17:07,673 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-cond-4.wvr.c[2808,2821] [2024-05-08 08:17:07,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 08:17:07,697 INFO L202 MainTranslator]: Completed pre-run [2024-05-08 08:17:07,735 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-cond-4.wvr.c[2808,2821] [2024-05-08 08:17:07,737 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 08:17:07,752 INFO L206 MainTranslator]: Completed translation [2024-05-08 08:17:07,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 08:17:07 WrapperNode [2024-05-08 08:17:07,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-08 08:17:07,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-08 08:17:07,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-08 08:17:07,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-08 08:17:07,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 08:17:07" (1/1) ... [2024-05-08 08:17:07,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 08:17:07" (1/1) ... [2024-05-08 08:17:07,793 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 186 [2024-05-08 08:17:07,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-08 08:17:07,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-08 08:17:07,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-08 08:17:07,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-08 08:17:07,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 08:17:07" (1/1) ... [2024-05-08 08:17:07,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 08:17:07" (1/1) ... [2024-05-08 08:17:07,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 08:17:07" (1/1) ... [2024-05-08 08:17:07,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 08:17:07" (1/1) ... [2024-05-08 08:17:07,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 08:17:07" (1/1) ... [2024-05-08 08:17:07,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 08:17:07" (1/1) ... [2024-05-08 08:17:07,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 08:17:07" (1/1) ... [2024-05-08 08:17:07,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 08:17:07" (1/1) ... [2024-05-08 08:17:07,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-08 08:17:07,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-08 08:17:07,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-08 08:17:07,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-08 08:17:07,823 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 08:17:07" (1/1) ... [2024-05-08 08:17:07,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 08:17:07,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 08:17:07,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-08 08:17:07,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-08 08:17:07,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-08 08:17:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-08 08:17:07,912 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-08 08:17:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-08 08:17:07,912 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-08 08:17:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-08 08:17:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-08 08:17:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-08 08:17:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-08 08:17:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-08 08:17:07,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-08 08:17:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-08 08:17:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-08 08:17:07,916 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-08 08:17:08,001 INFO L241 CfgBuilder]: Building ICFG [2024-05-08 08:17:08,003 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-08 08:17:08,381 INFO L282 CfgBuilder]: Performing block encoding [2024-05-08 08:17:08,394 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-08 08:17:08,394 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-08 08:17:08,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 08:17:08 BoogieIcfgContainer [2024-05-08 08:17:08,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-08 08:17:08,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-08 08:17:08,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-08 08:17:08,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-08 08:17:08,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.05 08:17:07" (1/3) ... [2024-05-08 08:17:08,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cda109d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 08:17:08, skipping insertion in model container [2024-05-08 08:17:08,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 08:17:07" (2/3) ... [2024-05-08 08:17:08,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cda109d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 08:17:08, skipping insertion in model container [2024-05-08 08:17:08,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 08:17:08" (3/3) ... [2024-05-08 08:17:08,412 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2024-05-08 08:17:08,420 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-08 08:17:08,430 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-08 08:17:08,431 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-08 08:17:08,431 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-08 08:17:08,552 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-08 08:17:08,606 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 08:17:08,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 08:17:08,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 08:17:08,610 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-08 08:17:08,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-08 08:17:08,667 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 08:17:08,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 08:17:08,695 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 08:17:08,701 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;@29e2a7ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=LOOP, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-08 08:17:08,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-08 08:17:09,147 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-05-08 08:17:09,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 08:17:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash -124361033, now seen corresponding path program 1 times [2024-05-08 08:17:09,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 08:17:09,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807393158] [2024-05-08 08:17:09,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 08:17:09,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 08:17:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 08:17:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 08:17:09,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 08:17:09,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807393158] [2024-05-08 08:17:09,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807393158] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 08:17:09,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 08:17:09,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-08 08:17:09,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655651490] [2024-05-08 08:17:09,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 08:17:09,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-08 08:17:09,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 08:17:09,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-08 08:17:09,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-08 08:17:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:09,521 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 08:17:09,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 08:17:09,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:09,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:09,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-08 08:17:09,634 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-05-08 08:17:09,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 08:17:09,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2010415305, now seen corresponding path program 1 times [2024-05-08 08:17:09,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 08:17:09,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356984402] [2024-05-08 08:17:09,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 08:17:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 08:17:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 08:17:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 08:17:10,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 08:17:10,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356984402] [2024-05-08 08:17:10,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356984402] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 08:17:10,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397991767] [2024-05-08 08:17:10,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 08:17:10,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 08:17:10,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 08:17:10,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 08:17:10,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-08 08:17:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 08:17:10,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-08 08:17:10,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 08:17:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 08:17:11,081 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-08 08:17:11,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397991767] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 08:17:11,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-08 08:17:11,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-05-08 08:17:11,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269191890] [2024-05-08 08:17:11,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 08:17:11,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-08 08:17:11,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 08:17:11,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-08 08:17:11,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-05-08 08:17:11,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:11,102 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 08:17:11,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 08:17:11,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:11,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:11,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:11,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-08 08:17:11,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-08 08:17:11,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-05-08 08:17:11,599 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-05-08 08:17:11,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 08:17:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1699666781, now seen corresponding path program 1 times [2024-05-08 08:17:11,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 08:17:11,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456292920] [2024-05-08 08:17:11,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 08:17:11,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 08:17:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 08:17:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 08:17:12,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 08:17:12,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456292920] [2024-05-08 08:17:12,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456292920] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 08:17:12,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697737494] [2024-05-08 08:17:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 08:17:12,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 08:17:12,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 08:17:12,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 08:17:12,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-08 08:17:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 08:17:12,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 37 conjunts are in the unsatisfiable core [2024-05-08 08:17:12,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 08:17:13,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-08 08:17:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 08:17:13,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 08:17:13,786 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-08 08:17:13,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-05-08 08:17:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 08:17:14,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697737494] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 08:17:14,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 08:17:14,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 18] total 41 [2024-05-08 08:17:14,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771469639] [2024-05-08 08:17:14,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 08:17:14,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-05-08 08:17:14,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 08:17:14,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-05-08 08:17:14,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1486, Unknown=0, NotChecked=0, Total=1640 [2024-05-08 08:17:14,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:14,597 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 08:17:14,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.439024390243903) internal successors, (387), 41 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 08:17:14,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:14,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-08 08:17:14,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:16,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:16,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-08 08:17:16,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-08 08:17:16,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-08 08:17:16,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 08:17:16,933 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-05-08 08:17:16,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 08:17:16,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1110464735, now seen corresponding path program 1 times [2024-05-08 08:17:16,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 08:17:16,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999714365] [2024-05-08 08:17:16,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 08:17:16,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 08:17:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 08:17:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-08 08:17:18,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 08:17:18,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999714365] [2024-05-08 08:17:18,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999714365] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 08:17:18,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870384508] [2024-05-08 08:17:18,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 08:17:18,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 08:17:18,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 08:17:18,189 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 08:17:18,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-08 08:17:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 08:17:18,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 17 conjunts are in the unsatisfiable core [2024-05-08 08:17:18,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 08:17:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-08 08:17:19,277 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 08:17:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-08 08:17:20,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870384508] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 08:17:20,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 08:17:20,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 36 [2024-05-08 08:17:20,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534430402] [2024-05-08 08:17:20,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 08:17:20,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-08 08:17:20,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 08:17:20,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-08 08:17:20,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2024-05-08 08:17:20,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:20,877 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 08:17:20,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 12.416666666666666) internal successors, (447), 36 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 08:17:20,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:20,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-08 08:17:20,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-05-08 08:17:20,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:26,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-08 08:17:26,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-08 08:17:26,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-05-08 08:17:26,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-08 08:17:26,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 08:17:26,479 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-05-08 08:17:26,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 08:17:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1013286976, now seen corresponding path program 2 times [2024-05-08 08:17:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 08:17:26,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328655711] [2024-05-08 08:17:26,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 08:17:26,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 08:17:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 08:17:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-08 08:17:29,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 08:17:29,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328655711] [2024-05-08 08:17:29,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328655711] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 08:17:29,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327663860] [2024-05-08 08:17:29,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 08:17:29,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 08:17:29,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 08:17:29,442 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 08:17:29,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-08 08:17:29,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 08:17:29,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 08:17:29,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 94 conjunts are in the unsatisfiable core [2024-05-08 08:17:29,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 08:17:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-08 08:17:31,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 08:17:35,310 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-08 08:17:35,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327663860] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 08:17:35,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 08:17:35,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 101 [2024-05-08 08:17:35,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517947887] [2024-05-08 08:17:35,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 08:17:35,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2024-05-08 08:17:35,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 08:17:35,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2024-05-08 08:17:35,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=797, Invalid=9303, Unknown=0, NotChecked=0, Total=10100 [2024-05-08 08:17:35,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:35,427 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 08:17:35,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 7.03960396039604) internal successors, (711), 101 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 08:17:35,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:35,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-08 08:17:35,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-05-08 08:17:35,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-05-08 08:17:35,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:17:47,091 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (.cse0 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse7 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse3 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse5 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296) 1)) (.cse2 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse6 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1))) (and (< .cse0 .cse1) (< .cse2 (+ (mod (+ 7 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) .cse4) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse0 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 8) 4294967296) 1)) (< .cse5 19) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse0 .cse6) (< .cse2 .cse7) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) .cse4) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse7) (< .cse3 .cse7) (< .cse3 .cse6) (< (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse1) (< .cse5 .cse1) (< .cse2 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse6))) is different from false [2024-05-08 08:18:00,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:18:07,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:18:09,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:20:18,956 WARN L293 SmtUtils]: Spent 23.89s on a formula simplification. DAG size of input: 75 DAG size of output: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 08:20:20,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:20:22,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:20:24,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:21:12,333 WARN L293 SmtUtils]: Spent 15.51s on a formula simplification. DAG size of input: 55 DAG size of output: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 08:21:14,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:21:16,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:21:19,019 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-05-08 08:21:21,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:21:22,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:21:28,365 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-05-08 08:21:31,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:21:34,446 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse0 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1)) (.cse2 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse4 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) (and (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post6#1| 17) 4294967296) 1)) (< .cse1 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse0 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 19) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse1 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse0 .cse3) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< .cse2 .cse3) (< .cse4 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post6#1| 13) 4294967296) 1)) (< .cse4 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_#t~post6#1|) 4294967296) 1)))) is different from false [2024-05-08 08:22:02,007 WARN L293 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 51 DAG size of output: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 08:22:05,837 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse2 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse1 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse0 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) (and (< .cse0 (+ (mod (+ 7 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post8#1| 12) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post8#1| 4) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3) 4294967296) 1)) (< .cse2 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_#t~post8#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post8#1| 8) 4294967296) 1)))) is different from false [2024-05-08 08:22:21,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:22:23,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:22:25,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:22:29,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:22:37,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:23:13,766 WARN L293 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 55 DAG size of output: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 08:23:14,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:24:46,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:25:00,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:25:33,565 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse0 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1)) (.cse2 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse4 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) (and (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse1 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 14) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 18) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 19) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse2 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse1 .cse3) (< .cse4 .cse5) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< .cse0 .cse5) (< .cse0 .cse3) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 6) 4294967296) 1)) (< .cse4 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 10) 4294967296) 1)))) is different from false [2024-05-08 08:25:58,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:26:29,175 WARN L293 SmtUtils]: Spent 6.96s on a formula simplification. DAG size of input: 55 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 08:26:33,502 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (.cse0 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse6 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse3 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 18) 4294967296) 1)) (.cse2 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1))) (and (< .cse0 .cse1) (< .cse2 (+ (mod (+ 7 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) .cse4) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse0 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 8) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse0 .cse5) (< .cse2 .cse6) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) .cse4) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse6) (< .cse3 .cse6) (< .cse3 .cse5) (< (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse1) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) .cse1) (< .cse2 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) .cse5))) is different from false [2024-05-08 08:26:39,900 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse6 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 6) 4294967296) 1)) (.cse5 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 10) 4294967296) 1)) (.cse1 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (.cse4 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 14) 4294967296) 1)) (.cse3 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse0 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296))) (and (< .cse0 (+ (mod (+ 7 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 11) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 15) 4294967296) 1)) (< .cse2 (+ (mod (+ 16 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 14) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 8) 4294967296) 1)) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 18) 4294967296) 1)) (< (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 19) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 13) 4294967296) 1)) (< .cse3 (+ (mod (+ 5 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse1 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 12) 4294967296) 1)) (< .cse2 .cse4) (< .cse0 .cse5) (< .cse3 .cse6) (< .cse2 (+ (mod (+ |c_thread2Thread1of1ForFork1_~i~1#1| 17) 4294967296) 1)) (< .cse0 .cse6) (< .cse1 .cse5) (< .cse1 .cse4) (< .cse3 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 6) 4294967296) 1)) (< .cse0 (+ (mod (+ 9 |c_thread2Thread1of1ForFork1_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork1_#t~post4#1| 10) 4294967296) 1)))) is different from false [2024-05-08 08:26:50,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:26:54,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:27:22,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:27:24,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:27:25,674 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-05-08 08:27:28,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:27:30,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:27:32,164 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-05-08 08:27:36,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:27:38,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:27:39,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:27:41,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:28:09,470 WARN L293 SmtUtils]: Spent 7.96s on a formula simplification. DAG size of input: 55 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 08:28:11,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:28:15,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:28:21,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:28:29,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:28:31,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:28:34,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:28:35,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:28:37,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:28:41,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:28:43,041 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-05-08 08:28:46,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:28:47,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:28:50,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:28:51,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:28:53,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:28:57,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:29:02,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:29:11,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:29:13,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:29:15,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:29:18,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:29:21,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:29:23,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:29:25,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:29:27,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:29:31,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:29:32,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:29:36,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:30:03,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:30:05,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:30:08,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:30:10,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:30:13,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:30:15,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:31:22,469 WARN L293 SmtUtils]: Spent 8.57s on a formula simplification. DAG size of input: 65 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-05-08 08:31:30,943 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 08:31:30,943 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 08:31:30,943 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 08:31:30,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-08 08:31:31,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 08:31:31,154 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 304 known predicates. [2024-05-08 08:31:31,156 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-08 08:31:31,157 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-08 08:31:31,157 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-08 08:31:31,160 INFO L448 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-05-08 08:31:31,163 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-08 08:31:31,163 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-08 08:31:31,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.05 08:31:31 BasicIcfg [2024-05-08 08:31:31,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-08 08:31:31,165 INFO L158 Benchmark]: Toolchain (without parser) took 863750.95ms. Allocated memory was 263.2MB in the beginning and 679.5MB in the end (delta: 416.3MB). Free memory was 194.3MB in the beginning and 270.8MB in the end (delta: -76.5MB). Peak memory consumption was 340.7MB. Max. memory is 8.0GB. [2024-05-08 08:31:31,166 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 263.2MB. Free memory is still 233.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-08 08:31:31,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.12ms. Allocated memory is still 263.2MB. Free memory was 194.3MB in the beginning and 182.1MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-08 08:31:31,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.48ms. Allocated memory is still 263.2MB. Free memory was 182.1MB in the beginning and 180.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-08 08:31:31,166 INFO L158 Benchmark]: Boogie Preprocessor took 26.97ms. Allocated memory is still 263.2MB. Free memory was 180.0MB in the beginning and 178.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-08 08:31:31,167 INFO L158 Benchmark]: RCFGBuilder took 574.11ms. Allocated memory is still 263.2MB. Free memory was 178.3MB in the beginning and 157.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-05-08 08:31:31,167 INFO L158 Benchmark]: TraceAbstraction took 862767.10ms. Allocated memory was 263.2MB in the beginning and 679.5MB in the end (delta: 416.3MB). Free memory was 156.3MB in the beginning and 270.8MB in the end (delta: -114.6MB). Peak memory consumption was 303.0MB. Max. memory is 8.0GB. [2024-05-08 08:31:31,168 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.13ms. Allocated memory is still 263.2MB. Free memory is still 233.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 333.12ms. Allocated memory is still 263.2MB. Free memory was 194.3MB in the beginning and 182.1MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.48ms. Allocated memory is still 263.2MB. Free memory was 182.1MB in the beginning and 180.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.97ms. Allocated memory is still 263.2MB. Free memory was 180.0MB in the beginning and 178.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 574.11ms. Allocated memory is still 263.2MB. Free memory was 178.3MB in the beginning and 157.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 862767.10ms. Allocated memory was 263.2MB in the beginning and 679.5MB in the end (delta: 416.3MB). Free memory was 156.3MB in the beginning and 270.8MB in the end (delta: -114.6MB). Peak memory consumption was 303.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 20581, independent: 18235, independent conditional: 13338, independent unconditional: 4897, dependent: 2346, dependent conditional: 2346, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18235, independent: 18235, independent conditional: 13338, independent unconditional: 4897, 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: 18235, independent: 18235, independent conditional: 13338, independent unconditional: 4897, 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: 18235, independent: 18235, independent conditional: 13338, independent unconditional: 4897, 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: 18235, independent: 18235, independent conditional: 2689, independent unconditional: 15546, 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: 18235, independent: 18235, independent conditional: 2543, independent unconditional: 15692, 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: 18235, independent: 18235, independent conditional: 2543, independent unconditional: 15692, 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: 2324, independent: 2324, independent conditional: 10, independent unconditional: 2314, 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: 2324, independent: 2324, independent conditional: 0, independent unconditional: 2324, 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: 18235, independent: 15911, independent conditional: 2533, independent unconditional: 13378, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2324, unknown conditional: 10, unknown unconditional: 2314] , Statistics on independence cache: Total cache size (in pairs): 2324, Positive cache size: 2324, Positive conditional cache size: 10, Positive unconditional cache size: 2314, 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: 146, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18235, independent: 18235, independent conditional: 2689, independent unconditional: 15546, 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: 18235, independent: 18235, independent conditional: 2543, independent unconditional: 15692, 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: 18235, independent: 18235, independent conditional: 2543, independent unconditional: 15692, 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: 2324, independent: 2324, independent conditional: 10, independent unconditional: 2314, 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: 2324, independent: 2324, independent conditional: 0, independent unconditional: 2324, 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: 18235, independent: 15911, independent conditional: 2533, independent unconditional: 13378, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2324, unknown conditional: 10, unknown unconditional: 2314] , Statistics on independence cache: Total cache size (in pairs): 2324, Positive cache size: 2324, Positive conditional cache size: 10, Positive unconditional cache size: 2314, 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: 146 ], Independence queries for same thread: 2346 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 304 known predicates. - TimeoutResultAtElement [Line: 101]: 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 304 known predicates. - TimeoutResultAtElement [Line: 102]: 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 304 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 338 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 862.5s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 843.9s, 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: 360, 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, 16.0s InterpolantComputationTime, 1951 NumberOfCodeBlocks, 1951 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2699 ConstructedInterpolants, 34 QuantifiedInterpolants, 25233 SizeOfPredicates, 88 NumberOfNonLiveVariables, 1623 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 63/1257 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 0.2s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown