/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe-Lockstep.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-98196c323137eee61a7c1131837b356358d783d4-98196c3 [2021-06-17 09:18:57,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-17 09:18:57,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-17 09:18:57,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-17 09:18:57,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-17 09:18:57,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-17 09:18:57,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-17 09:18:57,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-17 09:18:57,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-17 09:18:57,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-17 09:18:57,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-17 09:18:57,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-17 09:18:57,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-17 09:18:57,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-17 09:18:57,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-17 09:18:57,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-17 09:18:57,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-17 09:18:57,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-17 09:18:57,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-17 09:18:57,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-17 09:18:57,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-17 09:18:57,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-17 09:18:57,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-17 09:18:57,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-17 09:18:57,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-17 09:18:57,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-17 09:18:57,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-17 09:18:57,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-17 09:18:57,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-17 09:18:57,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-17 09:18:57,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-17 09:18:57,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-17 09:18:57,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-17 09:18:57,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-17 09:18:57,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-17 09:18:57,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-17 09:18:57,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-17 09:18:57,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-17 09:18:57,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-17 09:18:57,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-17 09:18:57,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-17 09:18:57,137 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe-Lockstep.epf [2021-06-17 09:18:57,150 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-17 09:18:57,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-17 09:18:57,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-17 09:18:57,151 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-17 09:18:57,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-17 09:18:57,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-17 09:18:57,152 INFO L138 SettingsManager]: * Use SBE=true [2021-06-17 09:18:57,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-17 09:18:57,152 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-17 09:18:57,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-17 09:18:57,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-17 09:18:57,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-17 09:18:57,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-17 09:18:57,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-17 09:18:57,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-17 09:18:57,152 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-17 09:18:57,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-17 09:18:57,153 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-17 09:18:57,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-17 09:18:57,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-17 09:18:57,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-17 09:18:57,153 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-17 09:18:57,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-17 09:18:57,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-17 09:18:57,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-17 09:18:57,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-17 09:18:57,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-17 09:18:57,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-17 09:18:57,165 INFO L138 SettingsManager]: * DFS Order used in POR=PSEUDO_LOCKSTEP [2021-06-17 09:18:57,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-17 09:18:57,169 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-17 09:18:57,169 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-06-17 09:18:57,169 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-17 09:18:57,169 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2021-06-17 09:18:57,169 INFO L138 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/UAutomizer-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 [2021-06-17 09:18:57,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-17 09:18:57,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-17 09:18:57,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-17 09:18:57,397 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-17 09:18:57,398 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-17 09:18:57,398 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl [2021-06-17 09:18:57,399 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-06-17 09:18:57,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-17 09:18:57,424 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-17 09:18:57,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-17 09:18:57,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-17 09:18:57,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-17 09:18:57,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.06 09:18:57" (1/1) ... [2021-06-17 09:18:57,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.06 09:18:57" (1/1) ... [2021-06-17 09:18:57,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-17 09:18:57,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-17 09:18:57,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-17 09:18:57,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-17 09:18:57,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.06 09:18:57" (1/1) ... [2021-06-17 09:18:57,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.06 09:18:57" (1/1) ... [2021-06-17 09:18:57,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.06 09:18:57" (1/1) ... [2021-06-17 09:18:57,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.06 09:18:57" (1/1) ... [2021-06-17 09:18:57,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.06 09:18:57" (1/1) ... [2021-06-17 09:18:57,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.06 09:18:57" (1/1) ... [2021-06-17 09:18:57,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.06 09:18:57" (1/1) ... [2021-06-17 09:18:57,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-17 09:18:57,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-17 09:18:57,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-17 09:18:57,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-17 09:18:57,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.06 09:18:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-17 09:18:57,526 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-06-17 09:18:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-06-17 09:18:57,526 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-06-17 09:18:57,527 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-06-17 09:18:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-06-17 09:18:57,527 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-06-17 09:18:57,528 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-17 09:18:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-17 09:18:57,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-17 09:18:57,529 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-06-17 09:18:57,529 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-06-17 09:18:57,529 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-06-17 09:18:57,530 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-17 09:18:57,723 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-17 09:18:57,723 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-17 09:18:57,724 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.06 09:18:57 BoogieIcfgContainer [2021-06-17 09:18:57,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-17 09:18:57,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-17 09:18:57,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-17 09:18:57,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-17 09:18:57,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.06 09:18:57" (1/2) ... [2021-06-17 09:18:57,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6015d7c2 and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.06 09:18:57, skipping insertion in model container [2021-06-17 09:18:57,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.06 09:18:57" (2/2) ... [2021-06-17 09:18:57,729 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-06-17 09:18:57,747 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-17 09:18:57,747 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-17 09:18:57,747 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-17 09:18:57,748 INFO L470 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-17 09:18:57,766 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,766 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,767 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,767 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,767 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,768 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,768 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,768 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,769 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,769 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,769 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,769 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,770 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,770 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,770 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,770 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,774 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,775 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-17 09:18:57,776 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-17 09:18:57,790 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-17 09:18:57,835 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-17 09:18:57,835 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-17 09:18:57,835 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-17 09:18:57,835 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-17 09:18:57,835 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-17 09:18:57,835 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-17 09:18:57,835 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-17 09:18:57,835 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2Thread1of1ForFork2======== [2021-06-17 09:18:57,987 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:18:57,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:18:57,991 INFO L82 PathProgramCache]: Analyzing trace with hash -557721125, now seen corresponding path program 1 times [2021-06-17 09:18:57,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:18:57,998 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330809103] [2021-06-17 09:18:57,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:18:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:18:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-17 09:18:58,101 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:18:58,101 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330809103] [2021-06-17 09:18:58,102 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330809103] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:18:58,102 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:18:58,102 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-17 09:18:58,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793569643] [2021-06-17 09:18:58,106 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-17 09:18:58,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:18:58,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-17 09:18:58,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-17 09:18:58,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,120 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:18:58,122 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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) [2021-06-17 09:18:58,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,227 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-17 09:18:58,227 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:18:58,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:18:58,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1770428136, now seen corresponding path program 1 times [2021-06-17 09:18:58,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:18:58,228 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265771809] [2021-06-17 09:18:58,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:18:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:18:58,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-17 09:18:58,262 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:18:58,262 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265771809] [2021-06-17 09:18:58,262 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265771809] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:18:58,262 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:18:58,262 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-17 09:18:58,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296582075] [2021-06-17 09:18:58,263 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-17 09:18:58,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:18:58,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-17 09:18:58,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-17 09:18:58,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,264 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:18:58,264 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2021-06-17 09:18:58,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:58,323 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-17 09:18:58,323 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:18:58,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:18:58,327 INFO L82 PathProgramCache]: Analyzing trace with hash -2102210591, now seen corresponding path program 1 times [2021-06-17 09:18:58,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:18:58,327 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968274245] [2021-06-17 09:18:58,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:18:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:18:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-17 09:18:58,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:18:58,360 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968274245] [2021-06-17 09:18:58,360 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968274245] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:18:58,360 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:18:58,360 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-17 09:18:58,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954538277] [2021-06-17 09:18:58,360 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-17 09:18:58,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:18:58,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-17 09:18:58,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-17 09:18:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,361 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:18:58,361 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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) [2021-06-17 09:18:58,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:58,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:58,604 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-17 09:18:58,604 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:18:58,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:18:58,606 INFO L82 PathProgramCache]: Analyzing trace with hash -465219145, now seen corresponding path program 1 times [2021-06-17 09:18:58,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:18:58,606 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666675144] [2021-06-17 09:18:58,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:18:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:18:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2021-06-17 09:18:58,700 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:18:58,700 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666675144] [2021-06-17 09:18:58,700 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666675144] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:18:58,701 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:18:58,701 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-17 09:18:58,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263824112] [2021-06-17 09:18:58,701 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-17 09:18:58,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:18:58,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-17 09:18:58,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-17 09:18:58,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,702 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:18:58,702 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2021-06-17 09:18:58,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:58,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:58,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:58,835 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-17 09:18:58,835 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:18:58,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:18:58,836 INFO L82 PathProgramCache]: Analyzing trace with hash 804038700, now seen corresponding path program 1 times [2021-06-17 09:18:58,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:18:58,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048236534] [2021-06-17 09:18:58,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:18:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:18:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-06-17 09:18:58,909 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:18:58,910 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048236534] [2021-06-17 09:18:58,910 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048236534] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:18:58,910 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:18:58,910 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-17 09:18:58,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158949851] [2021-06-17 09:18:58,910 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-17 09:18:58,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:18:58,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-17 09:18:58,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-17 09:18:58,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,911 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:18:58,911 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2021-06-17 09:18:58,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:58,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:58,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:58,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:58,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:59,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:59,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,091 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-17 09:18:59,091 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:18:59,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:18:59,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1337507702, now seen corresponding path program 1 times [2021-06-17 09:18:59,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:18:59,092 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383173891] [2021-06-17 09:18:59,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:18:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:18:59,162 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-06-17 09:18:59,162 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:18:59,162 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383173891] [2021-06-17 09:18:59,162 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383173891] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:18:59,163 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:18:59,163 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-17 09:18:59,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786958741] [2021-06-17 09:18:59,163 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-17 09:18:59,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:18:59,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-17 09:18:59,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-17 09:18:59,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:59,164 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:18:59,164 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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) [2021-06-17 09:18:59,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:59,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:59,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:18:59,345 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-17 09:18:59,345 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:18:59,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:18:59,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1521521136, now seen corresponding path program 2 times [2021-06-17 09:18:59,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:18:59,345 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285784131] [2021-06-17 09:18:59,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:18:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:18:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-06-17 09:18:59,404 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:18:59,404 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285784131] [2021-06-17 09:18:59,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285784131] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:18:59,405 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:18:59,405 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-17 09:18:59,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565677589] [2021-06-17 09:18:59,406 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-17 09:18:59,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:18:59,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-17 09:18:59,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-17 09:18:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:59,407 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:18:59,408 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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) [2021-06-17 09:18:59,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:59,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:18:59,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:18:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:18:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:18:59,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:18:59,576 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-17 09:18:59,577 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:18:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:18:59,577 INFO L82 PathProgramCache]: Analyzing trace with hash -135642702, now seen corresponding path program 3 times [2021-06-17 09:18:59,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:18:59,578 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722353807] [2021-06-17 09:18:59,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:18:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:18:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 85 proven. 5 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2021-06-17 09:18:59,640 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:18:59,640 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722353807] [2021-06-17 09:18:59,640 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722353807] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:18:59,640 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155109868] [2021-06-17 09:18:59,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:18:59,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-17 09:18:59,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-17 09:18:59,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-17 09:18:59,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-17 09:19:00,068 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 12 proven. 182 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-06-17 09:19:00,068 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155109868] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:00,068 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-17 09:19:00,068 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 15 [2021-06-17 09:19:00,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938662932] [2021-06-17 09:19:00,070 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-17 09:19:00,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:00,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-17 09:19:00,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-06-17 09:19:00,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:00,072 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:00,072 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.466666666666667) internal successors, (112), 15 states have internal predecessors, (112), 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) [2021-06-17 09:19:00,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:00,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:00,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:00,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:00,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:00,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:00,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:00,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:02,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:02,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:02,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:02,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:02,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:02,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:02,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:02,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-06-17 09:19:02,314 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:02,314 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:02,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:02,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1625040659, now seen corresponding path program 4 times [2021-06-17 09:19:02,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:02,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130371020] [2021-06-17 09:19:02,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-06-17 09:19:02,327 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:02,327 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130371020] [2021-06-17 09:19:02,327 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130371020] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:19:02,327 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:19:02,327 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-17 09:19:02,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536151859] [2021-06-17 09:19:02,328 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-17 09:19:02,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:02,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-17 09:19:02,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-17 09:19:02,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:02,329 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:02,329 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-17 09:19:02,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:02,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:02,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:02,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:02,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:02,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:02,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:02,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2021-06-17 09:19:02,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:02,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-06-17 09:19:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:02,989 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-17 09:19:02,989 INFO L430 AbstractCegarLoop]: === Iteration 10 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:02,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2013959553, now seen corresponding path program 5 times [2021-06-17 09:19:02,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:02,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95727253] [2021-06-17 09:19:02,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 264 proven. 251 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2021-06-17 09:19:03,063 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:03,063 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95727253] [2021-06-17 09:19:03,063 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95727253] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:03,063 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465876701] [2021-06-17 09:19:03,063 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:03,122 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-06-17 09:19:03,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-17 09:19:03,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-17 09:19:03,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-17 09:19:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 211 proven. 4 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2021-06-17 09:19:03,421 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465876701] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:03,421 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-17 09:19:03,421 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-17 09:19:03,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847059730] [2021-06-17 09:19:03,421 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-17 09:19:03,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:03,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-17 09:19:03,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-06-17 09:19:03,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:03,422 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:03,422 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 6.352941176470588) internal successors, (108), 17 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-17 09:19:03,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:03,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:03,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:03,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:03,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:03,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:03,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:03,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2021-06-17 09:19:03,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:03,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:08,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:08,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:08,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-06-17 09:19:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-06-17 09:19:08,380 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-06-17 09:19:08,381 INFO L430 AbstractCegarLoop]: === Iteration 11 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:08,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:08,381 INFO L82 PathProgramCache]: Analyzing trace with hash 203004414, now seen corresponding path program 6 times [2021-06-17 09:19:08,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:08,382 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877622632] [2021-06-17 09:19:08,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2427 backedges. 776 proven. 53 refuted. 0 times theorem prover too weak. 1598 trivial. 0 not checked. [2021-06-17 09:19:08,514 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:08,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877622632] [2021-06-17 09:19:08,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877622632] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:08,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360669650] [2021-06-17 09:19:08,514 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:08,572 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2021-06-17 09:19:08,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-17 09:19:08,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-17 09:19:08,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-17 09:19:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2427 backedges. 1208 proven. 342 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2021-06-17 09:19:08,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360669650] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:08,854 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-17 09:19:08,854 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-17 09:19:08,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713684894] [2021-06-17 09:19:08,855 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-17 09:19:08,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:08,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-17 09:19:08,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-17 09:19:08,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:08,857 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:08,857 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 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) [2021-06-17 09:19:08,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:08,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:08,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:08,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:08,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:08,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:08,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:08,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2021-06-17 09:19:08,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:08,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2021-06-17 09:19:08,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-06-17 09:19:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-06-17 09:19:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-17 09:19:11,456 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:11,459 INFO L430 AbstractCegarLoop]: === Iteration 12 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:11,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:11,459 INFO L82 PathProgramCache]: Analyzing trace with hash -53634442, now seen corresponding path program 7 times [2021-06-17 09:19:11,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:11,459 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155256089] [2021-06-17 09:19:11,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2427 backedges. 377 proven. 7 refuted. 0 times theorem prover too weak. 2043 trivial. 0 not checked. [2021-06-17 09:19:11,552 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:11,552 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155256089] [2021-06-17 09:19:11,552 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155256089] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:11,552 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843460351] [2021-06-17 09:19:11,552 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:11,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-17 09:19:11,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-17 09:19:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2427 backedges. 297 proven. 5 refuted. 0 times theorem prover too weak. 2125 trivial. 0 not checked. [2021-06-17 09:19:11,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843460351] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:11,945 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-17 09:19:11,945 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-17 09:19:11,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406898669] [2021-06-17 09:19:11,945 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-17 09:19:11,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-17 09:19:11,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-17 09:19:11,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:11,946 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:11,946 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 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) [2021-06-17 09:19:11,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:11,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:11,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:11,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:11,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:11,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:11,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:11,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2021-06-17 09:19:11,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:11,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2021-06-17 09:19:11,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2021-06-17 09:19:11,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-06-17 09:19:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-06-17 09:19:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-17 09:19:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-06-17 09:19:15,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-06-17 09:19:15,444 INFO L430 AbstractCegarLoop]: === Iteration 13 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:15,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:15,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1734611577, now seen corresponding path program 8 times [2021-06-17 09:19:15,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:15,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481240648] [2021-06-17 09:19:15,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 342 proven. 5 refuted. 0 times theorem prover too weak. 2353 trivial. 0 not checked. [2021-06-17 09:19:15,513 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:15,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481240648] [2021-06-17 09:19:15,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481240648] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:15,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366572043] [2021-06-17 09:19:15,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:15,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-17 09:19:15,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-17 09:19:15,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-17 09:19:15,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-17 09:19:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 342 proven. 5 refuted. 0 times theorem prover too weak. 2353 trivial. 0 not checked. [2021-06-17 09:19:15,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366572043] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:15,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-17 09:19:15,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-06-17 09:19:15,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404652017] [2021-06-17 09:19:15,797 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-17 09:19:15,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:15,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-17 09:19:15,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-17 09:19:15,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:15,797 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:15,797 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-17 09:19:15,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:15,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:15,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:15,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:15,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:15,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:15,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:15,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2021-06-17 09:19:15,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:15,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2021-06-17 09:19:15,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2021-06-17 09:19:15,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2021-06-17 09:19:15,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-06-17 09:19:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-06-17 09:19:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-17 09:19:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-06-17 09:19:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-17 09:19:18,245 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:18,245 INFO L430 AbstractCegarLoop]: === Iteration 14 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:18,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:18,262 INFO L82 PathProgramCache]: Analyzing trace with hash 97935835, now seen corresponding path program 9 times [2021-06-17 09:19:18,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:18,262 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265381863] [2021-06-17 09:19:18,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3063 backedges. 1418 proven. 0 refuted. 0 times theorem prover too weak. 1645 trivial. 0 not checked. [2021-06-17 09:19:18,321 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:18,321 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265381863] [2021-06-17 09:19:18,321 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265381863] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:19:18,321 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:19:18,321 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-17 09:19:18,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006937918] [2021-06-17 09:19:18,322 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-17 09:19:18,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:18,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-17 09:19:18,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-17 09:19:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:18,323 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:18,323 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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) [2021-06-17 09:19:18,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:18,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:18,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:18,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:18,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:18,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:18,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:18,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2021-06-17 09:19:18,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:18,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2021-06-17 09:19:18,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2021-06-17 09:19:18,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2021-06-17 09:19:18,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2021-06-17 09:19:18,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:20,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:20,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-06-17 09:19:20,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:20,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-06-17 09:19:20,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-17 09:19:20,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-06-17 09:19:20,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-17 09:19:20,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:20,168 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-17 09:19:20,168 INFO L430 AbstractCegarLoop]: === Iteration 15 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:20,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:20,169 INFO L82 PathProgramCache]: Analyzing trace with hash 910433099, now seen corresponding path program 10 times [2021-06-17 09:19:20,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:20,169 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838800633] [2021-06-17 09:19:20,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:20,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3168 backedges. 1449 proven. 144 refuted. 0 times theorem prover too weak. 1575 trivial. 0 not checked. [2021-06-17 09:19:20,238 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:20,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838800633] [2021-06-17 09:19:20,238 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838800633] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:20,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330568698] [2021-06-17 09:19:20,238 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:20,321 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-17 09:19:20,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-17 09:19:20,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-17 09:19:20,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-17 09:19:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3168 backedges. 451 proven. 9 refuted. 0 times theorem prover too weak. 2708 trivial. 0 not checked. [2021-06-17 09:19:20,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330568698] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:20,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-17 09:19:20,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-17 09:19:20,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672333843] [2021-06-17 09:19:20,707 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-17 09:19:20,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:20,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-17 09:19:20,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-17 09:19:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:20,707 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:20,708 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 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) [2021-06-17 09:19:20,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:20,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:20,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:20,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:20,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:20,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:20,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:20,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2021-06-17 09:19:20,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:20,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2021-06-17 09:19:20,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2021-06-17 09:19:20,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2021-06-17 09:19:20,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2021-06-17 09:19:20,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:20,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-06-17 09:19:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-06-17 09:19:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-17 09:19:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-06-17 09:19:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-17 09:19:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:27,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2021-06-17 09:19:27,717 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-17 09:19:27,717 INFO L430 AbstractCegarLoop]: === Iteration 16 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:27,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:27,718 INFO L82 PathProgramCache]: Analyzing trace with hash -768666919, now seen corresponding path program 11 times [2021-06-17 09:19:27,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:27,718 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247636674] [2021-06-17 09:19:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-17 09:19:27,745 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-17 09:19:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-17 09:19:27,784 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-17 09:19:27,819 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-17 09:19:27,819 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-17 09:19:27,820 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-17 09:19:27,840 INFO L301 ceAbstractionStarter]: Result for error location Process2Thread1of1ForFork2 was UNSAFE (1/5) [2021-06-17 09:19:27,843 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-06-17 09:19:27,854 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-17 09:19:27,855 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-17 09:19:27,855 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-17 09:19:27,855 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-17 09:19:27,855 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-17 09:19:27,855 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-17 09:19:27,855 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-17 09:19:27,855 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2======== Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-17 09:19:28,098 INFO L301 ceAbstractionStarter]: Result for error location Process2 was SAFE (2/5) [2021-06-17 09:19:28,099 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-17 09:19:28,103 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-17 09:19:28,103 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-17 09:19:28,103 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-17 09:19:28,104 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-17 09:19:28,104 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-17 09:19:28,104 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-17 09:19:28,104 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-17 09:19:28,104 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1======== [2021-06-17 09:19:28,310 INFO L301 ceAbstractionStarter]: Result for error location Process1 was SAFE (3/5) [2021-06-17 09:19:28,310 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-17 09:19:28,315 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-17 09:19:28,315 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-17 09:19:28,315 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-17 09:19:28,315 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-17 09:19:28,315 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-17 09:19:28,315 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-17 09:19:28,315 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-17 09:19:28,315 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-17 09:19:28,517 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (4/5) [2021-06-17 09:19:28,518 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-17 09:19:28,524 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-17 09:19:28,524 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-17 09:19:28,524 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-17 09:19:28,524 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-17 09:19:28,524 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-17 09:19:28,524 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-17 09:19:28,524 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-17 09:19:28,524 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1Thread1of1ForFork1======== [2021-06-17 09:19:28,564 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:28,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:28,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1815351175, now seen corresponding path program 1 times [2021-06-17 09:19:28,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:28,564 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672875043] [2021-06-17 09:19:28,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-17 09:19:28,570 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:28,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672875043] [2021-06-17 09:19:28,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672875043] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:19:28,570 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:19:28,570 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-17 09:19:28,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377422982] [2021-06-17 09:19:28,571 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-17 09:19:28,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:28,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-17 09:19:28,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-17 09:19:28,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,571 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:28,571 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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) [2021-06-17 09:19:28,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,587 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-17 09:19:28,587 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:28,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:28,587 INFO L82 PathProgramCache]: Analyzing trace with hash -613960431, now seen corresponding path program 1 times [2021-06-17 09:19:28,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:28,588 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531577471] [2021-06-17 09:19:28,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-17 09:19:28,594 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:28,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531577471] [2021-06-17 09:19:28,594 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531577471] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:19:28,594 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:19:28,594 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-17 09:19:28,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518130024] [2021-06-17 09:19:28,594 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-17 09:19:28,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:28,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-17 09:19:28,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-17 09:19:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,595 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:28,595 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2021-06-17 09:19:28,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,603 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-17 09:19:28,604 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:28,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:28,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1644901312, now seen corresponding path program 1 times [2021-06-17 09:19:28,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:28,604 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672960707] [2021-06-17 09:19:28,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-17 09:19:28,611 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:28,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672960707] [2021-06-17 09:19:28,611 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672960707] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:19:28,611 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:19:28,611 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-17 09:19:28,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020380478] [2021-06-17 09:19:28,611 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-17 09:19:28,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:28,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-17 09:19:28,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-17 09:19:28,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,612 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:28,612 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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) [2021-06-17 09:19:28,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,681 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-17 09:19:28,681 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:28,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:28,681 INFO L82 PathProgramCache]: Analyzing trace with hash 523952555, now seen corresponding path program 1 times [2021-06-17 09:19:28,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:28,682 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170414857] [2021-06-17 09:19:28,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-06-17 09:19:28,692 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:28,692 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170414857] [2021-06-17 09:19:28,692 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170414857] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:19:28,692 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:19:28,693 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-17 09:19:28,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631877719] [2021-06-17 09:19:28,693 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-17 09:19:28,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:28,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-17 09:19:28,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-17 09:19:28,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,693 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:28,693 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2021-06-17 09:19:28,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,781 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-17 09:19:28,781 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:28,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:28,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2053377194, now seen corresponding path program 1 times [2021-06-17 09:19:28,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:28,781 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143000609] [2021-06-17 09:19:28,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:28,795 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2021-06-17 09:19:28,795 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:28,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143000609] [2021-06-17 09:19:28,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143000609] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:19:28,795 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:19:28,795 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-17 09:19:28,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239226390] [2021-06-17 09:19:28,796 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-17 09:19:28,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:28,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-17 09:19:28,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-17 09:19:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,796 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:28,796 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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) [2021-06-17 09:19:28,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,899 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-17 09:19:28,899 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:28,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:28,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1064534606, now seen corresponding path program 1 times [2021-06-17 09:19:28,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:28,900 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055936785] [2021-06-17 09:19:28,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2021-06-17 09:19:28,915 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:28,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055936785] [2021-06-17 09:19:28,915 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055936785] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:19:28,915 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:19:28,915 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-17 09:19:28,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734144499] [2021-06-17 09:19:28,916 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-17 09:19:28,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:28,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-17 09:19:28,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-17 09:19:28,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,916 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:28,916 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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) [2021-06-17 09:19:28,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:28,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:28,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:29,047 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-17 09:19:29,047 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:29,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:29,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1632937881, now seen corresponding path program 2 times [2021-06-17 09:19:29,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:29,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458501894] [2021-06-17 09:19:29,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2021-06-17 09:19:29,077 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:29,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458501894] [2021-06-17 09:19:29,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458501894] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:19:29,077 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:19:29,077 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-17 09:19:29,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341720358] [2021-06-17 09:19:29,078 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-17 09:19:29,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:29,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-17 09:19:29,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-17 09:19:29,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:29,078 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:29,078 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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) [2021-06-17 09:19:29,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:29,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:29,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:29,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:29,205 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-17 09:19:29,205 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:29,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:29,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1501339171, now seen corresponding path program 3 times [2021-06-17 09:19:29,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:29,206 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123085228] [2021-06-17 09:19:29,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 107 proven. 5 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2021-06-17 09:19:29,237 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:29,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123085228] [2021-06-17 09:19:29,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123085228] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:29,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943464896] [2021-06-17 09:19:29,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:29,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-06-17 09:19:29,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-17 09:19:29,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-17 09:19:29,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-17 09:19:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 12 proven. 256 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-06-17 09:19:29,649 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943464896] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:29,649 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-17 09:19:29,649 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 15 [2021-06-17 09:19:29,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719852936] [2021-06-17 09:19:29,650 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-17 09:19:29,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:29,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-17 09:19:29,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-06-17 09:19:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:29,650 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:29,651 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 8.2) internal successors, (123), 15 states have internal predecessors, (123), 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) [2021-06-17 09:19:29,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:29,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:29,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:29,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:29,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-06-17 09:19:31,528 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-06-17 09:19:31,531 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:31,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:31,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1949739110, now seen corresponding path program 4 times [2021-06-17 09:19:31,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:31,531 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143921064] [2021-06-17 09:19:31,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2021-06-17 09:19:31,548 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:31,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143921064] [2021-06-17 09:19:31,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143921064] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-17 09:19:31,548 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-17 09:19:31,548 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-17 09:19:31,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722009708] [2021-06-17 09:19:31,548 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-17 09:19:31,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:31,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-17 09:19:31,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-17 09:19:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:31,548 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:31,548 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-17 09:19:31,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:31,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:31,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:31,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:31,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:31,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:31,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:31,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2021-06-17 09:19:31,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:31,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:31,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:31,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-06-17 09:19:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:31,822 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-17 09:19:31,822 INFO L430 AbstractCegarLoop]: === Iteration 10 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:31,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:31,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1084548295, now seen corresponding path program 5 times [2021-06-17 09:19:31,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:31,823 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288183196] [2021-06-17 09:19:31,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 474 proven. 235 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2021-06-17 09:19:31,879 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:31,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288183196] [2021-06-17 09:19:31,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288183196] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:31,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312220289] [2021-06-17 09:19:31,879 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:31,934 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-06-17 09:19:31,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-17 09:19:31,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-17 09:19:31,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-17 09:19:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 604 proven. 246 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2021-06-17 09:19:32,131 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312220289] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:32,131 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-17 09:19:32,131 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 13 [2021-06-17 09:19:32,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297472822] [2021-06-17 09:19:32,131 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-17 09:19:32,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:32,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-17 09:19:32,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-17 09:19:32,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:32,132 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:32,132 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 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) [2021-06-17 09:19:32,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:32,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:32,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:32,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:32,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:32,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:32,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:32,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2021-06-17 09:19:32,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:32,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:33,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:33,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:33,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:33,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:33,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:33,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:33,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:33,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-06-17 09:19:33,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:33,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-17 09:19:34,040 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-06-17 09:19:34,041 INFO L430 AbstractCegarLoop]: === Iteration 11 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:34,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:34,041 INFO L82 PathProgramCache]: Analyzing trace with hash -651007076, now seen corresponding path program 6 times [2021-06-17 09:19:34,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:34,041 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103072590] [2021-06-17 09:19:34,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 408 proven. 201 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2021-06-17 09:19:34,088 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:34,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103072590] [2021-06-17 09:19:34,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103072590] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:34,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790469946] [2021-06-17 09:19:34,088 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:34,137 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2021-06-17 09:19:34,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-17 09:19:34,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-17 09:19:34,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-17 09:19:34,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 69 proven. 414 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2021-06-17 09:19:34,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790469946] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:34,434 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-17 09:19:34,434 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 20 [2021-06-17 09:19:34,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321107765] [2021-06-17 09:19:34,435 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-17 09:19:34,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:34,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-17 09:19:34,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-17 09:19:34,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:34,435 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:34,435 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.7) internal successors, (114), 20 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-17 09:19:34,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:34,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:34,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:34,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:34,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:34,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:34,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:34,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2021-06-17 09:19:34,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:34,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2021-06-17 09:19:34,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:39,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-06-17 09:19:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-17 09:19:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2021-06-17 09:19:39,945 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:39,945 INFO L430 AbstractCegarLoop]: === Iteration 12 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:39,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:39,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2145808157, now seen corresponding path program 7 times [2021-06-17 09:19:39,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:39,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972843290] [2021-06-17 09:19:39,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2750 backedges. 1410 proven. 317 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2021-06-17 09:19:40,030 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:40,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972843290] [2021-06-17 09:19:40,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972843290] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:40,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319628441] [2021-06-17 09:19:40,030 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:40,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-17 09:19:40,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-17 09:19:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2750 backedges. 437 proven. 12 refuted. 0 times theorem prover too weak. 2301 trivial. 0 not checked. [2021-06-17 09:19:40,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319628441] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:40,334 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-17 09:19:40,334 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-17 09:19:40,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22574411] [2021-06-17 09:19:40,335 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-17 09:19:40,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:40,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-17 09:19:40,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-06-17 09:19:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:40,335 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:40,336 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 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) [2021-06-17 09:19:40,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:40,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:40,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:40,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:40,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:40,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:40,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:40,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2021-06-17 09:19:40,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:40,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2021-06-17 09:19:40,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2021-06-17 09:19:40,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-06-17 09:19:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-17 09:19:44,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2021-06-17 09:19:44,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-17 09:19:44,610 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-06-17 09:19:44,610 INFO L430 AbstractCegarLoop]: === Iteration 13 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:44,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:44,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1517239139, now seen corresponding path program 8 times [2021-06-17 09:19:44,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:44,610 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607701216] [2021-06-17 09:19:44,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6551 backedges. 2511 proven. 526 refuted. 0 times theorem prover too weak. 3514 trivial. 0 not checked. [2021-06-17 09:19:44,696 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:44,696 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607701216] [2021-06-17 09:19:44,697 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607701216] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:44,697 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670123867] [2021-06-17 09:19:44,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:44,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-17 09:19:44,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-17 09:19:44,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 13 conjunts are in the unsatisfiable core [2021-06-17 09:19:44,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-17 09:19:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6551 backedges. 1195 proven. 39 refuted. 0 times theorem prover too weak. 5317 trivial. 0 not checked. [2021-06-17 09:19:45,065 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670123867] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:45,066 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-17 09:19:45,066 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 16 [2021-06-17 09:19:45,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372901466] [2021-06-17 09:19:45,066 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-17 09:19:45,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:45,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-17 09:19:45,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-06-17 09:19:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:45,067 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:45,067 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 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) [2021-06-17 09:19:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2021-06-17 09:19:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2021-06-17 09:19:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2021-06-17 09:19:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2021-06-17 09:19:45,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-06-17 09:19:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-17 09:19:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2021-06-17 09:19:49,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-06-17 09:19:49,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-17 09:19:50,185 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-06-17 09:19:50,185 INFO L430 AbstractCegarLoop]: === Iteration 14 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:50,186 INFO L82 PathProgramCache]: Analyzing trace with hash -678831516, now seen corresponding path program 9 times [2021-06-17 09:19:50,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:50,186 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451369948] [2021-06-17 09:19:50,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4939 backedges. 1088 proven. 548 refuted. 0 times theorem prover too weak. 3303 trivial. 0 not checked. [2021-06-17 09:19:50,259 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:50,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451369948] [2021-06-17 09:19:50,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451369948] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:50,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897651630] [2021-06-17 09:19:50,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:50,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-06-17 09:19:50,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-17 09:19:50,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 13 conjunts are in the unsatisfiable core [2021-06-17 09:19:50,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-17 09:19:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4939 backedges. 783 proven. 2084 refuted. 0 times theorem prover too weak. 2072 trivial. 0 not checked. [2021-06-17 09:19:50,698 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897651630] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:50,698 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-17 09:19:50,698 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 21 [2021-06-17 09:19:50,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4506342] [2021-06-17 09:19:50,698 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-17 09:19:50,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:50,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-17 09:19:50,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-06-17 09:19:50,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:50,699 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:50,699 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 6.190476190476191) internal successors, (130), 21 states have internal predecessors, (130), 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) [2021-06-17 09:19:50,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:50,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:50,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:50,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:50,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:50,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:50,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:50,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2021-06-17 09:19:50,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:50,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2021-06-17 09:19:50,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2021-06-17 09:19:50,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2021-06-17 09:19:50,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2021-06-17 09:19:50,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:51,039 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2021-06-17 09:19:57,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-06-17 09:19:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-17 09:19:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2021-06-17 09:19:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-06-17 09:19:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-17 09:19:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-17 09:19:57,446 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:57,446 INFO L430 AbstractCegarLoop]: === Iteration 15 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:19:57,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:19:57,446 INFO L82 PathProgramCache]: Analyzing trace with hash -446336655, now seen corresponding path program 10 times [2021-06-17 09:19:57,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:19:57,446 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523095181] [2021-06-17 09:19:57,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:19:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:19:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 209 proven. 11 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2021-06-17 09:19:57,500 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:19:57,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523095181] [2021-06-17 09:19:57,500 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523095181] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:57,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548554774] [2021-06-17 09:19:57,500 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:19:57,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-17 09:19:57,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-17 09:19:57,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-17 09:19:57,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-17 09:19:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 209 proven. 11 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2021-06-17 09:19:57,653 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548554774] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:19:57,654 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-17 09:19:57,654 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-06-17 09:19:57,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126717041] [2021-06-17 09:19:57,654 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-17 09:19:57,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:19:57,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-17 09:19:57,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-17 09:19:57,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:57,654 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:19:57,654 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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) [2021-06-17 09:19:57,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:19:57,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:57,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:57,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:57,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:57,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:57,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:19:57,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2021-06-17 09:19:57,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:19:57,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2021-06-17 09:19:57,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2021-06-17 09:19:57,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2021-06-17 09:19:57,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2021-06-17 09:19:57,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2021-06-17 09:19:57,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:20:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:20:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:20:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:20:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:20:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:20:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:20:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:20:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-06-17 09:20:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:20:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-17 09:20:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2021-06-17 09:20:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-06-17 09:20:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-17 09:20:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-17 09:20:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-17 09:20:04,861 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-06-17 09:20:04,861 INFO L430 AbstractCegarLoop]: === Iteration 16 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:20:04,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:20:04,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1712017502, now seen corresponding path program 11 times [2021-06-17 09:20:04,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:20:04,861 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946631420] [2021-06-17 09:20:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:20:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-17 09:20:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 352 proven. 19 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2021-06-17 09:20:04,941 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-17 09:20:04,941 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946631420] [2021-06-17 09:20:04,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946631420] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:20:04,941 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398265333] [2021-06-17 09:20:04,941 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:20:04,994 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-06-17 09:20:04,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-17 09:20:04,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-17 09:20:04,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-17 09:20:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 496 proven. 240 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2021-06-17 09:20:05,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398265333] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-17 09:20:05,300 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-17 09:20:05,300 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 27 [2021-06-17 09:20:05,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840846242] [2021-06-17 09:20:05,301 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-17 09:20:05,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-17 09:20:05,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-17 09:20:05,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2021-06-17 09:20:05,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:20:05,302 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-17 09:20:05,302 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 4.925925925925926) internal successors, (133), 27 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-06-17 09:20:05,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:20:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-17 09:20:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:20:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:20:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:20:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:20:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:20:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-17 09:20:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-06-17 09:20:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-17 09:20:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-17 09:20:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2021-06-17 09:20:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-06-17 09:20:18,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-17 09:20:18,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-17 09:20:18,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-17 09:20:18,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-06-17 09:20:18,913 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-17 09:20:18,913 INFO L430 AbstractCegarLoop]: === Iteration 17 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-17 09:20:18,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-17 09:20:18,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1902496532, now seen corresponding path program 12 times [2021-06-17 09:20:18,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-17 09:20:18,914 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162192934] [2021-06-17 09:20:18,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-17 09:20:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-17 09:20:18,941 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-17 09:20:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-17 09:20:18,961 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-17 09:20:18,988 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-17 09:20:18,988 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-17 09:20:18,988 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-17 09:20:18,997 INFO L301 ceAbstractionStarter]: Result for error location Process1Thread1of1ForFork1 was UNSAFE (5/5) [2021-06-17 09:20:18,997 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-17 09:20:19,366 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.06 09:20:19 BasicIcfg [2021-06-17 09:20:19,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-17 09:20:19,366 INFO L168 Benchmark]: Toolchain (without parser) took 81942.11 ms. Allocated memory was 175.1 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 155.9 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.8 GB. Max. memory is 8.0 GB. [2021-06-17 09:20:19,366 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 175.1 MB. Free memory is still 157.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-17 09:20:19,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.88 ms. Allocated memory is still 175.1 MB. Free memory was 155.7 MB in the beginning and 154.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-17 09:20:19,367 INFO L168 Benchmark]: Boogie Preprocessor took 15.61 ms. Allocated memory is still 175.1 MB. Free memory was 154.4 MB in the beginning and 153.4 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-17 09:20:19,367 INFO L168 Benchmark]: RCFGBuilder took 258.92 ms. Allocated memory is still 175.1 MB. Free memory was 153.2 MB in the beginning and 140.8 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-06-17 09:20:19,367 INFO L168 Benchmark]: TraceAbstraction took 81640.47 ms. Allocated memory was 175.1 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 140.3 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 8.0 GB. [2021-06-17 09:20:19,368 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 175.1 MB. Free memory is still 157.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 21.88 ms. Allocated memory is still 175.1 MB. Free memory was 155.7 MB in the beginning and 154.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 15.61 ms. Allocated memory is still 175.1 MB. Free memory was 154.4 MB in the beginning and 153.4 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 258.92 ms. Allocated memory is still 175.1 MB. Free memory was 153.2 MB in the beginning and 140.8 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 81640.47 ms. Allocated memory was 175.1 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 140.3 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 508867, positive: 388051, positive conditional: 386265, positive unconditional: 1786, negative: 120816, negative conditional: 120703, negative unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 432596, positive: 388051, positive conditional: 386265, positive unconditional: 1786, negative: 44545, negative conditional: 44432, negative unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 432596, positive: 376635, positive conditional: 0, positive unconditional: 376635, negative: 55961, negative conditional: 0, negative unconditional: 55961, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 910, positive: 861, positive conditional: 0, positive unconditional: 861, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 910, positive: 830, positive conditional: 0, positive unconditional: 830, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 432596, positive: 375774, positive conditional: 0, positive unconditional: 375774, negative: 55912, negative conditional: 0, negative unconditional: 55912, unknown: 910, unknown conditional: 0, unknown unconditional: 910] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172 ], Maximal queried relation: 15, Independence queries for same thread: 76271 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 6923, Number of persistent set computation: 272311, Number of trivial persistent sets: 263079, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 508867, positive: 388051, positive conditional: 386265, positive unconditional: 1786, negative: 120816, negative conditional: 120703, negative unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 432596, positive: 388051, positive conditional: 386265, positive unconditional: 1786, negative: 44545, negative conditional: 44432, negative unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 432596, positive: 376635, positive conditional: 0, positive unconditional: 376635, negative: 55961, negative conditional: 0, negative unconditional: 55961, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 910, positive: 861, positive conditional: 0, positive unconditional: 861, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 910, positive: 830, positive conditional: 0, positive unconditional: 830, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 432596, positive: 375774, positive conditional: 0, positive unconditional: 375774, negative: 55912, negative conditional: 0, negative unconditional: 55912, unknown: 910, unknown conditional: 0, unknown unconditional: 910] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172, SemanticConditionEliminator.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 650222, positive: 11416, positive conditional: 11416, positive unconditional: 0, negative: 638806, negative conditional: 207274, negative unconditional: 431532, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2503, positive: 249, positive conditional: 218, positive unconditional: 31, negative: 2254, negative conditional: 2205, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2568, positive: 214, positive conditional: 173, positive unconditional: 41, negative: 2353, negative conditional: 2209, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 650222, positive: 11198, positive conditional: 11198, positive unconditional: 0, negative: 636601, negative conditional: 205069, negative unconditional: 431532, unknown: 2423, unknown conditional: 2423, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3333, Positive cache size: 1079, Positive conditional cache size: 218, Positive unconditional cache size: 861, Negative cache size: 2254, Negative conditional cache size: 2205, Negative unconditional cache size: 49, Eliminated conditions: 431172 ], Maximal queried relation: 15, Independence queries for same thread: 76271 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9047, positive: 7487, positive conditional: 5635, positive unconditional: 1852, negative: 1560, negative conditional: 1462, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 8061, positive: 7487, positive conditional: 5635, positive unconditional: 1852, negative: 574, negative conditional: 476, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 8061, positive: 7487, positive conditional: 0, positive unconditional: 7487, negative: 574, negative conditional: 0, negative unconditional: 574, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 956, positive: 906, positive conditional: 0, positive unconditional: 906, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 956, positive: 875, positive conditional: 0, positive unconditional: 875, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 81, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 85, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8061, positive: 6581, positive conditional: 0, positive unconditional: 6581, negative: 524, negative conditional: 0, negative unconditional: 524, unknown: 956, unknown conditional: 0, unknown unconditional: 956] , Statistics on independence cache: Total cache size (in pairs): 956, Positive cache size: 906, Positive conditional cache size: 0, Positive unconditional cache size: 906, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 ], Maximal queried relation: 0, Independence queries for same thread: 986 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 183, Number of persistent set computation: 3673, Number of trivial persistent sets: 3161, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9047, positive: 7487, positive conditional: 5635, positive unconditional: 1852, negative: 1560, negative conditional: 1462, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 8061, positive: 7487, positive conditional: 5635, positive unconditional: 1852, negative: 574, negative conditional: 476, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 8061, positive: 7487, positive conditional: 0, positive unconditional: 7487, negative: 574, negative conditional: 0, negative unconditional: 574, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 956, positive: 906, positive conditional: 0, positive unconditional: 906, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 956, positive: 875, positive conditional: 0, positive unconditional: 875, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 81, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 85, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8061, positive: 6581, positive conditional: 0, positive unconditional: 6581, negative: 524, negative conditional: 0, negative unconditional: 524, unknown: 956, unknown conditional: 0, unknown unconditional: 956] , Statistics on independence cache: Total cache size (in pairs): 956, Positive cache size: 906, Positive conditional cache size: 0, Positive unconditional cache size: 906, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 ], Maximal queried relation: 0, Independence queries for same thread: 986 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9047, positive: 7487, positive conditional: 5635, positive unconditional: 1852, negative: 1560, negative conditional: 1462, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 8061, positive: 7487, positive conditional: 5635, positive unconditional: 1852, negative: 574, negative conditional: 476, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 8061, positive: 7487, positive conditional: 0, positive unconditional: 7487, negative: 574, negative conditional: 0, negative unconditional: 574, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 956, positive: 906, positive conditional: 0, positive unconditional: 906, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 956, positive: 875, positive conditional: 0, positive unconditional: 875, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 81, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8061, positive: 6581, positive conditional: 0, positive unconditional: 6581, negative: 524, negative conditional: 0, negative unconditional: 524, unknown: 956, unknown conditional: 0, unknown unconditional: 956] , Statistics on independence cache: Total cache size (in pairs): 956, Positive cache size: 906, Positive conditional cache size: 0, Positive unconditional cache size: 906, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 ], Maximal queried relation: 0, Independence queries for same thread: 986 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 156, Number of persistent set computation: 3673, Number of trivial persistent sets: 3161, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9047, positive: 7487, positive conditional: 5635, positive unconditional: 1852, negative: 1560, negative conditional: 1462, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 8061, positive: 7487, positive conditional: 5635, positive unconditional: 1852, negative: 574, negative conditional: 476, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 8061, positive: 7487, positive conditional: 0, positive unconditional: 7487, negative: 574, negative conditional: 0, negative unconditional: 574, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 956, positive: 906, positive conditional: 0, positive unconditional: 906, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 956, positive: 875, positive conditional: 0, positive unconditional: 875, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 81, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8061, positive: 6581, positive conditional: 0, positive unconditional: 6581, negative: 524, negative conditional: 0, negative unconditional: 524, unknown: 956, unknown conditional: 0, unknown unconditional: 956] , Statistics on independence cache: Total cache size (in pairs): 956, Positive cache size: 906, Positive conditional cache size: 0, Positive unconditional cache size: 906, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 ], Maximal queried relation: 0, Independence queries for same thread: 986 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9132, positive: 7558, positive conditional: 5706, positive unconditional: 1852, negative: 1574, negative conditional: 1476, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 8132, positive: 7558, positive conditional: 5706, positive unconditional: 1852, negative: 574, negative conditional: 476, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 8132, positive: 7558, positive conditional: 0, positive unconditional: 7558, negative: 574, negative conditional: 0, negative unconditional: 574, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 956, positive: 906, positive conditional: 0, positive unconditional: 906, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 956, positive: 875, positive conditional: 0, positive unconditional: 875, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 81, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8132, positive: 6652, positive conditional: 0, positive unconditional: 6652, negative: 524, negative conditional: 0, negative unconditional: 524, unknown: 956, unknown conditional: 0, unknown unconditional: 956] , Statistics on independence cache: Total cache size (in pairs): 956, Positive cache size: 906, Positive conditional cache size: 0, Positive unconditional cache size: 906, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 ], Maximal queried relation: 0, Independence queries for same thread: 1000 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 154, Number of persistent set computation: 3685, Number of trivial persistent sets: 3167, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9132, positive: 7558, positive conditional: 5706, positive unconditional: 1852, negative: 1574, negative conditional: 1476, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 8132, positive: 7558, positive conditional: 5706, positive unconditional: 1852, negative: 574, negative conditional: 476, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 8132, positive: 7558, positive conditional: 0, positive unconditional: 7558, negative: 574, negative conditional: 0, negative unconditional: 574, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 956, positive: 906, positive conditional: 0, positive unconditional: 906, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 956, positive: 875, positive conditional: 0, positive unconditional: 875, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 81, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8132, positive: 6652, positive conditional: 0, positive unconditional: 6652, negative: 524, negative conditional: 0, negative unconditional: 524, unknown: 956, unknown conditional: 0, unknown unconditional: 956] , Statistics on independence cache: Total cache size (in pairs): 956, Positive cache size: 906, Positive conditional cache size: 0, Positive unconditional cache size: 906, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 ], Maximal queried relation: 0, Independence queries for same thread: 1000 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1261723, positive: 971783, positive conditional: 969971, positive unconditional: 1812, negative: 289940, negative conditional: 289833, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 1073290, positive: 971783, positive conditional: 969971, positive unconditional: 1812, negative: 101507, negative conditional: 101400, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 1073290, positive: 937932, positive conditional: 0, positive unconditional: 937932, negative: 135358, negative conditional: 0, negative unconditional: 135358, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 927, positive: 880, positive conditional: 0, positive unconditional: 880, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 927, positive: 850, positive conditional: 0, positive unconditional: 850, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1073290, positive: 937052, positive conditional: 0, positive unconditional: 937052, negative: 135311, negative conditional: 0, negative unconditional: 135311, unknown: 927, unknown conditional: 0, unknown unconditional: 927] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538 ], Maximal queried relation: 16, Independence queries for same thread: 188433 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 15821, Number of persistent set computation: 664966, Number of trivial persistent sets: 640205, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1261723, positive: 971783, positive conditional: 969971, positive unconditional: 1812, negative: 289940, negative conditional: 289833, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 1073290, positive: 971783, positive conditional: 969971, positive unconditional: 1812, negative: 101507, negative conditional: 101400, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 1073290, positive: 937932, positive conditional: 0, positive unconditional: 937932, negative: 135358, negative conditional: 0, negative unconditional: 135358, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 927, positive: 880, positive conditional: 0, positive unconditional: 880, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 927, positive: 850, positive conditional: 0, positive unconditional: 850, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1073290, positive: 937052, positive conditional: 0, positive unconditional: 937052, negative: 135311, negative conditional: 0, negative unconditional: 135311, unknown: 927, unknown conditional: 0, unknown unconditional: 927] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538, SemanticConditionEliminator.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1755641, positive: 33851, positive conditional: 33851, positive unconditional: 0, negative: 1721790, negative conditional: 679938, negative unconditional: 1041852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2920, positive: 266, positive conditional: 236, positive unconditional: 30, negative: 2654, negative conditional: 2607, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2466, positive: 170, positive conditional: 158, positive unconditional: 12, negative: 2296, negative conditional: 2241, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1755641, positive: 33615, positive conditional: 33615, positive unconditional: 0, negative: 1719183, negative conditional: 677331, negative unconditional: 1041852, unknown: 2843, unknown conditional: 2843, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 1116, Positive conditional cache size: 236, Positive unconditional cache size: 880, Negative cache size: 2654, Negative conditional cache size: 2607, Negative unconditional cache size: 47, Eliminated conditions: 1041538 ], Maximal queried relation: 16, Independence queries for same thread: 188433 - CounterExampleResult [Line: 87]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=2, critical=1, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=2, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=3, critical=2, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=1, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=3, critical=0, deadline=4, deadline=3, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=3, critical=0, deadline=4, deadline=3, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=3, critical=0, deadline=4, deadline=4, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=4, critical=1, deadline=4, deadline=4, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=4, critical=0, deadline=4, deadline=5, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=4, critical=0, deadline=4, deadline=5, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=4, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=5, critical=2, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=5, deadline=5, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=6, critical=0, deadline=5, deadline=7, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=0, deadline=5, deadline=7, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=7, critical=0, deadline=5, deadline=7, delay=1, lock=1, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=7, critical=0, deadline=8, deadline=7, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=8, critical=1, deadline=8, deadline=7, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=9, critical=0, deadline=8, deadline=7, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=9, critical=0, deadline=10, deadline=7, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=10, critical=0, deadline=10, deadline=7, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=11, critical=2, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=12, critical=0, deadline=10, deadline=11, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=12, critical=0, deadline=10, deadline=13, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=13, critical=0, deadline=10, deadline=13, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=13, critical=0, deadline=10, deadline=13, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=14, critical=0, deadline=10, deadline=13, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=14, critical=0, deadline=10, deadline=13, delay=1, lock=1, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=14, critical=0, deadline=15, deadline=13, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=15, critical=0, deadline=15, deadline=13, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=15, critical=0, deadline=15, deadline=13, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=15, critical=1, deadline=15, deadline=13, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=15, critical=0, deadline=15, deadline=13, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=15, critical=0, deadline=15, deadline=13, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=15, critical=0, deadline=15, deadline=13, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=15, critical=0, deadline=15, deadline=13, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=15, critical=0, deadline=15, deadline=13, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=15, critical=0, deadline=15, deadline=13, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=16, critical=0, deadline=15, deadline=13, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=16, critical=0, deadline=17, deadline=13, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=17, critical=0, deadline=17, deadline=13, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=17, critical=0, deadline=17, deadline=13, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=18, critical=0, deadline=17, deadline=13, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=18, critical=0, deadline=17, deadline=19, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=18, critical=0, deadline=17, deadline=19, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=19, critical=0, deadline=17, deadline=19, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=19, critical=0, deadline=17, deadline=19, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=19, critical=2, deadline=17, deadline=19, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=19, critical=0, deadline=17, deadline=19, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=19, critical=0, deadline=17, deadline=19, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=19, critical=0, deadline=17, deadline=19, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=19, critical=0, deadline=17, deadline=19, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=19, critical=0, deadline=20, deadline=19, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=19, critical=0, deadline=20, deadline=19, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=19, critical=0, deadline=20, deadline=19, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=19, critical=0, deadline=20, deadline=19, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=19, critical=0, deadline=20, deadline=20, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=20, critical=0, deadline=20, deadline=20, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=20, critical=0, deadline=20, deadline=20, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=20, critical=0, deadline=20, deadline=20, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=20, critical=0, deadline=20, deadline=20, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=20, critical=0, deadline=20, deadline=20, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=20, critical=0, deadline=20, deadline=20, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=21, critical=0, deadline=20, deadline=20, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=21, critical=1, deadline=20, deadline=20, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=21, critical=1, deadline=22, deadline=20, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=22, critical=1, deadline=22, deadline=20, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=22, critical=0, deadline=22, deadline=20, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=22, critical=0, deadline=22, deadline=20, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=23, critical=0, deadline=22, deadline=20, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=23, critical=0, deadline=22, deadline=20, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=24, critical=0, deadline=22, deadline=20, delay=1, lock=2, wait=1] [L69] 2 lock := 0; VAL [clk=24, critical=0, deadline=22, deadline=20, delay=1, lock=0, wait=1] [L87] 3 assert critical == 0; VAL [clk=24, critical=0, deadline=22, deadline=20, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=25, critical=0, deadline=22, deadline=20, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=25, critical=0, deadline=22, deadline=20, delay=1, lock=0, wait=1] [L88] 3 critical := 2; VAL [clk=25, critical=2, deadline=22, deadline=20, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=25, critical=2, deadline=22, deadline=26, delay=1, lock=0, wait=1] [L89] 3 critical := 0; VAL [clk=25, critical=0, deadline=22, deadline=26, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=26, critical=0, deadline=22, deadline=26, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=26, critical=0, deadline=22, deadline=26, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=26, critical=0, deadline=22, deadline=26, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=26, critical=0, deadline=22, deadline=26, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=27, critical=0, deadline=22, deadline=26, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=27, critical=0, deadline=22, deadline=28, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=28, critical=0, deadline=22, deadline=28, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=28, critical=0, deadline=22, deadline=28, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=29, critical=0, deadline=22, deadline=28, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=29, critical=0, deadline=22, deadline=28, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=29, critical=0, deadline=22, deadline=28, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=30, critical=0, deadline=22, deadline=28, delay=1, lock=0, wait=1] [L66] 2 assert critical == 0; VAL [clk=30, critical=0, deadline=22, deadline=28, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=30, critical=0, deadline=22, deadline=28, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=31, critical=0, deadline=22, deadline=28, delay=1, lock=0, wait=1] [L67] 2 critical := 1; VAL [clk=31, critical=1, deadline=22, deadline=28, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=31, critical=1, deadline=32, deadline=28, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=32, critical=1, deadline=32, deadline=28, delay=1, lock=0, wait=1] [L68] 2 critical := 0; VAL [clk=32, critical=0, deadline=32, deadline=28, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=32, critical=0, deadline=32, deadline=28, delay=1, lock=0, wait=1] [L69] 2 lock := 0; VAL [clk=32, critical=0, deadline=32, deadline=28, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=32, critical=0, deadline=32, deadline=28, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=32, critical=0, deadline=32, deadline=33, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=32, critical=0, deadline=32, deadline=33, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=32, critical=0, deadline=32, deadline=33, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=32, critical=0, deadline=32, deadline=33, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=32, critical=0, deadline=33, deadline=33, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=33, critical=0, deadline=33, deadline=33, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=33, critical=0, deadline=33, deadline=33, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=33, critical=0, deadline=33, deadline=33, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=33, critical=0, deadline=33, deadline=33, delay=1, lock=1, wait=1] [L87] 3 assert critical == 0; VAL [clk=33, critical=0, deadline=33, deadline=33, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=33, critical=0, deadline=33, deadline=33, delay=1, lock=1, wait=1] [L88] 3 critical := 2; VAL [clk=33, critical=2, deadline=33, deadline=33, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=34, critical=2, deadline=33, deadline=33, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=34, critical=2, deadline=33, deadline=35, delay=1, lock=1, wait=1] [L89] 3 critical := 0; VAL [clk=34, critical=0, deadline=33, deadline=35, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=35, critical=0, deadline=33, deadline=35, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=35, critical=0, deadline=33, deadline=35, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=35, critical=0, deadline=33, deadline=35, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=35, critical=0, deadline=33, deadline=35, delay=1, lock=0, wait=1] [L66] 2 assert critical == 0; VAL [clk=35, critical=0, deadline=33, deadline=35, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=35, critical=0, deadline=33, deadline=35, delay=1, lock=0, wait=1] [L67] 2 critical := 1; VAL [clk=35, critical=1, deadline=33, deadline=35, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=35, critical=1, deadline=36, deadline=35, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=36, critical=1, deadline=36, deadline=35, delay=1, lock=0, wait=1] [L68] 2 critical := 0; VAL [clk=36, critical=0, deadline=36, deadline=35, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=36, critical=0, deadline=36, deadline=35, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=36, critical=0, deadline=36, deadline=35, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=36, critical=0, deadline=36, deadline=35, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=37, critical=0, deadline=36, deadline=35, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=37, critical=0, deadline=38, deadline=35, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=38, critical=0, deadline=38, deadline=35, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=38, critical=0, deadline=38, deadline=35, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=39, critical=0, deadline=38, deadline=35, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=39, critical=0, deadline=38, deadline=35, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=40, critical=0, deadline=38, deadline=35, delay=1, lock=2, wait=1] [L69] 2 lock := 0; VAL [clk=40, critical=0, deadline=38, deadline=35, delay=1, lock=0, wait=1] [L87] 3 assert critical == 0; VAL [clk=40, critical=0, deadline=38, deadline=35, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=41, critical=0, deadline=38, deadline=35, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=41, critical=0, deadline=38, deadline=35, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=42, critical=0, deadline=38, deadline=35, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=42, critical=0, deadline=38, deadline=43, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=43, critical=0, deadline=38, deadline=43, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=43, critical=0, deadline=38, deadline=43, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=43, critical=0, deadline=38, deadline=43, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=43, critical=0, deadline=38, deadline=43, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=44, critical=0, deadline=38, deadline=43, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=44, critical=0, deadline=38, deadline=45, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=45, critical=0, deadline=38, deadline=45, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=45, critical=0, deadline=38, deadline=45, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=46, critical=0, deadline=38, deadline=45, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=46, critical=0, deadline=38, deadline=45, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=47, critical=0, deadline=38, deadline=45, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=47, critical=0, deadline=38, deadline=45, delay=1, lock=1, wait=1] [L88] 3 critical := 2; VAL [clk=47, critical=2, deadline=38, deadline=45, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=48, critical=2, deadline=38, deadline=45, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=48, critical=1, deadline=38, deadline=45, delay=1, lock=1, wait=1] [L89] 3 critical := 0; VAL [clk=48, critical=0, deadline=38, deadline=45, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=48, critical=0, deadline=38, deadline=45, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=48, critical=0, deadline=38, deadline=45, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=48, critical=0, deadline=38, deadline=45, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=48, critical=0, deadline=49, deadline=45, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=49, critical=0, deadline=49, deadline=45, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=49, critical=0, deadline=49, deadline=45, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=49, critical=0, deadline=49, deadline=45, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=49, critical=0, deadline=49, deadline=45, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=50, critical=0, deadline=49, deadline=45, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=50, critical=0, deadline=51, deadline=45, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=51, critical=0, deadline=51, deadline=45, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=51, critical=0, deadline=51, deadline=45, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=52, critical=0, deadline=51, deadline=45, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=52, critical=0, deadline=51, deadline=45, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=53, critical=0, deadline=51, deadline=45, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=53, critical=0, deadline=51, deadline=45, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=54, critical=0, deadline=51, deadline=45, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=54, critical=2, deadline=51, deadline=45, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=54, critical=0, deadline=51, deadline=45, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=54, critical=0, deadline=51, deadline=45, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=54, critical=0, deadline=51, deadline=45, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=54, critical=0, deadline=55, deadline=45, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=55, critical=0, deadline=55, deadline=45, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=55, critical=0, deadline=55, deadline=45, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=55, critical=0, deadline=55, deadline=45, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=55, critical=0, deadline=55, deadline=45, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=56, critical=0, deadline=55, deadline=45, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=56, critical=0, deadline=57, deadline=45, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=57, critical=0, deadline=57, deadline=45, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=57, critical=0, deadline=57, deadline=45, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=57, critical=0, deadline=57, deadline=45, delay=1, lock=2, wait=1] [L69] 2 lock := 0; VAL [clk=57, critical=0, deadline=57, deadline=45, delay=1, lock=0, wait=1] [L87] 3 assert critical == 0; VAL [clk=57, critical=0, deadline=57, deadline=45, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=57, critical=0, deadline=57, deadline=45, delay=1, lock=0, wait=1] [L88] 3 critical := 2; VAL [clk=57, critical=2, deadline=57, deadline=45, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=57, critical=2, deadline=57, deadline=58, delay=1, lock=0, wait=1] [L89] 3 critical := 0; VAL [clk=57, critical=0, deadline=57, deadline=58, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=58, critical=0, deadline=57, deadline=58, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=58, critical=0, deadline=57, deadline=58, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=58, critical=0, deadline=57, deadline=58, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=58, critical=0, deadline=57, deadline=58, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=58, critical=0, deadline=57, deadline=59, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=59, critical=0, deadline=57, deadline=59, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=60, critical=0, deadline=57, deadline=59, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=60, critical=0, deadline=57, deadline=59, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=61, critical=0, deadline=57, deadline=59, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=61, critical=0, deadline=57, deadline=59, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=61, critical=0, deadline=57, deadline=59, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=62, critical=0, deadline=57, deadline=59, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=62, critical=0, deadline=57, deadline=59, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=62, critical=0, deadline=63, deadline=59, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=63, critical=0, deadline=63, deadline=59, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=63, critical=0, deadline=63, deadline=59, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=63, critical=0, deadline=63, deadline=59, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=63, critical=0, deadline=63, deadline=59, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=64, critical=0, deadline=63, deadline=59, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=64, critical=0, deadline=65, deadline=59, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=65, critical=0, deadline=65, deadline=59, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=65, critical=0, deadline=65, deadline=59, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=66, critical=0, deadline=65, deadline=59, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=66, critical=0, deadline=65, deadline=59, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=67, critical=0, deadline=65, deadline=59, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=67, critical=0, deadline=65, deadline=59, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=68, critical=0, deadline=65, deadline=59, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=68, critical=2, deadline=65, deadline=59, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=68, critical=0, deadline=65, deadline=59, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=68, critical=0, deadline=65, deadline=59, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=68, critical=0, deadline=65, deadline=59, delay=1, lock=0, wait=1] [L67] 2 critical := 1; VAL [clk=68, critical=1, deadline=65, deadline=59, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=68, critical=1, deadline=65, deadline=59, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=68, critical=1, deadline=69, deadline=59, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=69, critical=1, deadline=69, deadline=59, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=69, critical=1, deadline=69, deadline=59, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=69, critical=1, deadline=69, deadline=59, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=69, critical=1, deadline=69, deadline=59, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=70, critical=1, deadline=69, deadline=59, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=70, critical=1, deadline=71, deadline=59, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=71, critical=1, deadline=71, deadline=59, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=71, critical=1, deadline=71, deadline=59, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=72, critical=1, deadline=71, deadline=59, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=72, critical=1, deadline=71, deadline=59, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=72, critical=1, deadline=71, deadline=59, delay=1, lock=2, wait=1] - CounterExampleResult [Line: 66]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=2, critical=1, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=2, critical=0, deadline=2, deadline=3, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=2, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=3, critical=2, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=1, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=3, critical=0, deadline=4, deadline=3, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=3, critical=0, deadline=4, deadline=3, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=3, critical=0, deadline=4, deadline=4, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=4, critical=1, deadline=4, deadline=4, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=4, critical=0, deadline=4, deadline=4, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=4, critical=0, deadline=4, deadline=5, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=4, critical=0, deadline=4, deadline=5, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=4, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=5, critical=2, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=5, deadline=5, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=6, critical=0, deadline=5, deadline=7, delay=1, lock=1, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=6, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=7, critical=1, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=8, critical=0, deadline=9, deadline=7, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=9, critical=0, deadline=9, deadline=7, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=9, critical=0, deadline=9, deadline=10, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=9, critical=0, deadline=9, deadline=10, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=10, critical=0, deadline=9, deadline=10, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=10, critical=0, deadline=9, deadline=10, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=10, critical=0, deadline=9, deadline=10, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=10, critical=2, deadline=9, deadline=10, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=10, critical=0, deadline=9, deadline=10, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=10, critical=0, deadline=9, deadline=10, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=10, critical=0, deadline=9, deadline=10, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=10, critical=0, deadline=9, deadline=10, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=10, critical=0, deadline=9, deadline=10, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=10, critical=0, deadline=9, deadline=10, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=11, critical=0, deadline=9, deadline=10, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=11, critical=0, deadline=9, deadline=12, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=12, critical=0, deadline=9, deadline=12, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=12, critical=0, deadline=9, deadline=12, delay=1, lock=1, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=12, critical=0, deadline=13, deadline=12, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=13, critical=0, deadline=13, deadline=12, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=13, critical=0, deadline=13, deadline=12, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=13, critical=0, deadline=13, deadline=12, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=13, critical=1, deadline=13, deadline=12, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=13, critical=0, deadline=13, deadline=12, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=13, critical=0, deadline=13, deadline=12, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=13, critical=0, deadline=13, deadline=12, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=13, critical=0, deadline=13, deadline=12, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=13, critical=0, deadline=13, deadline=12, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=13, critical=0, deadline=13, deadline=12, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=14, critical=0, deadline=13, deadline=12, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=14, critical=0, deadline=15, deadline=12, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=15, critical=0, deadline=15, deadline=12, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=15, critical=0, deadline=15, deadline=12, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=16, critical=0, deadline=15, deadline=12, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=16, critical=0, deadline=15, deadline=17, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=16, critical=0, deadline=15, deadline=17, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=17, critical=0, deadline=15, deadline=17, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=17, critical=0, deadline=15, deadline=17, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=17, critical=2, deadline=15, deadline=17, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=17, critical=0, deadline=15, deadline=17, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=17, critical=0, deadline=15, deadline=17, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=17, critical=0, deadline=15, deadline=17, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=17, critical=0, deadline=15, deadline=17, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=17, critical=0, deadline=15, deadline=17, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=17, critical=0, deadline=15, deadline=17, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=18, critical=0, deadline=15, deadline=17, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=18, critical=0, deadline=15, deadline=19, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=19, critical=0, deadline=15, deadline=19, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=19, critical=0, deadline=15, deadline=19, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=20, critical=0, deadline=15, deadline=19, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=20, critical=0, deadline=15, deadline=19, delay=1, lock=1, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=20, critical=0, deadline=21, deadline=19, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=21, critical=0, deadline=21, deadline=19, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=21, critical=0, deadline=21, deadline=19, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=21, critical=1, deadline=21, deadline=19, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=21, critical=0, deadline=21, deadline=19, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=21, critical=0, deadline=21, deadline=19, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=21, critical=0, deadline=21, deadline=19, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=21, critical=0, deadline=21, deadline=19, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=21, critical=0, deadline=21, deadline=19, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=21, critical=0, deadline=21, deadline=19, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=22, critical=0, deadline=21, deadline=19, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=22, critical=0, deadline=23, deadline=19, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=23, critical=0, deadline=23, deadline=19, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=23, critical=0, deadline=23, deadline=19, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=24, critical=0, deadline=23, deadline=19, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=24, critical=0, deadline=23, deadline=19, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=25, critical=0, deadline=23, deadline=19, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=25, critical=0, deadline=23, deadline=26, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=25, critical=0, deadline=23, deadline=26, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=26, critical=0, deadline=23, deadline=26, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=26, critical=2, deadline=23, deadline=26, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=26, critical=0, deadline=23, deadline=26, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=26, critical=0, deadline=23, deadline=26, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=26, critical=0, deadline=23, deadline=26, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=26, critical=0, deadline=23, deadline=26, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=26, critical=0, deadline=27, deadline=26, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=26, critical=0, deadline=27, deadline=26, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=26, critical=0, deadline=27, deadline=26, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=26, critical=0, deadline=27, deadline=26, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=26, critical=0, deadline=27, deadline=27, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=27, critical=0, deadline=27, deadline=27, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=27, critical=0, deadline=27, deadline=27, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=27, critical=0, deadline=27, deadline=27, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=27, critical=0, deadline=27, deadline=27, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=27, critical=0, deadline=27, deadline=27, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=27, critical=0, deadline=27, deadline=27, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=28, critical=0, deadline=27, deadline=27, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=28, critical=1, deadline=27, deadline=27, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=28, critical=1, deadline=29, deadline=27, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=29, critical=1, deadline=29, deadline=27, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=29, critical=0, deadline=29, deadline=27, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=29, critical=0, deadline=29, deadline=27, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=30, critical=0, deadline=29, deadline=27, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=30, critical=0, deadline=29, deadline=27, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=31, critical=0, deadline=29, deadline=27, delay=1, lock=2, wait=1] [L69] 2 lock := 0; VAL [clk=31, critical=0, deadline=29, deadline=27, delay=1, lock=0, wait=1] [L87] 3 assert critical == 0; VAL [clk=31, critical=0, deadline=29, deadline=27, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=32, critical=0, deadline=29, deadline=27, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=32, critical=0, deadline=29, deadline=27, delay=1, lock=0, wait=1] [L88] 3 critical := 2; VAL [clk=32, critical=2, deadline=29, deadline=27, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=33, critical=2, deadline=29, deadline=27, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=33, critical=2, deadline=29, deadline=34, delay=1, lock=0, wait=1] [L89] 3 critical := 0; VAL [clk=33, critical=0, deadline=29, deadline=34, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=34, critical=0, deadline=29, deadline=34, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=34, critical=0, deadline=29, deadline=34, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=34, critical=0, deadline=29, deadline=34, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=34, critical=0, deadline=29, deadline=34, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=35, critical=0, deadline=29, deadline=34, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=35, critical=0, deadline=29, deadline=36, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=36, critical=0, deadline=29, deadline=36, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=36, critical=0, deadline=29, deadline=36, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=37, critical=0, deadline=29, deadline=36, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=37, critical=0, deadline=29, deadline=36, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=37, critical=0, deadline=29, deadline=36, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=38, critical=0, deadline=29, deadline=36, delay=1, lock=0, wait=1] [L66] 2 assert critical == 0; VAL [clk=38, critical=0, deadline=29, deadline=36, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=38, critical=0, deadline=29, deadline=36, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=39, critical=0, deadline=29, deadline=36, delay=1, lock=0, wait=1] [L67] 2 critical := 1; VAL [clk=39, critical=1, deadline=29, deadline=36, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=39, critical=1, deadline=40, deadline=36, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=40, critical=1, deadline=40, deadline=36, delay=1, lock=0, wait=1] [L68] 2 critical := 0; VAL [clk=40, critical=0, deadline=40, deadline=36, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=40, critical=0, deadline=40, deadline=36, delay=1, lock=0, wait=1] [L69] 2 lock := 0; VAL [clk=40, critical=0, deadline=40, deadline=36, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=40, critical=0, deadline=40, deadline=36, delay=1, lock=2, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=40, critical=0, deadline=40, deadline=36, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=40, critical=0, deadline=40, deadline=36, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=41, critical=0, deadline=40, deadline=36, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=41, critical=0, deadline=42, deadline=36, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=42, critical=0, deadline=42, deadline=36, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=42, critical=0, deadline=42, deadline=36, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=43, critical=0, deadline=42, deadline=36, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=43, critical=0, deadline=42, deadline=36, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=44, critical=0, deadline=42, deadline=36, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=44, critical=0, deadline=42, deadline=36, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=45, critical=0, deadline=42, deadline=36, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=45, critical=0, deadline=42, deadline=46, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=45, critical=2, deadline=42, deadline=46, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=45, critical=0, deadline=42, deadline=46, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=45, critical=0, deadline=42, deadline=46, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=45, critical=0, deadline=42, deadline=46, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=45, critical=0, deadline=42, deadline=46, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=45, critical=0, deadline=46, deadline=46, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=45, critical=0, deadline=46, deadline=46, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=45, critical=0, deadline=46, deadline=46, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=45, critical=0, deadline=46, deadline=46, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=45, critical=0, deadline=46, deadline=46, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=46, critical=0, deadline=46, deadline=46, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=46, critical=0, deadline=46, deadline=46, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=46, critical=0, deadline=46, deadline=46, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=46, critical=0, deadline=46, deadline=46, delay=1, lock=1, wait=1] [L87] 3 assert critical == 0; VAL [clk=46, critical=0, deadline=46, deadline=46, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=46, critical=0, deadline=46, deadline=46, delay=1, lock=1, wait=1] [L88] 3 critical := 2; VAL [clk=46, critical=2, deadline=46, deadline=46, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=47, critical=2, deadline=46, deadline=46, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=47, critical=2, deadline=46, deadline=48, delay=1, lock=1, wait=1] [L89] 3 critical := 0; VAL [clk=47, critical=0, deadline=46, deadline=48, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=48, critical=0, deadline=46, deadline=48, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=48, critical=0, deadline=46, deadline=48, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=49, critical=0, deadline=46, deadline=48, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=49, critical=0, deadline=46, deadline=48, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=49, critical=0, deadline=46, deadline=48, delay=1, lock=0, wait=1] [L66] 2 assert critical == 0; VAL [clk=49, critical=0, deadline=46, deadline=48, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=49, critical=0, deadline=46, deadline=48, delay=1, lock=0, wait=1] [L67] 2 critical := 1; VAL [clk=49, critical=1, deadline=46, deadline=48, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=49, critical=1, deadline=50, deadline=48, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=50, critical=1, deadline=50, deadline=48, delay=1, lock=0, wait=1] [L68] 2 critical := 0; VAL [clk=50, critical=0, deadline=50, deadline=48, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=50, critical=0, deadline=50, deadline=48, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=50, critical=0, deadline=50, deadline=48, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=50, critical=0, deadline=50, deadline=48, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=51, critical=0, deadline=50, deadline=48, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=51, critical=0, deadline=52, deadline=48, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=52, critical=0, deadline=52, deadline=48, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=52, critical=0, deadline=52, deadline=48, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=53, critical=0, deadline=52, deadline=48, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=53, critical=0, deadline=52, deadline=48, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=54, critical=0, deadline=52, deadline=48, delay=1, lock=2, wait=1] [L69] 2 lock := 0; VAL [clk=54, critical=0, deadline=52, deadline=48, delay=1, lock=0, wait=1] [L87] 3 assert critical == 0; VAL [clk=54, critical=0, deadline=52, deadline=48, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=55, critical=0, deadline=52, deadline=48, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=55, critical=0, deadline=52, deadline=48, delay=1, lock=0, wait=1] [L88] 3 critical := 2; VAL [clk=55, critical=2, deadline=52, deadline=48, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=56, critical=2, deadline=52, deadline=48, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=57, critical=2, deadline=52, deadline=48, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=57, critical=2, deadline=52, deadline=58, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=58, critical=2, deadline=52, deadline=58, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=58, critical=2, deadline=52, deadline=58, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=58, critical=2, deadline=52, deadline=58, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=58, critical=2, deadline=52, deadline=58, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=59, critical=2, deadline=52, deadline=58, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=59, critical=2, deadline=52, deadline=60, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=60, critical=2, deadline=52, deadline=60, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=60, critical=2, deadline=52, deadline=60, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=61, critical=2, deadline=52, deadline=60, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=61, critical=2, deadline=52, deadline=60, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=61, critical=2, deadline=52, deadline=60, delay=1, lock=1, wait=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process2Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 30039.0ms, OverallIterations: 16, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.3ms, PartialOrderReductionTime: 25205.4ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 475, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 103.9ms SsaConstructionTime, 512.6ms SatisfiabilityAnalysisTime, 2444.4ms InterpolantComputationTime, 3718 NumberOfCodeBlocks, 3593 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3382 ConstructedInterpolants, 0 QuantifiedInterpolants, 5420 SizeOfPredicates, 23 NumberOfNonLiveVariables, 2044 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 21 InterpolantComputations, 9 PerfectInterpolantSequences, 26740/27752 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process2 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 253.9ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.7ms, PartialOrderReductionTime: 241.8ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process1 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 210.2ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.7ms, PartialOrderReductionTime: 204.4ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 206.7ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.6ms, PartialOrderReductionTime: 201.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process1Thread1of1ForFork1 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 50478.4ms, OverallIterations: 17, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.5ms, PartialOrderReductionTime: 45467.5ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 501, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 93.8ms SsaConstructionTime, 398.4ms SatisfiabilityAnalysisTime, 2616.5ms InterpolantComputationTime, 4018 NumberOfCodeBlocks, 3863 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 3714 ConstructedInterpolants, 0 QuantifiedInterpolants, 8082 SizeOfPredicates, 32 NumberOfNonLiveVariables, 2452 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 24 InterpolantComputations, 8 PerfectInterpolantSequences, 34275/39439 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...