/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking BOTH --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/dekker.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 20:19:36,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 20:19:36,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 20:19:36,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 20:19:36,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 20:19:36,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 20:19:36,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 20:19:36,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 20:19:36,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 20:19:36,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 20:19:36,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 20:19:36,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 20:19:36,167 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 20:19:36,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 20:19:36,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 20:19:36,169 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 20:19:36,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 20:19:36,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 20:19:36,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 20:19:36,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 20:19:36,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 20:19:36,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 20:19:36,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 20:19:36,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 20:19:36,170 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 20:19:36,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 20:19:36,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 20:19:36,171 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 20:19:36,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 20:19:36,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 20:19:36,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 20:19:36,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 20:19:36,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 20:19:36,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 20:19:36,173 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 20:19:36,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 20:19:36,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 20:19:36,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 20:19:36,173 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 20:19:36,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 20:19:36,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 20:19:36,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 20:19:36,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 20:19:36,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 20:19:36,393 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 20:19:36,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker.i [2024-05-07 20:19:37,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 20:19:37,588 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 20:19:37,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i [2024-05-07 20:19:37,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ab2d0eb94/a397d18c2e804dbf8f50c0a2351acb5e/FLAG2ca99e6db [2024-05-07 20:19:37,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ab2d0eb94/a397d18c2e804dbf8f50c0a2351acb5e [2024-05-07 20:19:37,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 20:19:37,620 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 20:19:37,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 20:19:37,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 20:19:37,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 20:19:37,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 08:19:37" (1/1) ... [2024-05-07 20:19:37,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0c513f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:19:37, skipping insertion in model container [2024-05-07 20:19:37,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 08:19:37" (1/1) ... [2024-05-07 20:19:37,676 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 20:19:37,887 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-atomic/dekker.i[31403,31416] [2024-05-07 20:19:37,892 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-atomic/dekker.i[32483,32496] [2024-05-07 20:19:37,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 20:19:37,908 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 20:19:37,937 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-atomic/dekker.i[31403,31416] [2024-05-07 20:19:37,939 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-atomic/dekker.i[32483,32496] [2024-05-07 20:19:37,942 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 20:19:37,987 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 20:19:37,987 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 20:19:37,992 INFO L206 MainTranslator]: Completed translation [2024-05-07 20:19:37,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:19:37 WrapperNode [2024-05-07 20:19:37,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 20:19:37,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 20:19:37,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 20:19:37,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 20:19:38,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:19:37" (1/1) ... [2024-05-07 20:19:38,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:19:37" (1/1) ... [2024-05-07 20:19:38,022 INFO L138 Inliner]: procedures = 171, calls = 59, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2024-05-07 20:19:38,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 20:19:38,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 20:19:38,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 20:19:38,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 20:19:38,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:19:37" (1/1) ... [2024-05-07 20:19:38,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:19:37" (1/1) ... [2024-05-07 20:19:38,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:19:37" (1/1) ... [2024-05-07 20:19:38,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:19:37" (1/1) ... [2024-05-07 20:19:38,035 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:19:37" (1/1) ... [2024-05-07 20:19:38,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:19:37" (1/1) ... [2024-05-07 20:19:38,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:19:37" (1/1) ... [2024-05-07 20:19:38,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:19:37" (1/1) ... [2024-05-07 20:19:38,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 20:19:38,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 20:19:38,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 20:19:38,045 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 20:19:38,045 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:19:37" (1/1) ... [2024-05-07 20:19:38,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 20:19:38,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 20:19:38,081 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-07 20:19:38,088 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-07 20:19:38,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 20:19:38,121 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-05-07 20:19:38,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-05-07 20:19:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-05-07 20:19:38,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-05-07 20:19:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 20:19:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 20:19:38,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 20:19:38,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 20:19:38,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 20:19:38,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 20:19:38,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 20:19:38,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 20:19:38,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 20:19:38,126 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 20:19:38,231 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 20:19:38,233 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 20:19:38,392 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 20:19:38,399 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 20:19:38,399 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-07 20:19:38,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 08:19:38 BoogieIcfgContainer [2024-05-07 20:19:38,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 20:19:38,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 20:19:38,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 20:19:38,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 20:19:38,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 08:19:37" (1/3) ... [2024-05-07 20:19:38,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395788b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 08:19:38, skipping insertion in model container [2024-05-07 20:19:38,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 08:19:37" (2/3) ... [2024-05-07 20:19:38,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395788b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 08:19:38, skipping insertion in model container [2024-05-07 20:19:38,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 08:19:38" (3/3) ... [2024-05-07 20:19:38,407 INFO L112 eAbstractionObserver]: Analyzing ICFG dekker.i [2024-05-07 20:19:38,413 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 20:19:38,421 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 20:19:38,421 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-07 20:19:38,421 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 20:19:38,476 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-07 20:19:38,508 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 20:19:38,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 20:19:38,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 20:19:38,510 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-07 20:19:38,511 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-07 20:19:38,545 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 20:19:38,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:19:38,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 20:19:38,565 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;@3218f550, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 20:19:38,565 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-07 20:19:38,619 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-07 20:19:38,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:19:38,621 INFO L85 PathProgramCache]: Analyzing trace with hash 186579822, now seen corresponding path program 1 times [2024-05-07 20:19:38,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:19:38,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856867945] [2024-05-07 20:19:38,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:38,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-07 20:19:38,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:19:38,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856867945] [2024-05-07 20:19:38,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856867945] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 20:19:38,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 20:19:38,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 20:19:38,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140299808] [2024-05-07 20:19:38,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 20:19:38,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 20:19:38,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:19:38,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 20:19:38,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 20:19:38,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:38,885 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:19:38,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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-07 20:19:38,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:38,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:38,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 20:19:38,910 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-07 20:19:38,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:19:38,910 INFO L85 PathProgramCache]: Analyzing trace with hash 235160802, now seen corresponding path program 1 times [2024-05-07 20:19:38,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:19:38,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594224251] [2024-05-07 20:19:38,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:38,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 20:19:39,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:19:39,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594224251] [2024-05-07 20:19:39,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594224251] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 20:19:39,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 20:19:39,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-07 20:19:39,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131306307] [2024-05-07 20:19:39,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 20:19:39,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-07 20:19:39,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:19:39,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 20:19:39,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-07 20:19:39,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,143 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:19:39,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-07 20:19:39,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:39,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-07 20:19:39,193 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-07 20:19:39,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:19:39,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1672900364, now seen corresponding path program 1 times [2024-05-07 20:19:39,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:19:39,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992504385] [2024-05-07 20:19:39,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:39,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:39,236 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-07 20:19:39,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:19:39,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992504385] [2024-05-07 20:19:39,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992504385] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 20:19:39,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 20:19:39,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-07 20:19:39,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061841677] [2024-05-07 20:19:39,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 20:19:39,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-07 20:19:39,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:19:39,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 20:19:39,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-07 20:19:39,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,240 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:19:39,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-07 20:19:39,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:39,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:39,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 20:19:39,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-07 20:19:39,268 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-07 20:19:39,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:19:39,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1556961624, now seen corresponding path program 1 times [2024-05-07 20:19:39,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:19:39,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554084822] [2024-05-07 20:19:39,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:39,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:39,350 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-07 20:19:39,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:19:39,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554084822] [2024-05-07 20:19:39,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554084822] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 20:19:39,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 20:19:39,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-07 20:19:39,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222462663] [2024-05-07 20:19:39,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 20:19:39,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-07 20:19:39,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:19:39,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 20:19:39,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-07 20:19:39,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,357 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:19:39,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-07 20:19:39,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:39,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 20:19:39,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:39,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 20:19:39,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:39,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-07 20:19:39,392 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-07 20:19:39,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:19:39,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1049539935, now seen corresponding path program 1 times [2024-05-07 20:19:39,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:19:39,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033072631] [2024-05-07 20:19:39,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:39,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:19:39,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:19:39,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033072631] [2024-05-07 20:19:39,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033072631] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 20:19:39,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 20:19:39,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-07 20:19:39,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249671178] [2024-05-07 20:19:39,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 20:19:39,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-07 20:19:39,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:19:39,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 20:19:39,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-07 20:19:39,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,449 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:19:39,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-07 20:19:39,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:39,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 20:19:39,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:39,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:39,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 20:19:39,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:39,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:19:39,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-07 20:19:39,474 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-07 20:19:39,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:19:39,475 INFO L85 PathProgramCache]: Analyzing trace with hash -864655943, now seen corresponding path program 1 times [2024-05-07 20:19:39,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:19:39,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665990927] [2024-05-07 20:19:39,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:39,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 20:19:39,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:19:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665990927] [2024-05-07 20:19:39,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665990927] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 20:19:39,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 20:19:39,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-07 20:19:39,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954743376] [2024-05-07 20:19:39,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 20:19:39,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-07 20:19:39,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:19:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 20:19:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-07 20:19:39,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,537 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:19:39,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-07 20:19:39,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:39,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 20:19:39,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:39,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-07 20:19:39,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:39,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1672900357, now seen corresponding path program 1 times [2024-05-07 20:19:39,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:39,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:39,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:39,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1425699219, now seen corresponding path program 1 times [2024-05-07 20:19:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:39,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:39,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2373040, now seen corresponding path program 1 times [2024-05-07 20:19:40,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:40,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1051640603, now seen corresponding path program 1 times [2024-05-07 20:19:40,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:40,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1933478771, now seen corresponding path program 1 times [2024-05-07 20:19:40,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:40,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1647749232, now seen corresponding path program 1 times [2024-05-07 20:19:40,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:40,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1076721846, now seen corresponding path program 1 times [2024-05-07 20:19:40,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:40,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1805015836, now seen corresponding path program 1 times [2024-05-07 20:19:40,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:40,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,749 INFO L85 PathProgramCache]: Analyzing trace with hash -546560193, now seen corresponding path program 1 times [2024-05-07 20:19:40,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:40,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1208734307, now seen corresponding path program 1 times [2024-05-07 20:19:40,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:40,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:40,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:41,000 INFO L85 PathProgramCache]: Analyzing trace with hash -397661995, now seen corresponding path program 1 times [2024-05-07 20:19:41,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:41,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:41,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:41,081 INFO L85 PathProgramCache]: Analyzing trace with hash 98921144, now seen corresponding path program 1 times [2024-05-07 20:19:41,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:41,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:41,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:41,334 INFO L85 PathProgramCache]: Analyzing trace with hash 637147782, now seen corresponding path program 1 times [2024-05-07 20:19:41,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:41,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 20:19:41,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:41,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 20:19:41,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 20:19:41,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-07 20:19:42,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1917648042, now seen corresponding path program 1 times [2024-05-07 20:19:42,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:42,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 20:19:42,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:42,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 20:19:42,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 20:19:42,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-07 20:19:42,436 INFO L85 PathProgramCache]: Analyzing trace with hash -726195153, now seen corresponding path program 1 times [2024-05-07 20:19:42,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:42,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:42,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:42,535 INFO L85 PathProgramCache]: Analyzing trace with hash 755535615, now seen corresponding path program 1 times [2024-05-07 20:19:42,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:42,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:42,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:42,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1400593861, now seen corresponding path program 1 times [2024-05-07 20:19:42,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:42,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:42,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:42,741 INFO L85 PathProgramCache]: Analyzing trace with hash -386958989, now seen corresponding path program 1 times [2024-05-07 20:19:42,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:42,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:42,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash 169432030, now seen corresponding path program 1 times [2024-05-07 20:19:42,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:42,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:42,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash -217772560, now seen corresponding path program 1 times [2024-05-07 20:19:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:42,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:42,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1910657027, now seen corresponding path program 1 times [2024-05-07 20:19:43,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:43,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1209945771, now seen corresponding path program 1 times [2024-05-07 20:19:43,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:43,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,240 INFO L85 PathProgramCache]: Analyzing trace with hash 391751571, now seen corresponding path program 1 times [2024-05-07 20:19:43,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:43,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1788415619, now seen corresponding path program 1 times [2024-05-07 20:19:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1997307262, now seen corresponding path program 1 times [2024-05-07 20:19:43,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:43,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1321128709, now seen corresponding path program 1 times [2024-05-07 20:19:43,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:43,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1056162164, now seen corresponding path program 1 times [2024-05-07 20:19:43,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:43,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1393767455, now seen corresponding path program 2 times [2024-05-07 20:19:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:43,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:43,683 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-07 20:19:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:43,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:43,714 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-07 20:19:43,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 20:19:43,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-05-07 20:19:43,933 INFO L85 PathProgramCache]: Analyzing trace with hash 391751571, now seen corresponding path program 2 times [2024-05-07 20:19:43,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:43,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1788415619, now seen corresponding path program 2 times [2024-05-07 20:19:43,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:43,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:43,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:44,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1997307262, now seen corresponding path program 2 times [2024-05-07 20:19:44,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:44,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:44,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1321128709, now seen corresponding path program 2 times [2024-05-07 20:19:44,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:44,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:44,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:44,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1932137764, now seen corresponding path program 1 times [2024-05-07 20:19:44,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:44,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:44,306 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-07 20:19:44,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:44,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:44,326 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-07 20:19:44,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 20:19:44,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-05-07 20:19:44,592 INFO L85 PathProgramCache]: Analyzing trace with hash 391751571, now seen corresponding path program 3 times [2024-05-07 20:19:44,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:44,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:44,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:44,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1788415619, now seen corresponding path program 3 times [2024-05-07 20:19:44,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:44,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:44,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:44,763 INFO L85 PathProgramCache]: Analyzing trace with hash 661784930, now seen corresponding path program 1 times [2024-05-07 20:19:44,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:44,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:44,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:44,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:44,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:44,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 20:19:44,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:44,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:44,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 20:19:44,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable35,SelfDestructingSolverStorable14,SelfDestructingSolverStorable36,SelfDestructingSolverStorable15,SelfDestructingSolverStorable37,SelfDestructingSolverStorable16,SelfDestructingSolverStorable38,SelfDestructingSolverStorable17,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable20,SelfDestructingSolverStorable42,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable43,SelfDestructingSolverStorable22,SelfDestructingSolverStorable44,SelfDestructingSolverStorable23,SelfDestructingSolverStorable45,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 20:19:44,787 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-07 20:19:44,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 20:19:44,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1542276435, now seen corresponding path program 1 times [2024-05-07 20:19:44,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 20:19:44,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350955001] [2024-05-07 20:19:44,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:44,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:44,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:19:44,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 20:19:44,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350955001] [2024-05-07 20:19:44,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350955001] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 20:19:44,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586651449] [2024-05-07 20:19:44,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:44,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 20:19:44,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 20:19:44,835 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-07 20:19:44,838 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-07 20:19:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 20:19:44,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2024-05-07 20:19:44,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 20:19:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:19:44,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 20:19:44,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 20:19:44,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586651449] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 20:19:44,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 20:19:44,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-05-07 20:19:44,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856855931] [2024-05-07 20:19:44,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 20:19:44,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-07 20:19:44,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 20:19:44,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1056162164, now seen corresponding path program 2 times [2024-05-07 20:19:44,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 20:19:44,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 20:19:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:44,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 20:19:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 20:19:45,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 20:19:45,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-07 20:19:45,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:45,012 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 20:19:45,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-07 20:19:45,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:45,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:45,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 20:19:45,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:45,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:45,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 20:19:45,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 20:19:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 20:19:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 20:19:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 20:19:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 20:19:45,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-07 20:19:45,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-07 20:19:45,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-07 20:19:45,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-05-07 20:19:45,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-05-07 20:19:45,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-07 20:19:45,537 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-07 20:19:45,705 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,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47 [2024-05-07 20:19:45,710 INFO L448 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-07 20:19:45,713 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 20:19:45,713 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 20:19:45,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 08:19:45 BasicIcfg [2024-05-07 20:19:45,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 20:19:45,716 INFO L158 Benchmark]: Toolchain (without parser) took 8096.24ms. Allocated memory was 177.2MB in the beginning and 481.3MB in the end (delta: 304.1MB). Free memory was 108.0MB in the beginning and 264.7MB in the end (delta: -156.7MB). Peak memory consumption was 148.6MB. Max. memory is 8.0GB. [2024-05-07 20:19:45,716 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 20:19:45,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.45ms. Allocated memory was 177.2MB in the beginning and 265.3MB in the end (delta: 88.1MB). Free memory was 107.9MB in the beginning and 231.4MB in the end (delta: -123.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2024-05-07 20:19:45,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.57ms. Allocated memory is still 265.3MB. Free memory was 231.4MB in the beginning and 229.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 20:19:45,717 INFO L158 Benchmark]: Boogie Preprocessor took 21.39ms. Allocated memory is still 265.3MB. Free memory was 229.3MB in the beginning and 227.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 20:19:45,717 INFO L158 Benchmark]: RCFGBuilder took 356.18ms. Allocated memory is still 265.3MB. Free memory was 227.7MB in the beginning and 213.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-07 20:19:45,717 INFO L158 Benchmark]: TraceAbstraction took 7313.26ms. Allocated memory was 265.3MB in the beginning and 481.3MB in the end (delta: 216.0MB). Free memory was 211.5MB in the beginning and 264.7MB in the end (delta: -53.2MB). Peak memory consumption was 163.3MB. Max. memory is 8.0GB. [2024-05-07 20:19:45,718 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 372.45ms. Allocated memory was 177.2MB in the beginning and 265.3MB in the end (delta: 88.1MB). Free memory was 107.9MB in the beginning and 231.4MB in the end (delta: -123.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.57ms. Allocated memory is still 265.3MB. Free memory was 231.4MB in the beginning and 229.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.39ms. Allocated memory is still 265.3MB. Free memory was 229.3MB in the beginning and 227.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 356.18ms. Allocated memory is still 265.3MB. Free memory was 227.7MB in the beginning and 213.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7313.26ms. Allocated memory was 265.3MB in the beginning and 481.3MB in the end (delta: 216.0MB). Free memory was 211.5MB in the beginning and 264.7MB in the end (delta: -53.2MB). Peak memory consumption was 163.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 37726, independent: 34876, independent conditional: 34466, independent unconditional: 410, dependent: 2850, dependent conditional: 2850, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35390, independent: 34876, independent conditional: 34466, independent unconditional: 410, dependent: 514, dependent conditional: 514, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35390, independent: 34876, independent conditional: 34466, independent unconditional: 410, dependent: 514, dependent conditional: 514, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35390, independent: 34876, independent conditional: 34466, independent unconditional: 410, dependent: 514, dependent conditional: 514, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37559, independent: 34876, independent conditional: 16064, independent unconditional: 18812, dependent: 2683, dependent conditional: 1995, dependent unconditional: 688, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 37559, independent: 34876, independent conditional: 10168, independent unconditional: 24708, dependent: 2683, dependent conditional: 688, dependent unconditional: 1995, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37559, independent: 34876, independent conditional: 10168, independent unconditional: 24708, dependent: 2683, dependent conditional: 688, dependent unconditional: 1995, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1280, independent: 1224, independent conditional: 189, independent unconditional: 1035, dependent: 56, dependent conditional: 36, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1280, independent: 1217, independent conditional: 0, independent unconditional: 1217, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 56, dependent conditional: 36, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 56, dependent conditional: 36, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 76, dependent conditional: 59, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 37559, independent: 33652, independent conditional: 9979, independent unconditional: 23673, dependent: 2627, dependent conditional: 652, dependent unconditional: 1975, unknown: 1280, unknown conditional: 225, unknown unconditional: 1055] , Statistics on independence cache: Total cache size (in pairs): 1280, Positive cache size: 1224, Positive conditional cache size: 189, Positive unconditional cache size: 1035, Negative cache size: 56, Negative conditional cache size: 36, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7203, Maximal queried relation: 7, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37559, independent: 34876, independent conditional: 16064, independent unconditional: 18812, dependent: 2683, dependent conditional: 1995, dependent unconditional: 688, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 37559, independent: 34876, independent conditional: 10168, independent unconditional: 24708, dependent: 2683, dependent conditional: 688, dependent unconditional: 1995, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37559, independent: 34876, independent conditional: 10168, independent unconditional: 24708, dependent: 2683, dependent conditional: 688, dependent unconditional: 1995, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1280, independent: 1224, independent conditional: 189, independent unconditional: 1035, dependent: 56, dependent conditional: 36, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1280, independent: 1217, independent conditional: 0, independent unconditional: 1217, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 56, dependent conditional: 36, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 56, dependent conditional: 36, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 76, dependent conditional: 59, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 37559, independent: 33652, independent conditional: 9979, independent unconditional: 23673, dependent: 2627, dependent conditional: 652, dependent unconditional: 1975, unknown: 1280, unknown conditional: 225, unknown unconditional: 1055] , Statistics on independence cache: Total cache size (in pairs): 1280, Positive cache size: 1224, Positive conditional cache size: 189, Positive unconditional cache size: 1035, Negative cache size: 56, Negative conditional cache size: 36, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7203 ], Independence queries for same thread: 2336 - PositiveResult [Line: 780]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 739]: 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, 138 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 5.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 30, 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.5s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 482 ConstructedInterpolants, 0 QuantifiedInterpolants, 700 SizeOfPredicates, 1 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 12/15 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: 4.7s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 4, ConditionalCommutativityConditionCalculations: 72, ConditionalCommutativityTraceChecks: 37, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-07 20:19:45,733 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-07 20:19:45,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...