/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe036.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 01:55:45,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 01:55:45,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 01:55:45,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 01:55:45,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 01:55:45,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 01:55:45,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 01:55:45,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 01:55:45,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 01:55:45,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 01:55:45,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 01:55:45,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 01:55:45,768 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 01:55:45,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 01:55:45,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 01:55:45,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 01:55:45,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 01:55:45,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 01:55:45,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 01:55:45,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 01:55:45,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 01:55:45,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 01:55:45,770 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 01:55:45,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 01:55:45,770 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 01:55:45,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 01:55:45,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 01:55:45,771 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 01:55:45,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 01:55:45,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 01:55:45,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 01:55:45,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 01:55:45,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 01:55:45,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 01:55:45,773 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 01:55:45,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 01:55:45,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 01:55:45,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 01:55:45,773 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 01:55:45,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT [2024-05-06 01:55:45,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 01:55:46,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 01:55:46,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 01:55:46,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 01:55:46,021 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 01:55:46,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe036.i [2024-05-06 01:55:47,045 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 01:55:47,281 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 01:55:47,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe036.i [2024-05-06 01:55:47,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5d290ea8e/5ef4877c51af4a9a9a69c79716fb66fc/FLAGcba63abff [2024-05-06 01:55:47,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5d290ea8e/5ef4877c51af4a9a9a69c79716fb66fc [2024-05-06 01:55:47,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 01:55:47,314 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 01:55:47,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 01:55:47,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 01:55:47,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 01:55:47,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:55:47" (1/1) ... [2024-05-06 01:55:47,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506afca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:55:47, skipping insertion in model container [2024-05-06 01:55:47,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:55:47" (1/1) ... [2024-05-06 01:55:47,355 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 01:55:47,468 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe036.i[941,954] [2024-05-06 01:55:47,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 01:55:47,605 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 01:55:47,617 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe036.i[941,954] [2024-05-06 01:55:47,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 01:55:47,689 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 01:55:47,689 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 01:55:47,695 INFO L206 MainTranslator]: Completed translation [2024-05-06 01:55:47,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:55:47 WrapperNode [2024-05-06 01:55:47,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 01:55:47,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 01:55:47,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 01:55:47,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 01:55:47,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:55:47" (1/1) ... [2024-05-06 01:55:47,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:55:47" (1/1) ... [2024-05-06 01:55:47,743 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2024-05-06 01:55:47,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 01:55:47,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 01:55:47,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 01:55:47,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 01:55:47,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:55:47" (1/1) ... [2024-05-06 01:55:47,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:55:47" (1/1) ... [2024-05-06 01:55:47,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:55:47" (1/1) ... [2024-05-06 01:55:47,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:55:47" (1/1) ... [2024-05-06 01:55:47,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:55:47" (1/1) ... [2024-05-06 01:55:47,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:55:47" (1/1) ... [2024-05-06 01:55:47,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:55:47" (1/1) ... [2024-05-06 01:55:47,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:55:47" (1/1) ... [2024-05-06 01:55:47,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 01:55:47,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 01:55:47,776 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 01:55:47,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 01:55:47,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:55:47" (1/1) ... [2024-05-06 01:55:47,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 01:55:47,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 01:55:47,809 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-06 01:55:47,828 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-06 01:55:47,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 01:55:47,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 01:55:47,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 01:55:47,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 01:55:47,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 01:55:47,851 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 01:55:47,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 01:55:47,864 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 01:55:47,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 01:55:47,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 01:55:47,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 01:55:47,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 01:55:47,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 01:55:47,867 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 01:55:47,986 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 01:55:47,994 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 01:55:48,140 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 01:55:48,146 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 01:55:48,147 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 01:55:48,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:55:48 BoogieIcfgContainer [2024-05-06 01:55:48,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 01:55:48,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 01:55:48,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 01:55:48,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 01:55:48,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 01:55:47" (1/3) ... [2024-05-06 01:55:48,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc7b38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:55:48, skipping insertion in model container [2024-05-06 01:55:48,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:55:47" (2/3) ... [2024-05-06 01:55:48,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc7b38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:55:48, skipping insertion in model container [2024-05-06 01:55:48,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:55:48" (3/3) ... [2024-05-06 01:55:48,154 INFO L112 eAbstractionObserver]: Analyzing ICFG safe036.i [2024-05-06 01:55:48,160 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 01:55:48,167 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 01:55:48,168 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 01:55:48,168 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 01:55:48,204 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 01:55:48,232 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 01:55:48,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 01:55:48,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 01:55:48,235 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-06 01:55:48,244 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-06 01:55:48,262 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 01:55:48,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 01:55:48,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 01:55:48,283 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;@683008b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 01:55:48,283 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-06 01:55:48,337 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 01:55:48,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 01:55:48,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1335423869, now seen corresponding path program 1 times [2024-05-06 01:55:48,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 01:55:48,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226944584] [2024-05-06 01:55:48,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:48,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 01:55:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 01:55:48,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 01:55:48,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226944584] [2024-05-06 01:55:48,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226944584] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 01:55:48,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 01:55:48,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 01:55:48,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057407952] [2024-05-06 01:55:48,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 01:55:48,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-06 01:55:48,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 01:55:48,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 01:55:48,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-06 01:55:48,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:55:48,593 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 01:55:48,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-06 01:55:48,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:55:48,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:55:48,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 01:55:48,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 01:55:48,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 01:55:48,612 INFO L85 PathProgramCache]: Analyzing trace with hash 8112446, now seen corresponding path program 1 times [2024-05-06 01:55:48,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 01:55:48,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100297751] [2024-05-06 01:55:48,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:48,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 01:55:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 01:55:48,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 01:55:48,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100297751] [2024-05-06 01:55:48,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100297751] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 01:55:48,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 01:55:48,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 01:55:48,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846406635] [2024-05-06 01:55:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 01:55:48,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 01:55:48,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 01:55:48,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 01:55:48,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-06 01:55:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:55:48,927 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 01:55:48,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-06 01:55:48,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:55:48,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:55:49,165 INFO L85 PathProgramCache]: Analyzing trace with hash 257654855, now seen corresponding path program 1 times [2024-05-06 01:55:49,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:49,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:49,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:49,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:55:49,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-06 01:55:49,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 01:55:49,230 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 01:55:49,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 01:55:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash 783775681, now seen corresponding path program 1 times [2024-05-06 01:55:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 01:55:49,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221999039] [2024-05-06 01:55:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:49,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 01:55:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 01:55:49,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 01:55:49,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221999039] [2024-05-06 01:55:49,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221999039] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 01:55:49,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 01:55:49,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 01:55:49,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487068648] [2024-05-06 01:55:49,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 01:55:49,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 01:55:49,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 01:55:49,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 01:55:49,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 01:55:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:55:49,453 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 01:55:49,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-06 01:55:49,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:55:49,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-06 01:55:49,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:55:49,611 INFO L85 PathProgramCache]: Analyzing trace with hash 257654855, now seen corresponding path program 2 times [2024-05-06 01:55:49,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:49,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:49,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1857126542, now seen corresponding path program 1 times [2024-05-06 01:55:49,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:49,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:49,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:49,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1314936280, now seen corresponding path program 1 times [2024-05-06 01:55:49,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:49,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:49,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,285 INFO L85 PathProgramCache]: Analyzing trace with hash -191793658, now seen corresponding path program 1 times [2024-05-06 01:55:50,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:50,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,370 INFO L85 PathProgramCache]: Analyzing trace with hash -698923546, now seen corresponding path program 1 times [2024-05-06 01:55:50,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:50,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,435 INFO L85 PathProgramCache]: Analyzing trace with hash -22545855, now seen corresponding path program 1 times [2024-05-06 01:55:50,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:50,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1938935395, now seen corresponding path program 1 times [2024-05-06 01:55:50,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:50,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,555 INFO L85 PathProgramCache]: Analyzing trace with hash -907285010, now seen corresponding path program 1 times [2024-05-06 01:55:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:50,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1633300786, now seen corresponding path program 1 times [2024-05-06 01:55:50,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:50,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1161065801, now seen corresponding path program 1 times [2024-05-06 01:55:50,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:50,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,816 INFO L85 PathProgramCache]: Analyzing trace with hash 730190416, now seen corresponding path program 1 times [2024-05-06 01:55:50,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:50,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2138542214, now seen corresponding path program 1 times [2024-05-06 01:55:50,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:50,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,000 INFO L85 PathProgramCache]: Analyzing trace with hash 623186120, now seen corresponding path program 1 times [2024-05-06 01:55:51,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:51,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1267097025, now seen corresponding path program 1 times [2024-05-06 01:55:51,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:51,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,098 INFO L85 PathProgramCache]: Analyzing trace with hash 733645381, now seen corresponding path program 1 times [2024-05-06 01:55:51,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:51,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1915980306, now seen corresponding path program 1 times [2024-05-06 01:55:51,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:51,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1600823700, now seen corresponding path program 1 times [2024-05-06 01:55:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:51,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 203575047, now seen corresponding path program 3 times [2024-05-06 01:55:51,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:55:51,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 01:55:51,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 01:55:51,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable21,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-06 01:55:51,287 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-06 01:55:51,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 01:55:51,288 INFO L85 PathProgramCache]: Analyzing trace with hash -618573567, now seen corresponding path program 2 times [2024-05-06 01:55:51,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 01:55:51,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590241634] [2024-05-06 01:55:51,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:51,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 01:55:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 01:55:51,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 01:55:51,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590241634] [2024-05-06 01:55:51,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590241634] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 01:55:51,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 01:55:51,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 01:55:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866452990] [2024-05-06 01:55:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 01:55:51,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 01:55:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 01:55:51,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 01:55:51,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 01:55:51,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:55:51,421 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 01:55:51,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-06 01:55:51,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:55:51,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 01:55:51,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 01:55:51,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:55:51,531 INFO L85 PathProgramCache]: Analyzing trace with hash 257654855, now seen corresponding path program 4 times [2024-05-06 01:55:51,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:51,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1857126542, now seen corresponding path program 2 times [2024-05-06 01:55:51,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1314936280, now seen corresponding path program 2 times [2024-05-06 01:55:51,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:51,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash -191793658, now seen corresponding path program 2 times [2024-05-06 01:55:51,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:51,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:51,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,002 INFO L85 PathProgramCache]: Analyzing trace with hash -698923546, now seen corresponding path program 2 times [2024-05-06 01:55:52,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:52,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,057 INFO L85 PathProgramCache]: Analyzing trace with hash -22545855, now seen corresponding path program 2 times [2024-05-06 01:55:52,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:52,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1938935395, now seen corresponding path program 2 times [2024-05-06 01:55:52,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:52,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,178 INFO L85 PathProgramCache]: Analyzing trace with hash -907285010, now seen corresponding path program 2 times [2024-05-06 01:55:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:52,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1633300786, now seen corresponding path program 2 times [2024-05-06 01:55:52,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:52,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1161065801, now seen corresponding path program 2 times [2024-05-06 01:55:52,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:52,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,428 INFO L85 PathProgramCache]: Analyzing trace with hash 730190416, now seen corresponding path program 2 times [2024-05-06 01:55:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:52,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2138542214, now seen corresponding path program 2 times [2024-05-06 01:55:52,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:52,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,603 INFO L85 PathProgramCache]: Analyzing trace with hash 623186120, now seen corresponding path program 2 times [2024-05-06 01:55:52,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:52,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1267097025, now seen corresponding path program 2 times [2024-05-06 01:55:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:52,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,713 INFO L85 PathProgramCache]: Analyzing trace with hash 733645381, now seen corresponding path program 2 times [2024-05-06 01:55:52,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:52,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1915980306, now seen corresponding path program 2 times [2024-05-06 01:55:52,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:52,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1600823700, now seen corresponding path program 2 times [2024-05-06 01:55:52,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:52,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,921 INFO L85 PathProgramCache]: Analyzing trace with hash 203575047, now seen corresponding path program 5 times [2024-05-06 01:55:52,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:52,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:52,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:53,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1392040242, now seen corresponding path program 3 times [2024-05-06 01:55:53,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:53,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash -647832152, now seen corresponding path program 3 times [2024-05-06 01:55:53,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:53,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:53,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1160044105, now seen corresponding path program 1 times [2024-05-06 01:55:53,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:53,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:53,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:53,455 INFO L85 PathProgramCache]: Analyzing trace with hash 730181490, now seen corresponding path program 1 times [2024-05-06 01:55:53,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 01:55:53,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 01:55:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:53,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 01:55:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 01:55:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 01:55:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 01:55:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 01:55:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 01:55:53,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-06 01:55:53,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-06 01:55:53,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-06 01:55:53,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable30,SelfDestructingSolverStorable41,SelfDestructingSolverStorable31,SelfDestructingSolverStorable42,SelfDestructingSolverStorable29,SelfDestructingSolverStorable32,SelfDestructingSolverStorable43,SelfDestructingSolverStorable22,SelfDestructingSolverStorable33,SelfDestructingSolverStorable44,SelfDestructingSolverStorable23,SelfDestructingSolverStorable34,SelfDestructingSolverStorable24,SelfDestructingSolverStorable35,SelfDestructingSolverStorable25,SelfDestructingSolverStorable36,SelfDestructingSolverStorable26,SelfDestructingSolverStorable37,SelfDestructingSolverStorable27,SelfDestructingSolverStorable38,SelfDestructingSolverStorable28,SelfDestructingSolverStorable39 [2024-05-06 01:55:53,529 INFO L448 BasicCegarLoop]: Path program histogram: [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-05-06 01:55:53,533 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 01:55:53,533 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 01:55:53,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 01:55:53 BasicIcfg [2024-05-06 01:55:53,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 01:55:53,540 INFO L158 Benchmark]: Toolchain (without parser) took 6226.41ms. Allocated memory was 290.5MB in the beginning and 475.0MB in the end (delta: 184.5MB). Free memory was 216.3MB in the beginning and 332.4MB in the end (delta: -116.1MB). Peak memory consumption was 69.5MB. Max. memory is 8.0GB. [2024-05-06 01:55:53,541 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 290.5MB. Free memory is still 258.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 01:55:53,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.74ms. Allocated memory is still 290.5MB. Free memory was 216.0MB in the beginning and 195.7MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-05-06 01:55:53,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.38ms. Allocated memory is still 290.5MB. Free memory was 195.7MB in the beginning and 193.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 01:55:53,541 INFO L158 Benchmark]: Boogie Preprocessor took 30.98ms. Allocated memory is still 290.5MB. Free memory was 193.6MB in the beginning and 192.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 01:55:53,541 INFO L158 Benchmark]: RCFGBuilder took 372.00ms. Allocated memory is still 290.5MB. Free memory was 192.2MB in the beginning and 247.9MB in the end (delta: -55.7MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2024-05-06 01:55:53,541 INFO L158 Benchmark]: TraceAbstraction took 5390.65ms. Allocated memory was 290.5MB in the beginning and 475.0MB in the end (delta: 184.5MB). Free memory was 246.3MB in the beginning and 332.4MB in the end (delta: -86.0MB). Peak memory consumption was 98.5MB. Max. memory is 8.0GB. [2024-05-06 01:55:53,542 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.42ms. Allocated memory is still 290.5MB. Free memory is still 258.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 380.74ms. Allocated memory is still 290.5MB. Free memory was 216.0MB in the beginning and 195.7MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.38ms. Allocated memory is still 290.5MB. Free memory was 195.7MB in the beginning and 193.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.98ms. Allocated memory is still 290.5MB. Free memory was 193.6MB in the beginning and 192.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 372.00ms. Allocated memory is still 290.5MB. Free memory was 192.2MB in the beginning and 247.9MB in the end (delta: -55.7MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * TraceAbstraction took 5390.65ms. Allocated memory was 290.5MB in the beginning and 475.0MB in the end (delta: 184.5MB). Free memory was 246.3MB in the beginning and 332.4MB in the end (delta: -86.0MB). Peak memory consumption was 98.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7895, independent: 7780, independent conditional: 7669, independent unconditional: 111, dependent: 115, dependent conditional: 115, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7882, independent: 7780, independent conditional: 7669, independent unconditional: 111, dependent: 102, dependent conditional: 102, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7882, independent: 7780, independent conditional: 7669, independent unconditional: 111, dependent: 102, dependent conditional: 102, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7882, independent: 7780, independent conditional: 7669, independent unconditional: 111, dependent: 102, dependent conditional: 102, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8115, independent: 7780, independent conditional: 3527, independent unconditional: 4253, dependent: 335, dependent conditional: 233, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8115, independent: 7780, independent conditional: 1727, independent unconditional: 6053, dependent: 335, dependent conditional: 73, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8115, independent: 7780, independent conditional: 1727, independent unconditional: 6053, dependent: 335, dependent conditional: 73, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 489, independent: 481, independent conditional: 101, independent unconditional: 380, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 489, independent: 476, independent conditional: 0, independent unconditional: 476, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 13, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 47, dependent conditional: 34, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8115, independent: 7299, independent conditional: 1626, independent unconditional: 5673, dependent: 327, dependent conditional: 70, dependent unconditional: 257, unknown: 489, unknown conditional: 104, unknown unconditional: 385] , Statistics on independence cache: Total cache size (in pairs): 489, Positive cache size: 481, Positive conditional cache size: 101, Positive unconditional cache size: 380, Negative cache size: 8, Negative conditional cache size: 3, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1960, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8115, independent: 7780, independent conditional: 3527, independent unconditional: 4253, dependent: 335, dependent conditional: 233, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8115, independent: 7780, independent conditional: 1727, independent unconditional: 6053, dependent: 335, dependent conditional: 73, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8115, independent: 7780, independent conditional: 1727, independent unconditional: 6053, dependent: 335, dependent conditional: 73, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 489, independent: 481, independent conditional: 101, independent unconditional: 380, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 489, independent: 476, independent conditional: 0, independent unconditional: 476, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 13, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 47, dependent conditional: 34, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8115, independent: 7299, independent conditional: 1626, independent unconditional: 5673, dependent: 327, dependent conditional: 70, dependent unconditional: 257, unknown: 489, unknown conditional: 104, unknown unconditional: 385] , Statistics on independence cache: Total cache size (in pairs): 489, Positive cache size: 481, Positive conditional cache size: 101, Positive unconditional cache size: 380, Negative cache size: 8, Negative conditional cache size: 3, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1960 ], Independence queries for same thread: 13 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 95 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 4.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 29, 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.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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: 3.7s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 61, ConditionalCommutativityTraceChecks: 41, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-06 01:55:53,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-06 01:55:53,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...