/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/popl20-mult-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-08 07:55:10,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-08 07:55:10,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-08 07:55:10,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-08 07:55:10,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-08 07:55:10,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-08 07:55:10,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-08 07:55:10,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-08 07:55:10,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-08 07:55:10,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-08 07:55:10,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-08 07:55:10,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-08 07:55:10,722 INFO L153 SettingsManager]: * Use SBE=true [2024-05-08 07:55:10,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-08 07:55:10,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-08 07:55:10,724 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-08 07:55:10,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-08 07:55:10,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-08 07:55:10,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-08 07:55:10,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-08 07:55:10,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-08 07:55:10,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-08 07:55:10,725 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-08 07:55:10,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-08 07:55:10,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-08 07:55:10,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-08 07:55:10,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-08 07:55:10,726 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-08 07:55:10,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-08 07:55:10,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 07:55:10,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-08 07:55:10,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-08 07:55:10,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-08 07:55:10,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-08 07:55:10,728 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-08 07:55:10,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-08 07:55:10,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-08 07:55:10,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-08 07:55:10,728 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-08 07:55:10,728 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 07:55:10,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-08 07:55:10,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-08 07:55:10,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-08 07:55:10,998 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-08 07:55:10,998 INFO L274 PluginConnector]: CDTParser initialized [2024-05-08 07:55:10,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-05-08 07:55:12,004 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-08 07:55:12,131 INFO L384 CDTParser]: Found 1 translation units. [2024-05-08 07:55:12,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-05-08 07:55:12,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4cdb4a0c7/40b794847bff471799a14168b7469a03/FLAG88d79019e [2024-05-08 07:55:12,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4cdb4a0c7/40b794847bff471799a14168b7469a03 [2024-05-08 07:55:12,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-08 07:55:12,150 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-08 07:55:12,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-08 07:55:12,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-08 07:55:12,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-08 07:55:12,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 07:55:12" (1/1) ... [2024-05-08 07:55:12,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f8e9104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:55:12, skipping insertion in model container [2024-05-08 07:55:12,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 07:55:12" (1/1) ... [2024-05-08 07:55:12,170 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-08 07:55:12,289 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/popl20-mult-equiv.wvr.c[2591,2604] [2024-05-08 07:55:12,292 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 07:55:12,299 INFO L202 MainTranslator]: Completed pre-run [2024-05-08 07:55:12,312 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/popl20-mult-equiv.wvr.c[2591,2604] [2024-05-08 07:55:12,313 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 07:55:12,318 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 07:55:12,318 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-08 07:55:12,323 INFO L206 MainTranslator]: Completed translation [2024-05-08 07:55:12,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:55:12 WrapperNode [2024-05-08 07:55:12,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-08 07:55:12,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-08 07:55:12,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-08 07:55:12,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-08 07:55:12,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:55:12" (1/1) ... [2024-05-08 07:55:12,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:55:12" (1/1) ... [2024-05-08 07:55:12,354 INFO L138 Inliner]: procedures = 22, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-05-08 07:55:12,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-08 07:55:12,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-08 07:55:12,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-08 07:55:12,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-08 07:55:12,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:55:12" (1/1) ... [2024-05-08 07:55:12,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:55:12" (1/1) ... [2024-05-08 07:55:12,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:55:12" (1/1) ... [2024-05-08 07:55:12,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:55:12" (1/1) ... [2024-05-08 07:55:12,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:55:12" (1/1) ... [2024-05-08 07:55:12,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:55:12" (1/1) ... [2024-05-08 07:55:12,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:55:12" (1/1) ... [2024-05-08 07:55:12,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:55:12" (1/1) ... [2024-05-08 07:55:12,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-08 07:55:12,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-08 07:55:12,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-08 07:55:12,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-08 07:55:12,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:55:12" (1/1) ... [2024-05-08 07:55:12,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 07:55:12,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 07:55:12,403 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 07:55:12,405 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 07:55:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-08 07:55:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-08 07:55:12,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-08 07:55:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-08 07:55:12,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-08 07:55:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-08 07:55:12,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-08 07:55:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-08 07:55:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-08 07:55:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-08 07:55:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-08 07:55:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-08 07:55:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-08 07:55:12,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-08 07:55:12,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-08 07:55:12,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-08 07:55:12,439 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 07:55:12,551 INFO L241 CfgBuilder]: Building ICFG [2024-05-08 07:55:12,554 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-08 07:55:12,789 INFO L282 CfgBuilder]: Performing block encoding [2024-05-08 07:55:12,832 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-08 07:55:12,833 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-08 07:55:12,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 07:55:12 BoogieIcfgContainer [2024-05-08 07:55:12,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-08 07:55:12,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-08 07:55:12,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-08 07:55:12,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-08 07:55:12,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.05 07:55:12" (1/3) ... [2024-05-08 07:55:12,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7858d073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 07:55:12, skipping insertion in model container [2024-05-08 07:55:12,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 07:55:12" (2/3) ... [2024-05-08 07:55:12,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7858d073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 07:55:12, skipping insertion in model container [2024-05-08 07:55:12,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 07:55:12" (3/3) ... [2024-05-08 07:55:12,840 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2024-05-08 07:55:12,845 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-08 07:55:12,852 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-08 07:55:12,852 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-08 07:55:12,852 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-08 07:55:12,893 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-08 07:55:12,930 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 07:55:12,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 07:55:12,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 07:55:12,933 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 07:55:12,940 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 07:55:12,977 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 07:55:12,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 07:55:12,997 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 07:55:13,008 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;@452435f2, 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 07:55:13,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-08 07:55:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash -319144301, now seen corresponding path program 1 times [2024-05-08 07:55:13,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:13,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:13,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:55:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:15,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1790820321, now seen corresponding path program 2 times [2024-05-08 07:55:15,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:15,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:15,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:55:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:15,534 INFO L85 PathProgramCache]: Analyzing trace with hash -319144639, now seen corresponding path program 3 times [2024-05-08 07:55:15,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:15,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:15,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:55:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:15,739 INFO L85 PathProgramCache]: Analyzing trace with hash 444321100, now seen corresponding path program 4 times [2024-05-08 07:55:15,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:15,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:55:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:16,067 INFO L85 PathProgramCache]: Analyzing trace with hash 845616928, now seen corresponding path program 5 times [2024-05-08 07:55:16,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:16,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:16,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:55:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:16,307 INFO L85 PathProgramCache]: Analyzing trace with hash 444321258, now seen corresponding path program 6 times [2024-05-08 07:55:16,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:16,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:16,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:55:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:16,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1540910357, now seen corresponding path program 1 times [2024-05-08 07:55:16,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:16,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:17,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:55:17,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:17,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:55:18,293 INFO L85 PathProgramCache]: Analyzing trace with hash 603896095, now seen corresponding path program 2 times [2024-05-08 07:55:18,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:18,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-08 07:55:18,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:18,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-08 07:55:18,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1540910019, now seen corresponding path program 3 times [2024-05-08 07:55:18,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:18,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:55:19,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:19,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:19,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-08 07:55:19,520 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-08 07:55:19,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 07:55:19,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1121987728, now seen corresponding path program 1 times [2024-05-08 07:55:19,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 07:55:19,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417841013] [2024-05-08 07:55:19,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:19,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-08 07:55:19,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 07:55:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417841013] [2024-05-08 07:55:19,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417841013] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 07:55:19,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 07:55:19,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-08 07:55:19,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849859133] [2024-05-08 07:55:19,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 07:55:19,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-08 07:55:19,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 07:55:19,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-08 07:55:19,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-08 07:55:19,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:55:19,622 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 07:55:19,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 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 07:55:19,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:55:19,791 INFO L85 PathProgramCache]: Analyzing trace with hash -319144301, now seen corresponding path program 7 times [2024-05-08 07:55:19,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:19,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:19,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:55:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:20,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1790820321, now seen corresponding path program 8 times [2024-05-08 07:55:20,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:20,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:20,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:55:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:20,199 INFO L85 PathProgramCache]: Analyzing trace with hash -319144639, now seen corresponding path program 9 times [2024-05-08 07:55:20,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:20,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:20,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:55:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:20,344 INFO L85 PathProgramCache]: Analyzing trace with hash 444321100, now seen corresponding path program 10 times [2024-05-08 07:55:20,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:20,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:20,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:55:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:20,553 INFO L85 PathProgramCache]: Analyzing trace with hash 845616928, now seen corresponding path program 11 times [2024-05-08 07:55:20,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:20,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:20,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:55:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:20,696 INFO L85 PathProgramCache]: Analyzing trace with hash 444321258, now seen corresponding path program 12 times [2024-05-08 07:55:20,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:20,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:20,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 07:55:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 07:55:20,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1540910357, now seen corresponding path program 4 times [2024-05-08 07:55:20,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-08 07:55:21,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:21,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:55:22,211 INFO L85 PathProgramCache]: Analyzing trace with hash 603896095, now seen corresponding path program 5 times [2024-05-08 07:55:22,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:22,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-08 07:55:22,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:22,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-08 07:55:22,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1540910019, now seen corresponding path program 6 times [2024-05-08 07:55:22,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:22,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:55:23,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:23,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 07:55:23,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:55:23,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable12,SelfDestructingSolverStorable23,SelfDestructingSolverStorable13,SelfDestructingSolverStorable24,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-08 07:55:23,333 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-08 07:55:23,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 07:55:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1005987980, now seen corresponding path program 1 times [2024-05-08 07:55:23,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 07:55:23,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567435469] [2024-05-08 07:55:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 07:55:23,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 07:55:23,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567435469] [2024-05-08 07:55:23,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567435469] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 07:55:23,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 07:55:23,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-08 07:55:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813988472] [2024-05-08 07:55:23,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 07:55:23,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-08 07:55:23,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 07:55:23,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-08 07:55:23,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-05-08 07:55:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:55:23,534 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 07:55:23,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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 07:55:23,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:55:23,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:55:23,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1656362122, now seen corresponding path program 1 times [2024-05-08 07:55:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:23,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:55:24,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:24,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-08 07:55:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1161809674, now seen corresponding path program 2 times [2024-05-08 07:55:25,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:25,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:55:26,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:26,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:55:26,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1656361784, now seen corresponding path program 3 times [2024-05-08 07:55:26,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:26,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:55:27,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:27,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-08 07:55:28,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:55:28,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-08 07:55:28,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-08 07:55:28,010 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-08 07:55:28,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 07:55:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1498311593, now seen corresponding path program 1 times [2024-05-08 07:55:28,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 07:55:28,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791409385] [2024-05-08 07:55:28,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:28,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 07:55:28,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 07:55:28,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791409385] [2024-05-08 07:55:28,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791409385] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 07:55:28,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665429161] [2024-05-08 07:55:28,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:28,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 07:55:28,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 07:55:28,367 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 07:55:28,368 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 07:55:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:28,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-08 07:55:28,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 07:55:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-08 07:55:29,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 07:55:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 07:55:30,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665429161] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 07:55:30,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 07:55:30,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 28 [2024-05-08 07:55:30,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048979791] [2024-05-08 07:55:30,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 07:55:30,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-05-08 07:55:30,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 07:55:30,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-05-08 07:55:30,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2024-05-08 07:55:30,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:55:30,533 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 07:55:30,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.071428571428571) internal successors, (142), 28 states have internal predecessors, (142), 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 07:55:30,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:55:30,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-08 07:55:30,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:55:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1583259718, now seen corresponding path program 4 times [2024-05-08 07:55:37,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:37,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:41,602 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 52 proven. 109 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-08 07:55:41,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:41,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 52 proven. 109 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-08 07:55:43,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1836411268, now seen corresponding path program 5 times [2024-05-08 07:55:43,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:43,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 1 proven. 144 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-05-08 07:55:46,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:46,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 148 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-05-08 07:55:53,943 INFO L85 PathProgramCache]: Analyzing trace with hash -765074951, now seen corresponding path program 6 times [2024-05-08 07:55:53,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:53,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:55:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 54 proven. 107 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-08 07:55:59,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:55:59,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:55:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:56:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 5 proven. 157 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-08 07:56:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:56:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-08 07:56:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-05-08 07:56:19,082 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 07:56:19,274 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,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38 [2024-05-08 07:56:19,274 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-08 07:56:19,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 07:56:19,274 INFO L85 PathProgramCache]: Analyzing trace with hash 382352847, now seen corresponding path program 2 times [2024-05-08 07:56:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 07:56:19,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161615696] [2024-05-08 07:56:19,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:56:19,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:56:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:56:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 100 proven. 76 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-08 07:56:21,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 07:56:21,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161615696] [2024-05-08 07:56:21,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161615696] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 07:56:21,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235479419] [2024-05-08 07:56:21,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 07:56:21,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 07:56:21,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 07:56:21,950 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 07:56:21,952 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 07:56:22,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 07:56:22,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 07:56:22,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 13 conjunts are in the unsatisfiable core [2024-05-08 07:56:22,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 07:56:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 70 proven. 43 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-05-08 07:56:22,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 07:56:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 75 proven. 1 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-05-08 07:56:22,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235479419] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 07:56:22,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 07:56:22,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 9, 6] total 42 [2024-05-08 07:56:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058595306] [2024-05-08 07:56:22,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 07:56:22,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-05-08 07:56:22,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 07:56:22,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-05-08 07:56:22,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1586, Unknown=0, NotChecked=0, Total=1722 [2024-05-08 07:56:22,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:56:22,746 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 07:56:22,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.5476190476190474) internal successors, (191), 42 states have internal predecessors, (191), 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 07:56:22,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:56:22,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-08 07:56:22,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-05-08 07:56:22,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:56:35,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 07:56:43,952 INFO L85 PathProgramCache]: Analyzing trace with hash -541329360, now seen corresponding path program 7 times [2024-05-08 07:56:43,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:56:43,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:56:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:56:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 1 proven. 296 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-08 07:56:49,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:56:49,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:56:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:56:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 117 proven. 202 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-08 07:56:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash 398659290, now seen corresponding path program 8 times [2024-05-08 07:56:59,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:56:59,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:56:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:57:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 7 proven. 296 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-05-08 07:57:11,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:57:11,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:57:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:57:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 9 proven. 296 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-08 07:57:20,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1331423272, now seen corresponding path program 9 times [2024-05-08 07:57:20,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:57:20,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:57:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:57:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 51 proven. 271 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-05-08 07:57:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:57:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:57:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:58:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 5 proven. 312 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-05-08 07:58:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 07:58:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-08 07:58:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-05-08 07:58:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2024-05-08 07:58:04,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-08 07:58:04,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable39 [2024-05-08 07:58:04,606 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-08 07:58:04,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 07:58:04,606 INFO L85 PathProgramCache]: Analyzing trace with hash 745367709, now seen corresponding path program 3 times [2024-05-08 07:58:04,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 07:58:04,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114401446] [2024-05-08 07:58:04,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 07:58:04,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 07:58:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 07:58:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 184 proven. 128 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-05-08 07:58:08,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 07:58:08,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114401446] [2024-05-08 07:58:08,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114401446] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 07:58:08,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746286964] [2024-05-08 07:58:08,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-08 07:58:08,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 07:58:08,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 07:58:08,211 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 07:58:08,213 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 07:58:08,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-05-08 07:58:08,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 07:58:08,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 71 conjunts are in the unsatisfiable core [2024-05-08 07:58:08,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 08:03:09,191 WARN L293 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 08:04:50,856 WARN L293 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 08:07:27,897 WARN L293 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-08 08:07:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 140 proven. 162 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-05-08 08:07:27,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 08:07:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-08 08:07:42,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746286964] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 08:07:42,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 08:07:42,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 38, 52] total 129 [2024-05-08 08:07:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221652294] [2024-05-08 08:07:42,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 08:07:42,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 129 states [2024-05-08 08:07:42,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 08:07:42,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2024-05-08 08:07:42,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2945, Invalid=13494, Unknown=73, NotChecked=0, Total=16512 [2024-05-08 08:07:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:07:42,673 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 08:07:42,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 129 states, 129 states have (on average 2.4031007751937983) internal successors, (310), 129 states have internal predecessors, (310), 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:07:42,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:07:42,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-08 08:07:42,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-05-08 08:07:42,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 130 states. [2024-05-08 08:07:42,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 08:08:24,432 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:08:29,458 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:08:38,774 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:08:58,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-08 08:09:06,272 WARN L293 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 85 DAG size of output: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2024-05-08 08:09:23,677 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:09:23,678 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 08:09:23,715 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:09:24,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-08 08:09:24,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 08:09:24,228 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-3-2-2-1 term,while SimplifyDDA2 was simplifying 14 xjuncts wrt. a ATOM-1 context. [2024-05-08 08:09:24,230 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-08 08:09:24,231 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-08 08:09:24,231 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-08 08:09:24,231 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-08 08:09:24,234 INFO L448 BasicCegarLoop]: Path program histogram: [12, 9, 6, 3, 1, 1] [2024-05-08 08:09:24,236 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-08 08:09:24,236 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-08 08:09:24,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.05 08:09:24 BasicIcfg [2024-05-08 08:09:24,238 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-08 08:09:24,239 INFO L158 Benchmark]: Toolchain (without parser) took 852088.75ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 85.8MB in the beginning and 840.9MB in the end (delta: -755.1MB). Peak memory consumption was 218.5MB. Max. memory is 8.0GB. [2024-05-08 08:09:24,239 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 151.0MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-08 08:09:24,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.78ms. Allocated memory is still 151.0MB. Free memory was 85.7MB in the beginning and 74.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-08 08:09:24,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.92ms. Allocated memory is still 151.0MB. Free memory was 74.2MB in the beginning and 72.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-08 08:09:24,239 INFO L158 Benchmark]: Boogie Preprocessor took 17.83ms. Allocated memory is still 151.0MB. Free memory was 72.4MB in the beginning and 71.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-08 08:09:24,240 INFO L158 Benchmark]: RCFGBuilder took 460.58ms. Allocated memory is still 151.0MB. Free memory was 71.1MB in the beginning and 120.7MB in the end (delta: -49.5MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. [2024-05-08 08:09:24,240 INFO L158 Benchmark]: TraceAbstraction took 851402.57ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 119.1MB in the beginning and 840.9MB in the end (delta: -721.8MB). Peak memory consumption was 250.7MB. Max. memory is 8.0GB. [2024-05-08 08:09:24,248 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 151.0MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.78ms. Allocated memory is still 151.0MB. Free memory was 85.7MB in the beginning and 74.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.92ms. Allocated memory is still 151.0MB. Free memory was 74.2MB in the beginning and 72.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.83ms. Allocated memory is still 151.0MB. Free memory was 72.4MB in the beginning and 71.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 460.58ms. Allocated memory is still 151.0MB. Free memory was 71.1MB in the beginning and 120.7MB in the end (delta: -49.5MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. * TraceAbstraction took 851402.57ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 119.1MB in the beginning and 840.9MB in the end (delta: -721.8MB). Peak memory consumption was 250.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9587, independent: 8750, independent conditional: 6788, independent unconditional: 1962, dependent: 824, dependent conditional: 810, dependent unconditional: 14, unknown: 13, unknown conditional: 6, unknown unconditional: 7] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8806, independent: 8750, independent conditional: 6788, independent unconditional: 1962, dependent: 43, dependent conditional: 29, dependent unconditional: 14, unknown: 13, unknown conditional: 6, unknown unconditional: 7] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8806, independent: 8750, independent conditional: 6788, independent unconditional: 1962, dependent: 43, dependent conditional: 29, dependent unconditional: 14, unknown: 13, unknown conditional: 6, unknown unconditional: 7] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8806, independent: 8750, independent conditional: 6788, independent unconditional: 1962, dependent: 43, dependent conditional: 29, dependent unconditional: 14, unknown: 13, unknown conditional: 6, unknown unconditional: 7] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8883, independent: 8750, independent conditional: 2969, independent unconditional: 5781, dependent: 104, dependent conditional: 32, dependent unconditional: 72, unknown: 29, unknown conditional: 5, unknown unconditional: 24] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8883, independent: 8750, independent conditional: 2720, independent unconditional: 6030, dependent: 104, dependent conditional: 13, dependent unconditional: 91, unknown: 29, unknown conditional: 0, unknown unconditional: 29] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8883, independent: 8750, independent conditional: 2720, independent unconditional: 6030, dependent: 104, dependent conditional: 13, dependent unconditional: 91, unknown: 29, unknown conditional: 0, unknown unconditional: 29] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 381, independent: 370, independent conditional: 0, independent unconditional: 370, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 381, independent: 370, independent conditional: 0, independent unconditional: 370, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2050, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1028, dependent conditional: 960, dependent unconditional: 68, unknown: 1022, unknown conditional: 0, unknown unconditional: 1022] , Protected Queries: 0 ], Cache Queries: [ total: 8883, independent: 8380, independent conditional: 2720, independent unconditional: 5660, dependent: 94, dependent conditional: 8, dependent unconditional: 86, unknown: 409, unknown conditional: 5, unknown unconditional: 404] , Statistics on independence cache: Total cache size (in pairs): 380, Positive cache size: 370, Positive conditional cache size: 0, Positive unconditional cache size: 370, Negative cache size: 10, Negative conditional cache size: 5, Negative unconditional cache size: 5, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 273, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8883, independent: 8750, independent conditional: 2969, independent unconditional: 5781, dependent: 104, dependent conditional: 32, dependent unconditional: 72, unknown: 29, unknown conditional: 5, unknown unconditional: 24] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8883, independent: 8750, independent conditional: 2720, independent unconditional: 6030, dependent: 104, dependent conditional: 13, dependent unconditional: 91, unknown: 29, unknown conditional: 0, unknown unconditional: 29] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8883, independent: 8750, independent conditional: 2720, independent unconditional: 6030, dependent: 104, dependent conditional: 13, dependent unconditional: 91, unknown: 29, unknown conditional: 0, unknown unconditional: 29] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 381, independent: 370, independent conditional: 0, independent unconditional: 370, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 381, independent: 370, independent conditional: 0, independent unconditional: 370, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2050, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1028, dependent conditional: 960, dependent unconditional: 68, unknown: 1022, unknown conditional: 0, unknown unconditional: 1022] , Protected Queries: 0 ], Cache Queries: [ total: 8883, independent: 8380, independent conditional: 2720, independent unconditional: 5660, dependent: 94, dependent conditional: 8, dependent unconditional: 86, unknown: 409, unknown conditional: 5, unknown unconditional: 404] , Statistics on independence cache: Total cache size (in pairs): 380, Positive cache size: 370, Positive conditional cache size: 0, Positive unconditional cache size: 370, Negative cache size: 10, Negative conditional cache size: 5, Negative unconditional cache size: 5, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 273 ], Independence queries for same thread: 781 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-3-2-2-1 term,while SimplifyDDA2 was simplifying 14 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-3-2-2-1 term,while SimplifyDDA2 was simplifying 14 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-3-2-2-1 term,while SimplifyDDA2 was simplifying 14 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-15-2-3-2-2-1 term,while SimplifyDDA2 was simplifying 14 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 111 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 851.3s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 12, EmptinessCheckTime: 266.2s, 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: 288, 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.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 583.2s InterpolantComputationTime, 853 NumberOfCodeBlocks, 853 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1191 ConstructedInterpolants, 0 QuantifiedInterpolants, 16836 SizeOfPredicates, 29 NumberOfNonLiveVariables, 768 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 888/1653 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: 135.9s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 28, ConditionalCommutativityTraceChecks: 27, ConditionalCommutativityImperfectProofs: 15 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown