/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-NewStatesSleep-NoLbe-Random42.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-14 03:28:21,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-14 03:28:21,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-14 03:28:21,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-14 03:28:21,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-14 03:28:21,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-14 03:28:21,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-14 03:28:21,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-14 03:28:21,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-14 03:28:21,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-14 03:28:21,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-14 03:28:21,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-14 03:28:21,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-14 03:28:21,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-14 03:28:21,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-14 03:28:21,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-14 03:28:21,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-14 03:28:21,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-14 03:28:21,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-14 03:28:21,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-14 03:28:21,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-14 03:28:21,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-14 03:28:21,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-14 03:28:21,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-14 03:28:21,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-14 03:28:21,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-14 03:28:21,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-14 03:28:21,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-14 03:28:21,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-14 03:28:21,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-14 03:28:21,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-14 03:28:21,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-14 03:28:21,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-14 03:28:21,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-14 03:28:21,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-14 03:28:21,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-14 03:28:21,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-14 03:28:21,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-14 03:28:21,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-14 03:28:21,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-14 03:28:21,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-14 03:28:21,891 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-NewStatesSleep-NoLbe-Random42.epf [2021-06-14 03:28:21,926 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-14 03:28:21,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-14 03:28:21,927 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-14 03:28:21,927 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-14 03:28:21,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-14 03:28:21,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-14 03:28:21,929 INFO L138 SettingsManager]: * Use SBE=true [2021-06-14 03:28:21,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-14 03:28:21,930 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-14 03:28:21,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-14 03:28:21,931 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-14 03:28:21,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-14 03:28:21,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-14 03:28:21,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-14 03:28:21,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-14 03:28:21,931 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-14 03:28:21,932 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-14 03:28:21,932 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-14 03:28:21,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-14 03:28:21,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-14 03:28:21,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-14 03:28:21,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-14 03:28:21,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-14 03:28:21,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-14 03:28:21,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-14 03:28:21,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-14 03:28:21,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-14 03:28:21,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-14 03:28:21,933 INFO L138 SettingsManager]: * DFS Order used in POR=RANDOM [2021-06-14 03:28:21,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-14 03:28:21,934 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-14 03:28:21,934 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-06-14 03:28:21,934 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-14 03:28:21,934 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2021-06-14 03:28:21,934 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-14 03:28:21,935 INFO L138 SettingsManager]: * Random seed used by POR DFS order=42 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-14 03:28:22,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-14 03:28:22,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-14 03:28:22,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-14 03:28:22,281 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-14 03:28:22,282 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-14 03:28:22,283 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-14 03:28:22,283 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-06-14 03:28:22,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-14 03:28:22,323 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-14 03:28:22,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-14 03:28:22,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-14 03:28:22,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-14 03:28:22,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:28:22" (1/1) ... [2021-06-14 03:28:22,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:28:22" (1/1) ... [2021-06-14 03:28:22,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-14 03:28:22,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-14 03:28:22,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-14 03:28:22,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-14 03:28:22,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:28:22" (1/1) ... [2021-06-14 03:28:22,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:28:22" (1/1) ... [2021-06-14 03:28:22,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:28:22" (1/1) ... [2021-06-14 03:28:22,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:28:22" (1/1) ... [2021-06-14 03:28:22,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:28:22" (1/1) ... [2021-06-14 03:28:22,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:28:22" (1/1) ... [2021-06-14 03:28:22,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:28:22" (1/1) ... [2021-06-14 03:28:22,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-14 03:28:22,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-14 03:28:22,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-14 03:28:22,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-14 03:28:22,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:28:22" (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-14 03:28:22,443 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-06-14 03:28:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-06-14 03:28:22,443 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-06-14 03:28:22,443 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-06-14 03:28:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-06-14 03:28:22,443 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-06-14 03:28:22,443 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-14 03:28:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-14 03:28:22,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-14 03:28:22,444 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-06-14 03:28:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-06-14 03:28:22,444 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-06-14 03:28:22,445 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-14 03:28:22,662 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-14 03:28:22,662 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-14 03:28:22,664 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:28:22 BoogieIcfgContainer [2021-06-14 03:28:22,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-14 03:28:22,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-14 03:28:22,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-14 03:28:22,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-14 03:28:22,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.06 03:28:22" (1/2) ... [2021-06-14 03:28:22,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a75f25a and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:28:22, skipping insertion in model container [2021-06-14 03:28:22,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:28:22" (2/2) ... [2021-06-14 03:28:22,687 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-06-14 03:28:22,705 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-14 03:28:22,705 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-14 03:28:22,705 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-14 03:28:22,706 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-14 03:28:22,737 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,737 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,738 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,738 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,739 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,739 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,739 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,739 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,740 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,741 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,741 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,742 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,742 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,742 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,742 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,742 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,750 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,763 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:28:22,765 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-14 03:28:22,782 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-14 03:28:22,834 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-14 03:28:22,834 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-14 03:28:22,834 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-14 03:28:22,834 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-14 03:28:22,834 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-14 03:28:22,835 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-14 03:28:22,835 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-14 03:28:22,835 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2Thread1of1ForFork2======== [2021-06-14 03:28:22,974 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:22,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:22,979 INFO L82 PathProgramCache]: Analyzing trace with hash 294530881, now seen corresponding path program 1 times [2021-06-14 03:28:22,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:22,986 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805247348] [2021-06-14 03:28:22,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:23,080 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-14 03:28:23,080 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:23,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805247348] [2021-06-14 03:28:23,082 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805247348] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 03:28:23,082 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 03:28:23,082 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-14 03:28:23,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532403701] [2021-06-14 03:28:23,087 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-14 03:28:23,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:23,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-14 03:28:23,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-14 03:28:23,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,105 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:23,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-14 03:28:23,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,182 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-14 03:28:23,182 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:23,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:23,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1504277270, now seen corresponding path program 1 times [2021-06-14 03:28:23,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:23,183 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139677846] [2021-06-14 03:28:23,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-14 03:28:23,263 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:23,263 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139677846] [2021-06-14 03:28:23,263 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139677846] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 03:28:23,263 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 03:28:23,263 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 03:28:23,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847767907] [2021-06-14 03:28:23,265 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 03:28:23,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:23,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 03:28:23,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 03:28:23,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,267 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:23,267 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-14 03:28:23,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,348 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-14 03:28:23,348 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:23,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:23,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1570598031, now seen corresponding path program 1 times [2021-06-14 03:28:23,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:23,351 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770626846] [2021-06-14 03:28:23,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-14 03:28:23,403 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:23,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770626846] [2021-06-14 03:28:23,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770626846] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 03:28:23,403 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 03:28:23,404 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-14 03:28:23,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091940976] [2021-06-14 03:28:23,404 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 03:28:23,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:23,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 03:28:23,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 03:28:23,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,405 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:23,405 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 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-14 03:28:23,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,635 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-14 03:28:23,635 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:23,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:23,636 INFO L82 PathProgramCache]: Analyzing trace with hash -530068861, now seen corresponding path program 1 times [2021-06-14 03:28:23,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:23,636 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802834615] [2021-06-14 03:28:23,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:23,706 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2021-06-14 03:28:23,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:23,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802834615] [2021-06-14 03:28:23,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802834615] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 03:28:23,707 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 03:28:23,707 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 03:28:23,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717869202] [2021-06-14 03:28:23,708 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 03:28:23,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:23,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 03:28:23,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 03:28:23,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,709 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:23,709 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-14 03:28:23,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,801 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-14 03:28:23,801 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:23,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:23,802 INFO L82 PathProgramCache]: Analyzing trace with hash 265797205, now seen corresponding path program 2 times [2021-06-14 03:28:23,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:23,802 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488353565] [2021-06-14 03:28:23,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-06-14 03:28:23,875 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:23,875 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488353565] [2021-06-14 03:28:23,875 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488353565] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 03:28:23,875 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 03:28:23,875 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 03:28:23,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057969832] [2021-06-14 03:28:23,876 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 03:28:23,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:23,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 03:28:23,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 03:28:23,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,877 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:23,877 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-14 03:28:23,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,957 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-14 03:28:23,957 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:23,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:23,957 INFO L82 PathProgramCache]: Analyzing trace with hash -2022578556, now seen corresponding path program 3 times [2021-06-14 03:28:23,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:23,958 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942912425] [2021-06-14 03:28:23,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-06-14 03:28:23,994 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:23,994 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942912425] [2021-06-14 03:28:23,994 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942912425] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 03:28:23,994 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 03:28:23,995 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 03:28:23,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661123185] [2021-06-14 03:28:23,995 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 03:28:23,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:23,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 03:28:23,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 03:28:23,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,996 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:23,996 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-14 03:28:23,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:23,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:23,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,052 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-14 03:28:24,052 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:24,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:24,053 INFO L82 PathProgramCache]: Analyzing trace with hash 868534738, now seen corresponding path program 4 times [2021-06-14 03:28:24,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:24,053 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626158692] [2021-06-14 03:28:24,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-06-14 03:28:24,094 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:24,094 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626158692] [2021-06-14 03:28:24,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626158692] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 03:28:24,094 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 03:28:24,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-14 03:28:24,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149035085] [2021-06-14 03:28:24,095 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-14 03:28:24,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:24,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-14 03:28:24,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-14 03:28:24,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:24,096 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:24,096 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-14 03:28:24,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:24,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:24,213 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-14 03:28:24,213 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:24,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:24,214 INFO L82 PathProgramCache]: Analyzing trace with hash 51313010, now seen corresponding path program 5 times [2021-06-14 03:28:24,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:24,214 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104174977] [2021-06-14 03:28:24,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-06-14 03:28:24,333 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:24,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104174977] [2021-06-14 03:28:24,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104174977] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:24,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677533731] [2021-06-14 03:28:24,334 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 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-14 03:28:24,415 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-06-14 03:28:24,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:28:24,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-14 03:28:24,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:28:24,898 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 194 proven. 49 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-06-14 03:28:24,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677533731] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:24,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:28:24,898 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 15 [2021-06-14 03:28:24,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019272348] [2021-06-14 03:28:24,899 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-14 03:28:24,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:24,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-14 03:28:24,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-06-14 03:28:24,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:24,901 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:24,901 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 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-14 03:28:24,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:24,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:24,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:24,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:28,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:28,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:28,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:28,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:28,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:28,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:28,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:28,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:28,420 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:28:28,421 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:28,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:28,422 INFO L82 PathProgramCache]: Analyzing trace with hash -308927488, now seen corresponding path program 6 times [2021-06-14 03:28:28,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:28,422 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665368480] [2021-06-14 03:28:28,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6380 backedges. 3044 proven. 5 refuted. 0 times theorem prover too weak. 3331 trivial. 0 not checked. [2021-06-14 03:28:28,603 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:28,603 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665368480] [2021-06-14 03:28:28,603 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665368480] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:28,603 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612843926] [2021-06-14 03:28:28,603 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 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-14 03:28:28,695 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-06-14 03:28:28,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:28:28,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-14 03:28:28,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:28:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6380 backedges. 993 proven. 12 refuted. 0 times theorem prover too weak. 5375 trivial. 0 not checked. [2021-06-14 03:28:29,367 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612843926] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:29,367 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:28:29,367 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-06-14 03:28:29,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454543098] [2021-06-14 03:28:29,368 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-14 03:28:29,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:29,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-14 03:28:29,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-14 03:28:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:29,370 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:29,370 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-14 03:28:29,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:29,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:29,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:29,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:29,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:29,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:29,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:29,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:29,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:29,905 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:28:29,906 INFO L430 AbstractCegarLoop]: === Iteration 10 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:29,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:29,906 INFO L82 PathProgramCache]: Analyzing trace with hash 899841935, now seen corresponding path program 7 times [2021-06-14 03:28:29,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:29,906 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111753259] [2021-06-14 03:28:29,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5156 backedges. 2422 proven. 152 refuted. 0 times theorem prover too weak. 2582 trivial. 0 not checked. [2021-06-14 03:28:30,074 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:30,074 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111753259] [2021-06-14 03:28:30,075 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111753259] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:30,075 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574487789] [2021-06-14 03:28:30,075 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 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-14 03:28:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:30,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-14 03:28:30,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:28:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5156 backedges. 406 proven. 2 refuted. 0 times theorem prover too weak. 4748 trivial. 0 not checked. [2021-06-14 03:28:30,693 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574487789] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:30,693 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:28:30,693 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-06-14 03:28:30,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088420881] [2021-06-14 03:28:30,694 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-14 03:28:30,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:30,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-14 03:28:30,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-14 03:28:30,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:30,695 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:30,695 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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-14 03:28:30,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:30,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:30,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:30,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:30,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:30,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:30,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:30,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:30,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:30,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:31,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:31,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:28:31,364 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:28:31,365 INFO L430 AbstractCegarLoop]: === Iteration 11 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:31,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:31,365 INFO L82 PathProgramCache]: Analyzing trace with hash 856140650, now seen corresponding path program 8 times [2021-06-14 03:28:31,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:31,365 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051924210] [2021-06-14 03:28:31,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 746 proven. 52 refuted. 0 times theorem prover too weak. 1529 trivial. 0 not checked. [2021-06-14 03:28:31,486 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:31,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051924210] [2021-06-14 03:28:31,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051924210] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:31,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163294072] [2021-06-14 03:28:31,486 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 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-14 03:28:31,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-14 03:28:31,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:28:31,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-14 03:28:31,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:28:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 292 proven. 3 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2021-06-14 03:28:31,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163294072] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:31,955 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:28:31,955 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2021-06-14 03:28:31,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375863222] [2021-06-14 03:28:31,956 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-14 03:28:31,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:31,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-14 03:28:31,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-14 03:28:31,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:31,957 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:31,958 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 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-14 03:28:31,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:31,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:31,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:31,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:31,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:31,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:31,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:31,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:31,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:31,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:28:31,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:33,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:28:33,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-14 03:28:33,652 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-06-14 03:28:33,653 INFO L430 AbstractCegarLoop]: === Iteration 12 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:33,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:33,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1455975504, now seen corresponding path program 9 times [2021-06-14 03:28:33,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:33,654 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332454909] [2021-06-14 03:28:33,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5897 backedges. 2065 proven. 1574 refuted. 0 times theorem prover too weak. 2258 trivial. 0 not checked. [2021-06-14 03:28:33,827 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:33,827 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332454909] [2021-06-14 03:28:33,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332454909] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:33,827 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257294870] [2021-06-14 03:28:33,827 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 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-14 03:28:33,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-06-14 03:28:33,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:28:33,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-14 03:28:33,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:28:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5897 backedges. 1997 proven. 318 refuted. 0 times theorem prover too weak. 3582 trivial. 0 not checked. [2021-06-14 03:28:34,373 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257294870] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:34,373 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:28:34,373 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-14 03:28:34,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067879715] [2021-06-14 03:28:34,375 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-14 03:28:34,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:34,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-14 03:28:34,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-14 03:28:34,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:34,375 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:34,375 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.866666666666666) internal successors, (118), 15 states have internal predecessors, (118), 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-14 03:28:34,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:34,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:34,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:34,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:34,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:34,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:34,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:34,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:34,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:34,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:28:34,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2021-06-14 03:28:34,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:28:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-14 03:28:35,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-14 03:28:35,636 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:28:35,637 INFO L430 AbstractCegarLoop]: === Iteration 13 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:35,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:35,637 INFO L82 PathProgramCache]: Analyzing trace with hash 84701606, now seen corresponding path program 10 times [2021-06-14 03:28:35,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:35,637 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245931333] [2021-06-14 03:28:35,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1563 proven. 142 refuted. 0 times theorem prover too weak. 1544 trivial. 0 not checked. [2021-06-14 03:28:35,730 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:35,731 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245931333] [2021-06-14 03:28:35,731 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245931333] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:35,731 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150327219] [2021-06-14 03:28:35,731 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-14 03:28:35,817 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-14 03:28:35,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:28:35,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-14 03:28:35,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:28:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 682 proven. 29 refuted. 0 times theorem prover too weak. 2538 trivial. 0 not checked. [2021-06-14 03:28:36,172 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150327219] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:36,172 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:28:36,172 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2021-06-14 03:28:36,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842133438] [2021-06-14 03:28:36,173 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-14 03:28:36,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:36,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-14 03:28:36,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-14 03:28:36,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:36,174 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:36,174 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-14 03:28:36,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:36,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:36,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:36,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:36,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:36,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:36,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:36,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:36,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:36,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:28:36,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2021-06-14 03:28:36,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2021-06-14 03:28:36,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:39,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:28:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-14 03:28:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-14 03:28:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-14 03:28:39,379 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:28:39,379 INFO L430 AbstractCegarLoop]: === Iteration 14 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:39,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:39,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2133381012, now seen corresponding path program 11 times [2021-06-14 03:28:39,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:39,380 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982827327] [2021-06-14 03:28:39,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:39,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2385 backedges. 945 proven. 82 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2021-06-14 03:28:39,563 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:39,563 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982827327] [2021-06-14 03:28:39,563 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982827327] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:39,563 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437061458] [2021-06-14 03:28:39,563 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:28:39,663 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2021-06-14 03:28:39,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:28:39,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-14 03:28:39,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:28:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2385 backedges. 422 proven. 12 refuted. 0 times theorem prover too weak. 1951 trivial. 0 not checked. [2021-06-14 03:28:39,949 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437061458] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:39,949 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:28:39,949 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2021-06-14 03:28:39,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757372869] [2021-06-14 03:28:39,950 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-14 03:28:39,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:39,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-14 03:28:39,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-06-14 03:28:39,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:39,950 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:39,950 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 states have internal predecessors, (97), 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-14 03:28:39,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:39,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:39,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:39,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:39,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:39,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:39,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:39,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:39,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:39,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:28:39,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2021-06-14 03:28:39,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2021-06-14 03:28:39,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2021-06-14 03:28:39,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:44,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:28:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-14 03:28:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-14 03:28:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-14 03:28:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:44,226 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-06-14 03:28:44,226 INFO L430 AbstractCegarLoop]: === Iteration 15 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:44,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:44,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1896785702, now seen corresponding path program 12 times [2021-06-14 03:28:44,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:44,227 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822680255] [2021-06-14 03:28:44,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 314 proven. 7 refuted. 0 times theorem prover too weak. 1441 trivial. 0 not checked. [2021-06-14 03:28:44,299 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:44,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822680255] [2021-06-14 03:28:44,299 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822680255] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:44,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736648718] [2021-06-14 03:28:44,299 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:28:44,374 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2021-06-14 03:28:44,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:28:44,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-14 03:28:44,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:28:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 16 proven. 417 refuted. 0 times theorem prover too weak. 1329 trivial. 0 not checked. [2021-06-14 03:28:44,737 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736648718] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:44,737 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:28:44,737 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2021-06-14 03:28:44,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490457509] [2021-06-14 03:28:44,738 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-14 03:28:44,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:44,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-14 03:28:44,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-06-14 03:28:44,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:44,739 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:44,739 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 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-14 03:28:44,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:44,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:44,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:44,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:44,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:44,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:44,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:44,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:44,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:44,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:28:44,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2021-06-14 03:28:44,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2021-06-14 03:28:44,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2021-06-14 03:28:44,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:44,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:28:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-14 03:28:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-14 03:28:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-14 03:28:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-06-14 03:28:50,618 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-14 03:28:50,619 INFO L430 AbstractCegarLoop]: === Iteration 16 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:50,619 INFO L82 PathProgramCache]: Analyzing trace with hash -912972094, now seen corresponding path program 13 times [2021-06-14 03:28:50,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:50,619 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079863292] [2021-06-14 03:28:50,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-14 03:28:50,655 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-14 03:28:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-14 03:28:50,704 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-14 03:28:50,735 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-14 03:28:50,735 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-14 03:28:50,736 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-14 03:28:50,754 INFO L301 ceAbstractionStarter]: Result for error location Process2Thread1of1ForFork2 was UNSAFE (1/5) [2021-06-14 03:28:50,757 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-06-14 03:28:50,769 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-14 03:28:50,769 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-14 03:28:50,769 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-14 03:28:50,769 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-14 03:28:50,769 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-14 03:28:50,770 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-14 03:28:50,770 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-14 03:28:50,770 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2======== Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-14 03:28:50,996 INFO L301 ceAbstractionStarter]: Result for error location Process2 was SAFE (2/5) [2021-06-14 03:28:50,997 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) [2021-06-14 03:28:51,006 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-14 03:28:51,006 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-14 03:28:51,006 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-14 03:28:51,006 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-14 03:28:51,006 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-14 03:28:51,006 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-14 03:28:51,006 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-14 03:28:51,006 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1======== Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-14 03:28:51,189 INFO L301 ceAbstractionStarter]: Result for error location Process1 was SAFE (3/5) [2021-06-14 03:28:51,190 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-14 03:28:51,196 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-14 03:28:51,196 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-14 03:28:51,196 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-14 03:28:51,196 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-14 03:28:51,196 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-14 03:28:51,196 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-14 03:28:51,196 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-14 03:28:51,196 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-14 03:28:51,359 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (4/5) [2021-06-14 03:28:51,359 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-14 03:28:51,368 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-14 03:28:51,368 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-14 03:28:51,368 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-14 03:28:51,368 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-14 03:28:51,368 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-14 03:28:51,368 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-14 03:28:51,368 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-14 03:28:51,368 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1Thread1of1ForFork1======== [2021-06-14 03:28:51,395 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:51,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:51,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1140894659, now seen corresponding path program 1 times [2021-06-14 03:28:51,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:51,395 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018768025] [2021-06-14 03:28:51,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:51,399 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-14 03:28:51,399 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:51,399 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018768025] [2021-06-14 03:28:51,400 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018768025] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 03:28:51,400 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 03:28:51,400 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-14 03:28:51,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825649651] [2021-06-14 03:28:51,400 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-14 03:28:51,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:51,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-14 03:28:51,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-14 03:28:51,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,401 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:51,401 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-14 03:28:51,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,421 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-14 03:28:51,422 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:51,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:51,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1663699650, now seen corresponding path program 1 times [2021-06-14 03:28:51,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:51,422 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356723890] [2021-06-14 03:28:51,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-14 03:28:51,430 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:51,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356723890] [2021-06-14 03:28:51,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356723890] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 03:28:51,431 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 03:28:51,431 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-14 03:28:51,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680895235] [2021-06-14 03:28:51,431 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 03:28:51,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:51,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 03:28:51,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 03:28:51,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,432 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:51,432 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-14 03:28:51,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,451 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-14 03:28:51,451 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:51,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:51,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1833572302, now seen corresponding path program 1 times [2021-06-14 03:28:51,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:51,452 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157545804] [2021-06-14 03:28:51,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-14 03:28:51,461 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:51,461 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157545804] [2021-06-14 03:28:51,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157545804] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 03:28:51,461 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 03:28:51,462 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 03:28:51,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103318964] [2021-06-14 03:28:51,462 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 03:28:51,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:51,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 03:28:51,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 03:28:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,462 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:51,463 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-14 03:28:51,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,528 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-14 03:28:51,528 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:51,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:51,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1970304008, now seen corresponding path program 2 times [2021-06-14 03:28:51,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:51,529 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380939515] [2021-06-14 03:28:51,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-06-14 03:28:51,541 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:51,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380939515] [2021-06-14 03:28:51,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380939515] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 03:28:51,541 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 03:28:51,541 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 03:28:51,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193319364] [2021-06-14 03:28:51,542 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 03:28:51,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:51,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 03:28:51,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 03:28:51,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,542 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:51,542 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-14 03:28:51,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,589 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-14 03:28:51,589 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:51,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:51,589 INFO L82 PathProgramCache]: Analyzing trace with hash 872348278, now seen corresponding path program 3 times [2021-06-14 03:28:51,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:51,589 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228222558] [2021-06-14 03:28:51,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2021-06-14 03:28:51,609 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:51,609 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228222558] [2021-06-14 03:28:51,609 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228222558] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 03:28:51,609 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 03:28:51,609 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 03:28:51,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188069770] [2021-06-14 03:28:51,609 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 03:28:51,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:51,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 03:28:51,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 03:28:51,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,610 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:51,610 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-14 03:28:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,649 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-14 03:28:51,649 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash 137745222, now seen corresponding path program 4 times [2021-06-14 03:28:51,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:51,649 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984385781] [2021-06-14 03:28:51,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-06-14 03:28:51,666 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:51,666 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984385781] [2021-06-14 03:28:51,666 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984385781] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 03:28:51,666 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 03:28:51,666 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-14 03:28:51,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105082280] [2021-06-14 03:28:51,667 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-14 03:28:51,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:51,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-14 03:28:51,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-14 03:28:51,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,667 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:51,667 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-14 03:28:51,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:51,720 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-14 03:28:51,720 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:51,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:51,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1405860837, now seen corresponding path program 5 times [2021-06-14 03:28:51,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:51,721 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713029] [2021-06-14 03:28:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-06-14 03:28:51,769 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:51,769 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713029] [2021-06-14 03:28:51,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713029] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:51,769 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611697224] [2021-06-14 03:28:51,769 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 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-14 03:28:51,811 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-06-14 03:28:51,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:28:51,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-14 03:28:51,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:28:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 106 proven. 49 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-06-14 03:28:51,974 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611697224] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:51,975 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:28:51,975 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 15 [2021-06-14 03:28:51,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14672326] [2021-06-14 03:28:51,975 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-14 03:28:51,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:51,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-14 03:28:51,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-06-14 03:28:51,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,976 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:51,976 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.6) internal successors, (99), 15 states have internal predecessors, (99), 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-14 03:28:51,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:51,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:51,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:51,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:54,892 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:28:54,893 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:54,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:54,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1780407069, now seen corresponding path program 6 times [2021-06-14 03:28:54,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:54,893 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001489323] [2021-06-14 03:28:54,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4532 backedges. 2303 proven. 5 refuted. 0 times theorem prover too weak. 2224 trivial. 0 not checked. [2021-06-14 03:28:54,962 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:54,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001489323] [2021-06-14 03:28:54,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001489323] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:54,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442334074] [2021-06-14 03:28:54,963 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 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-14 03:28:55,023 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-06-14 03:28:55,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:28:55,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-14 03:28:55,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:28:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4532 backedges. 1220 proven. 19 refuted. 0 times theorem prover too weak. 3293 trivial. 0 not checked. [2021-06-14 03:28:55,448 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442334074] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:55,448 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:28:55,449 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-06-14 03:28:55,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760756023] [2021-06-14 03:28:55,449 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-14 03:28:55,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:55,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-14 03:28:55,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-14 03:28:55,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:55,450 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:55,450 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-14 03:28:55,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:55,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:55,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:55,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:55,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:55,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:55,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:55,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:55,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:55,799 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-06-14 03:28:55,800 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash 745762688, now seen corresponding path program 7 times [2021-06-14 03:28:55,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:55,800 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082314738] [2021-06-14 03:28:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4769 backedges. 2276 proven. 152 refuted. 0 times theorem prover too weak. 2341 trivial. 0 not checked. [2021-06-14 03:28:55,888 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:55,888 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082314738] [2021-06-14 03:28:55,889 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082314738] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:55,889 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836059201] [2021-06-14 03:28:55,889 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 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-14 03:28:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:56,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-14 03:28:56,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:28:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4769 backedges. 388 proven. 2 refuted. 0 times theorem prover too weak. 4379 trivial. 0 not checked. [2021-06-14 03:28:56,327 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836059201] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:56,327 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:28:56,327 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-06-14 03:28:56,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943549951] [2021-06-14 03:28:56,328 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-14 03:28:56,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:56,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-14 03:28:56,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-14 03:28:56,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:56,329 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:56,329 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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-14 03:28:56,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:56,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:56,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:56,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:56,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:56,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:56,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:56,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:56,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:28:56,967 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:28:56,967 INFO L430 AbstractCegarLoop]: === Iteration 10 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:56,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:56,967 INFO L82 PathProgramCache]: Analyzing trace with hash 55583573, now seen corresponding path program 8 times [2021-06-14 03:28:56,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:56,967 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327248138] [2021-06-14 03:28:56,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3461 backedges. 1182 proven. 0 refuted. 0 times theorem prover too weak. 2279 trivial. 0 not checked. [2021-06-14 03:28:57,013 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:57,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327248138] [2021-06-14 03:28:57,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327248138] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 03:28:57,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 03:28:57,013 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 03:28:57,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744080893] [2021-06-14 03:28:57,014 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 03:28:57,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:57,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 03:28:57,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 03:28:57,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:57,014 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:57,014 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-14 03:28:57,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:57,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:57,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:57,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:57,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:57,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:57,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:57,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:57,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:28:57,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:28:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:57,336 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-14 03:28:57,336 INFO L430 AbstractCegarLoop]: === Iteration 11 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:28:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:28:57,337 INFO L82 PathProgramCache]: Analyzing trace with hash 127518351, now seen corresponding path program 9 times [2021-06-14 03:28:57,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:28:57,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772190808] [2021-06-14 03:28:57,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:28:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:28:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4025 backedges. 1946 proven. 434 refuted. 0 times theorem prover too weak. 1645 trivial. 0 not checked. [2021-06-14 03:28:57,474 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:28:57,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772190808] [2021-06-14 03:28:57,474 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772190808] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:57,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636535756] [2021-06-14 03:28:57,474 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-14 03:28:57,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-06-14 03:28:57,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:28:57,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-14 03:28:57,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:28:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4025 backedges. 493 proven. 1521 refuted. 0 times theorem prover too weak. 2011 trivial. 0 not checked. [2021-06-14 03:28:58,084 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636535756] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:28:58,084 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:28:58,084 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-14 03:28:58,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587902602] [2021-06-14 03:28:58,084 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-14 03:28:58,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:28:58,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-14 03:28:58,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-06-14 03:28:58,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:58,085 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:28:58,085 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 8.61111111111111) internal successors, (155), 18 states have internal predecessors, (155), 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-14 03:28:58,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:28:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:28:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:28:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:28:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:28:58,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:01,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:29:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:29:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2021-06-14 03:29:02,123 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-06-14 03:29:02,123 INFO L430 AbstractCegarLoop]: === Iteration 12 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:29:02,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:29:02,123 INFO L82 PathProgramCache]: Analyzing trace with hash -169771813, now seen corresponding path program 10 times [2021-06-14 03:29:02,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:29:02,124 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50436941] [2021-06-14 03:29:02,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:29:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:29:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3287 backedges. 301 proven. 530 refuted. 0 times theorem prover too weak. 2456 trivial. 0 not checked. [2021-06-14 03:29:02,217 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:29:02,217 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50436941] [2021-06-14 03:29:02,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50436941] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:29:02,217 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481619648] [2021-06-14 03:29:02,217 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-14 03:29:02,315 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-14 03:29:02,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:29:02,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-14 03:29:02,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:29:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3287 backedges. 414 proven. 4 refuted. 0 times theorem prover too weak. 2869 trivial. 0 not checked. [2021-06-14 03:29:02,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481619648] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:29:02,644 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:29:02,644 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2021-06-14 03:29:02,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285255295] [2021-06-14 03:29:02,645 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-14 03:29:02,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:29:02,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-14 03:29:02,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-06-14 03:29:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:02,646 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:29:02,646 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 5.352941176470588) internal successors, (91), 17 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-14 03:29:02,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:02,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:02,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:02,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:02,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:02,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:02,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:29:02,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:02,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:29:02,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:02,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2021-06-14 03:29:02,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:03,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:29:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:29:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2021-06-14 03:29:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-14 03:29:04,020 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-06-14 03:29:04,021 INFO L430 AbstractCegarLoop]: === Iteration 13 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:29:04,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:29:04,021 INFO L82 PathProgramCache]: Analyzing trace with hash -174192757, now seen corresponding path program 11 times [2021-06-14 03:29:04,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:29:04,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904045538] [2021-06-14 03:29:04,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:29:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:29:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 208 proven. 494 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2021-06-14 03:29:04,164 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:29:04,164 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904045538] [2021-06-14 03:29:04,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904045538] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:29:04,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267221644] [2021-06-14 03:29:04,165 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-14 03:29:04,216 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-06-14 03:29:04,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:29:04,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-14 03:29:04,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:29:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 374 proven. 36 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2021-06-14 03:29:04,393 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267221644] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:29:04,393 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:29:04,393 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 23 [2021-06-14 03:29:04,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495042989] [2021-06-14 03:29:04,393 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-14 03:29:04,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:29:04,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-14 03:29:04,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2021-06-14 03:29:04,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:04,394 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:29:04,394 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 4.521739130434782) internal successors, (104), 23 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-14 03:29:04,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:04,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:04,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:04,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:04,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:04,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:04,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:29:04,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:04,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:29:04,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:04,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2021-06-14 03:29:04,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2021-06-14 03:29:04,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:13,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:13,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:13,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:29:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:29:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2021-06-14 03:29:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-14 03:29:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2021-06-14 03:29:13,651 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-06-14 03:29:13,652 INFO L430 AbstractCegarLoop]: === Iteration 14 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:29:13,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:29:13,652 INFO L82 PathProgramCache]: Analyzing trace with hash -943162433, now seen corresponding path program 12 times [2021-06-14 03:29:13,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:29:13,652 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686251903] [2021-06-14 03:29:13,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:29:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:29:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2365 backedges. 473 proven. 17 refuted. 0 times theorem prover too weak. 1875 trivial. 0 not checked. [2021-06-14 03:29:13,736 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:29:13,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686251903] [2021-06-14 03:29:13,737 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686251903] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:29:13,737 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093073350] [2021-06-14 03:29:13,737 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:29:13,822 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2021-06-14 03:29:13,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:29:13,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-14 03:29:13,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:29:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2365 backedges. 31 proven. 649 refuted. 0 times theorem prover too weak. 1685 trivial. 0 not checked. [2021-06-14 03:29:14,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093073350] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:29:14,178 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:29:14,178 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 20 [2021-06-14 03:29:14,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191603965] [2021-06-14 03:29:14,179 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-14 03:29:14,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:29:14,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-14 03:29:14,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2021-06-14 03:29:14,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:14,179 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:29:14,180 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 20 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-14 03:29:14,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:14,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:14,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:14,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:14,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:14,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:14,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:29:14,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:14,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:29:14,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:14,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2021-06-14 03:29:14,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2021-06-14 03:29:14,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 224 states. [2021-06-14 03:29:14,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:29:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:29:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2021-06-14 03:29:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-14 03:29:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2021-06-14 03:29:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-06-14 03:29:22,870 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:29:22,871 INFO L430 AbstractCegarLoop]: === Iteration 15 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:29:22,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:29:22,871 INFO L82 PathProgramCache]: Analyzing trace with hash -528329776, now seen corresponding path program 13 times [2021-06-14 03:29:22,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:29:22,871 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258028666] [2021-06-14 03:29:22,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:29:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:29:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3301 backedges. 566 proven. 15 refuted. 0 times theorem prover too weak. 2720 trivial. 0 not checked. [2021-06-14 03:29:23,112 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:29:23,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258028666] [2021-06-14 03:29:23,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258028666] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:29:23,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997011380] [2021-06-14 03:29:23,112 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:29:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:29:23,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-14 03:29:23,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:29:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3301 backedges. 269 proven. 2 refuted. 0 times theorem prover too weak. 3030 trivial. 0 not checked. [2021-06-14 03:29:23,440 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997011380] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:29:23,440 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:29:23,441 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2021-06-14 03:29:23,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705880863] [2021-06-14 03:29:23,441 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-14 03:29:23,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:29:23,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-14 03:29:23,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-06-14 03:29:23,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:23,442 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:29:23,442 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 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-14 03:29:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:29:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:29:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2021-06-14 03:29:23,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2021-06-14 03:29:23,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 224 states. [2021-06-14 03:29:23,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2021-06-14 03:29:23,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:29:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:29:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2021-06-14 03:29:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-14 03:29:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2021-06-14 03:29:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-06-14 03:29:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-06-14 03:29:41,769 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:29:41,770 INFO L430 AbstractCegarLoop]: === Iteration 16 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:29:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:29:41,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1765882299, now seen corresponding path program 14 times [2021-06-14 03:29:41,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:29:41,770 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193133453] [2021-06-14 03:29:41,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:29:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:29:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3541 backedges. 591 proven. 11 refuted. 0 times theorem prover too weak. 2939 trivial. 0 not checked. [2021-06-14 03:29:41,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:29:41,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193133453] [2021-06-14 03:29:41,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193133453] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:29:41,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748740807] [2021-06-14 03:29:41,854 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:29:41,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-14 03:29:41,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:29:41,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-14 03:29:41,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:29:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3541 backedges. 591 proven. 11 refuted. 0 times theorem prover too weak. 2939 trivial. 0 not checked. [2021-06-14 03:29:42,130 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748740807] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:29:42,130 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:29:42,130 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-06-14 03:29:42,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477315402] [2021-06-14 03:29:42,131 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-14 03:29:42,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:29:42,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-14 03:29:42,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-06-14 03:29:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:42,132 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:29:42,132 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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-14 03:29:42,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:29:42,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:42,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:42,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:42,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:42,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:42,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:29:42,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:29:42,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:29:42,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:29:42,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2021-06-14 03:29:42,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2021-06-14 03:29:42,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 224 states. [2021-06-14 03:29:42,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2021-06-14 03:29:42,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2021-06-14 03:29:42,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:30:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:30:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:30:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:30:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:30:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:30:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:30:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-14 03:30:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-14 03:30:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-14 03:30:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:30:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2021-06-14 03:30:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-14 03:30:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2021-06-14 03:30:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-06-14 03:30:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-06-14 03:30:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-14 03:30:11,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:30:11,444 INFO L430 AbstractCegarLoop]: === Iteration 17 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-14 03:30:11,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:30:11,445 INFO L82 PathProgramCache]: Analyzing trace with hash -693927126, now seen corresponding path program 15 times [2021-06-14 03:30:11,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:30:11,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559930299] [2021-06-14 03:30:11,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:30:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-14 03:30:11,484 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-14 03:30:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-14 03:30:11,534 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-14 03:30:11,574 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-14 03:30:11,574 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-14 03:30:11,574 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-14 03:30:11,581 INFO L301 ceAbstractionStarter]: Result for error location Process1Thread1of1ForFork1 was UNSAFE (5/5) [2021-06-14 03:30:11,582 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-14 03:30:11,663 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 03:30:11 BasicIcfg [2021-06-14 03:30:11,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-14 03:30:11,664 INFO L168 Benchmark]: Toolchain (without parser) took 109340.35 ms. Allocated memory was 239.1 MB in the beginning and 6.7 GB in the end (delta: 6.4 GB). Free memory was 217.5 MB in the beginning and 3.5 GB in the end (delta: -3.3 GB). Peak memory consumption was 3.1 GB. Max. memory is 8.0 GB. [2021-06-14 03:30:11,664 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 239.1 MB. Free memory is still 218.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-14 03:30:11,664 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.56 ms. Allocated memory is still 239.1 MB. Free memory was 217.4 MB in the beginning and 216.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-14 03:30:11,664 INFO L168 Benchmark]: Boogie Preprocessor took 20.34 ms. Allocated memory is still 239.1 MB. Free memory was 216.0 MB in the beginning and 215.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-06-14 03:30:11,664 INFO L168 Benchmark]: RCFGBuilder took 291.70 ms. Allocated memory is still 239.1 MB. Free memory was 215.0 MB in the beginning and 202.6 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-06-14 03:30:11,664 INFO L168 Benchmark]: TraceAbstraction took 108997.68 ms. Allocated memory was 239.1 MB in the beginning and 6.7 GB in the end (delta: 6.4 GB). Free memory was 202.1 MB in the beginning and 3.5 GB in the end (delta: -3.3 GB). Peak memory consumption was 3.1 GB. Max. memory is 8.0 GB. [2021-06-14 03:30:11,669 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.14 ms. Allocated memory is still 239.1 MB. Free memory is still 218.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 25.56 ms. Allocated memory is still 239.1 MB. Free memory was 217.4 MB in the beginning and 216.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 20.34 ms. Allocated memory is still 239.1 MB. Free memory was 216.0 MB in the beginning and 215.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 291.70 ms. Allocated memory is still 239.1 MB. Free memory was 215.0 MB in the beginning and 202.6 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 108997.68 ms. Allocated memory was 239.1 MB in the beginning and 6.7 GB in the end (delta: 6.4 GB). Free memory was 202.1 MB in the beginning and 3.5 GB in the end (delta: -3.3 GB). Peak memory consumption was 3.1 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: 725265, positive: 569150, positive conditional: 569150, positive unconditional: 0, negative: 156115, negative conditional: 156115, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 625586, positive: 569150, positive conditional: 569150, positive unconditional: 0, negative: 56436, negative conditional: 56436, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 625586, positive: 550999, positive conditional: 0, positive unconditional: 550999, negative: 74587, negative conditional: 0, negative unconditional: 74587, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 596, positive: 553, positive conditional: 0, positive unconditional: 553, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 596, positive: 525, positive conditional: 0, positive unconditional: 525, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 625586, positive: 550446, positive conditional: 0, positive unconditional: 550446, negative: 74544, negative conditional: 0, negative unconditional: 74544, unknown: 596, unknown conditional: 0, unknown unconditional: 596] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, SemanticConditionEliminator.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 937831, positive: 17922, positive conditional: 17922, positive unconditional: 0, negative: 917952, negative conditional: 387236, negative unconditional: 530716, unknown: 1957, unknown conditional: 1957, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, Eliminated conditions: 530716, SemanticConditionEliminator.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 937831, positive: 17922, positive conditional: 17922, positive unconditional: 0, negative: 917952, negative conditional: 387236, negative unconditional: 530716, unknown: 1957, unknown conditional: 1957, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, Eliminated conditions: 530716, SemanticConditionEliminator.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 937831, positive: 17922, positive conditional: 17922, positive unconditional: 0, negative: 917952, negative conditional: 387236, negative unconditional: 530716, unknown: 1957, unknown conditional: 1957, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, Eliminated conditions: 530716, SemanticConditionEliminator.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 937831, positive: 17922, positive conditional: 17922, positive unconditional: 0, negative: 917952, negative conditional: 387236, negative unconditional: 530716, unknown: 1957, unknown conditional: 1957, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, Eliminated conditions: 530716, SemanticConditionEliminator.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 937831, positive: 17922, positive conditional: 17922, positive unconditional: 0, negative: 917952, negative conditional: 387236, negative unconditional: 530716, unknown: 1957, unknown conditional: 1957, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, Eliminated conditions: 530716, SemanticConditionEliminator.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 937831, positive: 17922, positive conditional: 17922, positive unconditional: 0, negative: 917952, negative conditional: 387236, negative unconditional: 530716, unknown: 1957, unknown conditional: 1957, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, Eliminated conditions: 530716, SemanticConditionEliminator.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 937831, positive: 17922, positive conditional: 17922, positive unconditional: 0, negative: 917952, negative conditional: 387236, negative unconditional: 530716, unknown: 1957, unknown conditional: 1957, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, Eliminated conditions: 530716, SemanticConditionEliminator.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 937831, positive: 17922, positive conditional: 17922, positive unconditional: 0, negative: 917952, negative conditional: 387236, negative unconditional: 530716, unknown: 1957, unknown conditional: 1957, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, Eliminated conditions: 530716, SemanticConditionEliminator.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 937831, positive: 17922, positive conditional: 17922, positive unconditional: 0, negative: 917952, negative conditional: 387236, negative unconditional: 530716, unknown: 1957, unknown conditional: 1957, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, Eliminated conditions: 530716, SemanticConditionEliminator.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 937831, positive: 17922, positive conditional: 17922, positive unconditional: 0, negative: 917952, negative conditional: 387236, negative unconditional: 530716, unknown: 1957, unknown conditional: 1957, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, Eliminated conditions: 530716, SemanticConditionEliminator.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 937831, positive: 17922, positive conditional: 17922, positive unconditional: 0, negative: 917952, negative conditional: 387236, negative unconditional: 530716, unknown: 1957, unknown conditional: 1957, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, Eliminated conditions: 530716, SemanticConditionEliminator.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 937831, positive: 17922, positive conditional: 17922, positive unconditional: 0, negative: 917952, negative conditional: 387236, negative unconditional: 530716, unknown: 1957, unknown conditional: 1957, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, Eliminated conditions: 530716, SemanticConditionEliminator.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 937831, positive: 17922, positive conditional: 17922, positive unconditional: 0, negative: 917952, negative conditional: 387236, negative unconditional: 530716, unknown: 1957, unknown conditional: 1957, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, Eliminated conditions: 530716, SemanticConditionEliminator.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 937831, positive: 17922, positive conditional: 17922, positive unconditional: 0, negative: 917952, negative conditional: 387236, negative unconditional: 530716, unknown: 1957, unknown conditional: 1957, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, Eliminated conditions: 530716, SemanticConditionEliminator.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 937831, positive: 18151, positive conditional: 18151, positive unconditional: 0, negative: 919680, negative conditional: 388964, negative unconditional: 530716, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2028, positive: 257, positive conditional: 229, positive unconditional: 28, negative: 1771, negative conditional: 1728, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2430, positive: 265, positive conditional: 218, positive unconditional: 47, negative: 2165, negative conditional: 2038, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 937831, positive: 17922, positive conditional: 17922, positive unconditional: 0, negative: 917952, negative conditional: 387236, negative unconditional: 530716, unknown: 1957, unknown conditional: 1957, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2553, Positive cache size: 782, Positive conditional cache size: 229, Positive unconditional cache size: 553, Negative cache size: 1771, Negative conditional cache size: 1728, Negative unconditional cache size: 43, Eliminated conditions: 530716 ], Maximal queried relation: 15, Independence queries for same thread: 99679 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 24218, positive: 19741, positive conditional: 19741, positive unconditional: 0, negative: 4477, negative conditional: 4477, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 20805, positive: 19741, positive conditional: 19741, positive unconditional: 0, negative: 1064, negative conditional: 1064, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 20805, positive: 19741, positive conditional: 0, positive unconditional: 19741, negative: 1064, negative conditional: 0, negative unconditional: 1064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 766, positive: 721, positive conditional: 0, positive unconditional: 721, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 766, positive: 692, positive conditional: 0, positive unconditional: 692, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 74, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20805, positive: 19020, positive conditional: 0, positive unconditional: 19020, negative: 1019, negative conditional: 0, negative unconditional: 1019, unknown: 766, unknown conditional: 0, unknown unconditional: 766] , Statistics on independence cache: Total cache size (in pairs): 766, Positive cache size: 721, Positive conditional cache size: 0, Positive unconditional cache size: 721, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45 ], Maximal queried relation: 0, Independence queries for same thread: 3413 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 24218, positive: 19741, positive conditional: 19741, positive unconditional: 0, negative: 4477, negative conditional: 4477, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 20805, positive: 19741, positive conditional: 19741, positive unconditional: 0, negative: 1064, negative conditional: 1064, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 20805, positive: 19741, positive conditional: 0, positive unconditional: 19741, negative: 1064, negative conditional: 0, negative unconditional: 1064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 766, positive: 721, positive conditional: 0, positive unconditional: 721, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 766, positive: 692, positive conditional: 0, positive unconditional: 692, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 74, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 71, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20805, positive: 19020, positive conditional: 0, positive unconditional: 19020, negative: 1019, negative conditional: 0, negative unconditional: 1019, unknown: 766, unknown conditional: 0, unknown unconditional: 766] , Statistics on independence cache: Total cache size (in pairs): 766, Positive cache size: 721, Positive conditional cache size: 0, Positive unconditional cache size: 721, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45 ], Maximal queried relation: 0, Independence queries for same thread: 3413 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 24218, positive: 19741, positive conditional: 19741, positive unconditional: 0, negative: 4477, negative conditional: 4477, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 20805, positive: 19741, positive conditional: 19741, positive unconditional: 0, negative: 1064, negative conditional: 1064, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 20805, positive: 19741, positive conditional: 0, positive unconditional: 19741, negative: 1064, negative conditional: 0, negative unconditional: 1064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 766, positive: 721, positive conditional: 0, positive unconditional: 721, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 766, positive: 692, positive conditional: 0, positive unconditional: 692, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 74, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 62, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20805, positive: 19020, positive conditional: 0, positive unconditional: 19020, negative: 1019, negative conditional: 0, negative unconditional: 1019, unknown: 766, unknown conditional: 0, unknown unconditional: 766] , Statistics on independence cache: Total cache size (in pairs): 766, Positive cache size: 721, Positive conditional cache size: 0, Positive unconditional cache size: 721, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45 ], Maximal queried relation: 0, Independence queries for same thread: 3413 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4404257, positive: 3442039, positive conditional: 3442039, positive unconditional: 0, negative: 962218, negative conditional: 962218, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 3796472, positive: 3442039, positive conditional: 3442039, positive unconditional: 0, negative: 354433, negative conditional: 354433, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 3796472, positive: 3324518, positive conditional: 0, positive unconditional: 3324518, negative: 471954, negative conditional: 0, negative unconditional: 471954, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 550, positive: 508, positive conditional: 0, positive unconditional: 508, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 550, positive: 481, positive conditional: 0, positive unconditional: 481, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3796472, positive: 3324010, positive conditional: 0, positive unconditional: 3324010, negative: 471912, negative conditional: 0, negative unconditional: 471912, unknown: 550, unknown conditional: 0, unknown unconditional: 550] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992, SemanticConditionEliminator.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6682692, positive: 117521, positive conditional: 117521, positive unconditional: 0, negative: 6565171, negative conditional: 3207179, negative unconditional: 3357992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3614, positive: 395, positive conditional: 368, positive unconditional: 27, negative: 3219, negative conditional: 3177, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3011, positive: 298, positive conditional: 284, positive unconditional: 14, negative: 2713, negative conditional: 2652, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6682692, positive: 117153, positive conditional: 117153, positive unconditional: 0, negative: 6561994, negative conditional: 3204002, negative unconditional: 3357992, unknown: 3545, unknown conditional: 3545, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4095, Positive cache size: 876, Positive conditional cache size: 368, Positive unconditional cache size: 508, Negative cache size: 3219, Negative conditional cache size: 3177, Negative unconditional cache size: 42, Eliminated conditions: 3357992 ], Maximal queried relation: 16, Independence queries for same thread: 607785 - 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] [L78] COND TRUE 3 lock != 2 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] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=1, critical=0, deadline=1, deadline=2, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=1, critical=0, deadline=1, deadline=2, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=1, critical=0, deadline=1, deadline=2, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=1, deadline=2, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=0, deadline=1, deadline=2, 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] [L81] 3 lock := 2; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=2, critical=1, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=1, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=1, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=1, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=5, critical=1, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=1, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=1, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=1, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=9, critical=1, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=9, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=9, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=9, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L69] 2 lock := 0; VAL [clk=9, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=9, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L87] 3 assert critical == 0; VAL [clk=9, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L88] 3 critical := 2; VAL [clk=9, critical=2, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=9, critical=2, deadline=10, deadline=6, delay=1, lock=0, wait=1] [L89] 3 critical := 0; VAL [clk=9, critical=0, deadline=10, deadline=6, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=10, critical=0, deadline=10, deadline=6, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=10, critical=0, deadline=10, deadline=6, delay=1, lock=0, wait=1] [L90] 3 lock := 0; VAL [clk=10, critical=0, deadline=10, deadline=6, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=10, critical=0, deadline=10, deadline=6, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=10, critical=0, deadline=10, deadline=6, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=10, critical=0, deadline=11, deadline=6, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=11, critical=0, deadline=11, deadline=6, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=11, critical=0, deadline=11, deadline=6, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=12, critical=0, deadline=11, deadline=6, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=13, critical=0, deadline=11, deadline=6, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=14, critical=0, deadline=11, deadline=6, delay=1, lock=1, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=14, critical=0, deadline=11, deadline=6, delay=1, lock=1, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=14, critical=0, deadline=11, deadline=15, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=15, critical=0, deadline=11, deadline=15, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=15, critical=0, deadline=11, deadline=15, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=15, critical=0, deadline=11, deadline=15, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=15, critical=1, deadline=11, deadline=15, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=15, critical=0, deadline=11, deadline=15, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=15, critical=0, deadline=11, deadline=15, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=15, critical=0, deadline=11, deadline=15, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=15, critical=0, deadline=11, deadline=15, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=15, critical=0, deadline=16, deadline=15, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=15, critical=0, deadline=16, deadline=15, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=15, critical=0, deadline=16, deadline=15, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=15, critical=0, deadline=16, deadline=16, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=16, critical=0, deadline=16, deadline=16, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=16, critical=0, deadline=16, deadline=16, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=16, critical=0, deadline=16, deadline=16, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=16, critical=0, deadline=16, deadline=16, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=16, critical=2, deadline=16, deadline=16, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=16, critical=0, deadline=16, deadline=16, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=16, critical=0, deadline=16, deadline=16, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=16, critical=0, deadline=16, deadline=16, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=16, critical=0, deadline=16, deadline=17, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=16, critical=0, deadline=16, deadline=17, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=16, critical=0, deadline=16, deadline=17, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=16, critical=0, deadline=16, deadline=17, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=16, critical=0, deadline=16, deadline=17, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=16, critical=0, deadline=17, deadline=17, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=17, critical=0, deadline=17, deadline=17, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=17, critical=0, deadline=17, deadline=17, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=17, critical=0, deadline=17, deadline=17, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=17, critical=0, deadline=17, deadline=17, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=17, critical=0, deadline=17, deadline=17, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=17, critical=0, deadline=17, deadline=17, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=17, critical=1, deadline=17, deadline=17, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=18, critical=1, deadline=17, deadline=17, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=19, critical=1, deadline=17, deadline=17, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=20, critical=1, deadline=17, deadline=17, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=21, critical=1, deadline=17, deadline=17, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=21, critical=1, deadline=17, deadline=22, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=22, critical=1, deadline=17, deadline=22, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=23, critical=1, deadline=17, deadline=22, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=24, critical=1, deadline=17, deadline=22, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=25, critical=1, deadline=17, deadline=22, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=25, critical=0, deadline=17, deadline=22, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=25, critical=0, deadline=17, deadline=22, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=25, critical=0, deadline=17, deadline=22, delay=1, lock=2, wait=1] [L69] 2 lock := 0; VAL [clk=25, critical=0, deadline=17, deadline=22, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=25, critical=0, deadline=17, deadline=22, delay=1, lock=0, wait=1] [L87] 3 assert critical == 0; VAL [clk=25, critical=0, deadline=17, deadline=22, delay=1, lock=0, wait=1] [L88] 3 critical := 2; VAL [clk=25, critical=2, deadline=17, deadline=22, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=25, critical=2, deadline=26, deadline=22, delay=1, lock=0, wait=1] [L89] 3 critical := 0; VAL [clk=25, critical=0, deadline=26, deadline=22, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=26, critical=0, deadline=26, deadline=22, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=26, critical=0, deadline=26, deadline=22, delay=1, lock=0, wait=1] [L90] 3 lock := 0; VAL [clk=26, critical=0, deadline=26, deadline=22, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=26, critical=0, deadline=26, deadline=22, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=26, critical=0, deadline=26, deadline=22, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=26, critical=0, deadline=27, deadline=22, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=27, critical=0, deadline=27, deadline=22, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=27, critical=0, deadline=27, deadline=22, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=28, critical=0, deadline=27, deadline=22, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=29, critical=0, deadline=27, deadline=22, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=30, critical=0, deadline=27, deadline=22, delay=1, lock=1, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=30, critical=0, deadline=27, deadline=22, delay=1, lock=1, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=30, critical=0, deadline=27, deadline=31, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=31, critical=0, deadline=27, deadline=31, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=31, critical=0, deadline=27, deadline=31, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=31, critical=0, deadline=27, deadline=31, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=31, critical=1, deadline=27, deadline=31, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=31, critical=0, deadline=27, deadline=31, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=31, critical=0, deadline=27, deadline=31, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=31, critical=0, deadline=27, deadline=31, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=31, critical=0, deadline=27, deadline=31, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=31, critical=0, deadline=32, deadline=31, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=31, critical=0, deadline=32, deadline=31, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=31, critical=0, deadline=32, deadline=31, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=31, critical=0, deadline=32, deadline=32, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=32, critical=0, deadline=32, deadline=32, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=32, critical=0, deadline=32, deadline=32, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=32, critical=0, deadline=32, deadline=32, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=32, critical=0, deadline=32, deadline=32, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=32, critical=2, deadline=32, deadline=32, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=32, critical=0, deadline=32, deadline=32, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=32, critical=0, deadline=32, deadline=32, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=32, critical=0, deadline=32, deadline=32, delay=1, lock=0, wait=1] [L79] 3 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] [L60] 2 lock := 1; VAL [clk=32, critical=0, deadline=32, deadline=33, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=32, critical=0, deadline=32, deadline=33, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=32, critical=0, deadline=33, deadline=33, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=33, critical=0, deadline=33, deadline=33, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=33, critical=0, deadline=33, deadline=33, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=33, critical=0, deadline=33, deadline=33, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=33, critical=0, deadline=33, deadline=33, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=33, critical=1, deadline=33, deadline=33, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=33, critical=0, deadline=33, deadline=33, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=33, critical=0, deadline=33, deadline=33, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=33, critical=0, deadline=33, deadline=33, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=33, critical=0, deadline=33, deadline=33, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=33, critical=0, deadline=34, deadline=33, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=33, critical=0, deadline=34, deadline=33, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=33, critical=0, deadline=34, deadline=33, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=33, critical=0, deadline=34, deadline=33, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=33, critical=0, deadline=34, deadline=34, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=34, critical=0, deadline=34, deadline=34, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=34, critical=0, deadline=34, deadline=34, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=34, critical=0, deadline=34, deadline=34, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=34, critical=0, deadline=34, deadline=34, delay=1, lock=1, wait=1] [L87] 3 assert critical == 0; VAL [clk=34, critical=0, deadline=34, deadline=34, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=34, critical=0, deadline=34, deadline=34, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=34, critical=0, deadline=35, deadline=34, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=35, critical=0, deadline=35, deadline=34, delay=1, lock=1, wait=1] [L88] 3 critical := 2; VAL [clk=35, critical=2, deadline=35, deadline=34, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=35, critical=2, deadline=35, deadline=34, delay=1, lock=1, wait=1] [L89] 3 critical := 0; VAL [clk=35, critical=0, deadline=35, deadline=34, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=36, critical=0, deadline=35, deadline=34, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=37, critical=0, deadline=35, deadline=34, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=38, critical=0, deadline=35, deadline=34, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=38, critical=0, deadline=35, deadline=34, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=38, critical=0, deadline=35, deadline=34, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=38, critical=1, deadline=35, deadline=34, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=38, critical=1, deadline=35, deadline=34, delay=1, lock=0, wait=1] [L68] 2 critical := 0; VAL [clk=38, critical=0, deadline=35, deadline=34, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=38, critical=0, deadline=35, deadline=34, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=38, critical=0, deadline=35, deadline=39, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=38, critical=0, deadline=35, deadline=39, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=38, critical=0, deadline=35, deadline=39, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=38, critical=0, deadline=35, deadline=39, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=39, critical=0, deadline=35, deadline=39, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=40, critical=0, deadline=35, deadline=39, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=41, critical=0, deadline=35, deadline=39, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=42, critical=0, deadline=35, deadline=39, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=43, critical=0, deadline=35, deadline=39, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=43, critical=0, deadline=35, deadline=44, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=44, critical=0, deadline=35, deadline=44, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=45, critical=0, deadline=35, deadline=44, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=46, critical=0, deadline=35, deadline=44, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=47, critical=0, deadline=35, deadline=44, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=47, critical=0, deadline=35, deadline=44, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=47, critical=0, deadline=35, deadline=44, delay=1, lock=2, wait=1] [L69] 2 lock := 0; VAL [clk=47, critical=0, deadline=35, deadline=44, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=47, critical=0, deadline=35, deadline=44, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=47, critical=0, deadline=48, deadline=44, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=48, critical=0, deadline=48, deadline=44, delay=1, lock=0, wait=1] [L87] 3 assert critical == 0; VAL [clk=48, critical=0, deadline=48, deadline=44, delay=1, lock=0, wait=1] [L88] 3 critical := 2; VAL [clk=48, critical=2, deadline=48, deadline=44, delay=1, lock=0, wait=1] [L89] 3 critical := 0; VAL [clk=48, critical=0, deadline=48, deadline=44, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=48, critical=0, deadline=48, deadline=44, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=48, critical=0, deadline=48, deadline=44, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=48, critical=0, deadline=48, deadline=44, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=48, critical=0, deadline=49, deadline=44, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=49, critical=0, deadline=49, deadline=44, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=49, critical=0, deadline=49, deadline=44, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=50, critical=0, deadline=49, deadline=44, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=51, critical=0, deadline=49, deadline=44, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=52, critical=0, deadline=49, deadline=44, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=52, critical=0, deadline=49, deadline=44, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=52, critical=0, deadline=49, deadline=44, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=52, critical=1, deadline=49, deadline=44, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=52, critical=1, deadline=49, deadline=44, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=52, critical=1, deadline=49, deadline=44, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=52, critical=1, deadline=49, deadline=53, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=52, critical=1, deadline=49, deadline=53, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=52, critical=1, deadline=49, deadline=53, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=53, critical=1, deadline=49, deadline=53, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=53, critical=1, deadline=49, deadline=53, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=54, critical=1, deadline=49, deadline=53, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=55, critical=1, deadline=49, deadline=53, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=56, critical=1, deadline=49, deadline=53, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=57, critical=1, deadline=49, deadline=53, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=57, critical=1, deadline=49, deadline=58, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=58, critical=1, deadline=49, deadline=58, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=59, critical=1, deadline=49, deadline=58, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=60, critical=1, deadline=49, deadline=58, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=61, critical=1, deadline=49, deadline=58, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=61, critical=1, deadline=49, deadline=58, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=61, critical=1, deadline=49, deadline=58, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=61, critical=1, deadline=49, deadline=58, 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] [L78] COND TRUE 3 lock != 2 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] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=1, critical=0, deadline=1, deadline=2, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=1, critical=0, deadline=1, deadline=2, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=1, critical=0, deadline=1, deadline=2, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=1, deadline=2, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=0, deadline=1, deadline=2, 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] [L81] 3 lock := 2; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=2, critical=1, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=1, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=1, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=1, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=1, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=1, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=7, critical=1, deadline=2, deadline=8, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=1, deadline=2, deadline=8, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=9, critical=1, deadline=2, deadline=8, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=10, critical=1, deadline=2, deadline=8, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=11, critical=1, deadline=2, deadline=8, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=12, critical=1, deadline=2, deadline=8, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=13, critical=1, deadline=2, deadline=8, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=13, critical=0, deadline=2, deadline=8, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=13, critical=0, deadline=2, deadline=8, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=13, critical=0, deadline=2, deadline=8, delay=1, lock=2, wait=1] [L69] 2 lock := 0; VAL [clk=13, critical=0, deadline=2, deadline=8, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=13, critical=0, deadline=2, deadline=8, delay=1, lock=0, wait=1] [L87] 3 assert critical == 0; VAL [clk=13, critical=0, deadline=2, deadline=8, delay=1, lock=0, wait=1] [L88] 3 critical := 2; VAL [clk=13, critical=2, deadline=2, deadline=8, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=13, critical=2, deadline=14, deadline=8, delay=1, lock=0, wait=1] [L89] 3 critical := 0; VAL [clk=13, critical=0, deadline=14, deadline=8, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=14, critical=0, deadline=14, deadline=8, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=14, critical=0, deadline=14, deadline=8, delay=1, lock=0, wait=1] [L90] 3 lock := 0; VAL [clk=14, critical=0, deadline=14, deadline=8, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=14, critical=0, deadline=14, deadline=8, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=14, critical=0, deadline=14, deadline=8, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=14, critical=0, deadline=15, deadline=8, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=15, critical=0, deadline=15, deadline=8, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=15, critical=0, deadline=15, deadline=8, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=16, critical=0, deadline=15, deadline=8, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=17, critical=0, deadline=15, deadline=8, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=18, critical=0, deadline=15, deadline=8, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=19, critical=0, deadline=15, deadline=8, delay=1, lock=1, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=19, critical=0, deadline=15, deadline=8, delay=1, lock=1, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=19, critical=0, deadline=15, deadline=20, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=20, critical=0, deadline=15, deadline=20, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=20, critical=0, deadline=15, deadline=20, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=20, critical=0, deadline=15, deadline=20, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=20, critical=1, deadline=15, deadline=20, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=20, critical=0, deadline=15, deadline=20, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=20, critical=0, deadline=15, deadline=20, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=20, critical=0, deadline=15, deadline=20, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=20, critical=0, deadline=15, deadline=20, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=20, critical=0, deadline=21, deadline=20, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=20, critical=0, deadline=21, deadline=20, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=20, critical=0, deadline=21, deadline=20, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=20, critical=0, deadline=21, deadline=21, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=21, critical=0, deadline=21, deadline=21, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=21, critical=0, deadline=21, deadline=21, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=21, critical=0, deadline=21, deadline=21, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=21, critical=0, deadline=21, deadline=21, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=21, critical=2, deadline=21, deadline=21, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=21, critical=0, deadline=21, deadline=21, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=21, critical=0, deadline=21, deadline=21, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=21, critical=0, deadline=21, deadline=21, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=21, critical=0, deadline=21, deadline=22, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=21, critical=0, deadline=21, deadline=22, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=21, critical=0, deadline=21, deadline=22, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=21, critical=0, deadline=21, deadline=22, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=21, critical=0, deadline=21, deadline=22, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=21, critical=0, deadline=22, deadline=22, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=22, critical=0, deadline=22, deadline=22, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=22, critical=0, deadline=22, deadline=22, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=22, critical=0, deadline=22, deadline=22, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=22, critical=0, deadline=22, deadline=22, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=22, critical=0, deadline=22, deadline=22, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=22, critical=0, deadline=22, deadline=22, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=22, critical=1, deadline=22, deadline=22, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=23, critical=1, deadline=22, deadline=22, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=24, critical=1, deadline=22, deadline=22, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=25, critical=1, deadline=22, deadline=22, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=26, critical=1, deadline=22, deadline=22, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=27, critical=1, deadline=22, deadline=22, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=28, critical=1, deadline=22, deadline=22, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=29, critical=1, deadline=22, deadline=22, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=30, critical=1, deadline=22, deadline=22, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=30, critical=1, deadline=22, deadline=31, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=31, critical=1, deadline=22, deadline=31, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=32, critical=1, deadline=22, deadline=31, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=33, critical=1, deadline=22, deadline=31, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=34, critical=1, deadline=22, deadline=31, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=35, critical=1, deadline=22, deadline=31, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=36, critical=1, deadline=22, deadline=31, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=36, critical=0, deadline=22, deadline=31, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=36, critical=0, deadline=22, deadline=31, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=36, critical=0, deadline=22, deadline=31, delay=1, lock=2, wait=1] [L69] 2 lock := 0; VAL [clk=36, critical=0, deadline=22, deadline=31, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=36, critical=0, deadline=22, deadline=31, delay=1, lock=0, wait=1] [L87] 3 assert critical == 0; VAL [clk=36, critical=0, deadline=22, deadline=31, delay=1, lock=0, wait=1] [L88] 3 critical := 2; VAL [clk=36, critical=2, deadline=22, deadline=31, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=36, critical=2, deadline=37, deadline=31, delay=1, lock=0, wait=1] [L89] 3 critical := 0; VAL [clk=36, critical=0, deadline=37, deadline=31, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=37, critical=0, deadline=37, deadline=31, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=37, critical=0, deadline=37, deadline=31, delay=1, lock=0, wait=1] [L90] 3 lock := 0; VAL [clk=37, critical=0, deadline=37, deadline=31, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=37, critical=0, deadline=37, deadline=31, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=37, critical=0, deadline=37, deadline=31, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=37, critical=0, deadline=38, deadline=31, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=38, critical=0, deadline=38, deadline=31, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=38, critical=0, deadline=38, deadline=31, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=39, critical=0, deadline=38, deadline=31, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=40, critical=0, deadline=38, deadline=31, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=41, critical=0, deadline=38, deadline=31, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=42, critical=0, deadline=38, deadline=31, delay=1, lock=1, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=42, critical=0, deadline=38, deadline=31, delay=1, lock=1, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=42, critical=0, deadline=38, deadline=43, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=43, critical=0, deadline=38, deadline=43, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=43, critical=0, deadline=38, deadline=43, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=43, critical=0, deadline=38, deadline=43, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=43, critical=1, deadline=38, deadline=43, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=43, critical=0, deadline=38, deadline=43, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=43, critical=0, deadline=38, deadline=43, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=43, critical=0, deadline=38, deadline=43, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=43, critical=0, deadline=38, deadline=43, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=43, critical=0, deadline=44, deadline=43, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=43, critical=0, deadline=44, deadline=43, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=43, critical=0, deadline=44, deadline=43, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=43, critical=0, deadline=44, deadline=44, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=44, critical=0, deadline=44, deadline=44, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=44, critical=0, deadline=44, deadline=44, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=44, critical=0, deadline=44, deadline=44, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=44, critical=0, deadline=44, deadline=44, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=44, critical=2, deadline=44, deadline=44, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=44, critical=0, deadline=44, deadline=44, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=44, critical=0, deadline=44, deadline=44, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=44, critical=0, deadline=44, deadline=44, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=44, critical=0, deadline=44, deadline=45, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=44, critical=0, deadline=44, deadline=45, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=44, critical=0, deadline=44, deadline=45, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=44, critical=0, deadline=44, deadline=45, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=44, critical=0, deadline=45, deadline=45, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=45, critical=0, deadline=45, deadline=45, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=45, critical=0, deadline=45, deadline=45, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=45, critical=0, deadline=45, deadline=45, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=45, critical=0, deadline=45, deadline=45, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=45, critical=1, deadline=45, deadline=45, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=45, critical=0, deadline=45, deadline=45, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=45, critical=0, deadline=45, deadline=45, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=45, critical=0, deadline=45, deadline=45, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=45, critical=0, deadline=45, deadline=45, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=45, critical=0, deadline=46, deadline=45, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=45, critical=0, deadline=46, deadline=45, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=45, critical=0, deadline=46, deadline=45, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=45, critical=0, deadline=46, deadline=45, 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] [L62] 2 deadline := clk + wait; VAL [clk=46, critical=0, deadline=47, deadline=46, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=47, critical=0, deadline=47, deadline=46, delay=1, lock=1, wait=1] [L88] 3 critical := 2; VAL [clk=47, critical=2, deadline=47, deadline=46, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=47, critical=2, deadline=47, deadline=46, delay=1, lock=1, wait=1] [L89] 3 critical := 0; VAL [clk=47, critical=0, deadline=47, deadline=46, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=48, critical=0, deadline=47, deadline=46, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=49, critical=0, deadline=47, deadline=46, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=50, critical=0, deadline=47, deadline=46, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=51, critical=0, deadline=47, deadline=46, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=52, critical=0, deadline=47, deadline=46, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=52, critical=0, deadline=47, deadline=46, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=52, critical=0, deadline=47, deadline=46, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=52, critical=1, deadline=47, deadline=46, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=52, critical=1, deadline=47, deadline=46, delay=1, lock=0, wait=1] [L68] 2 critical := 0; VAL [clk=52, critical=0, deadline=47, deadline=46, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=52, critical=0, deadline=47, deadline=46, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=52, critical=0, deadline=47, deadline=53, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=52, critical=0, deadline=47, deadline=53, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=52, critical=0, deadline=47, deadline=53, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=52, critical=0, deadline=47, deadline=53, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=53, critical=0, deadline=47, deadline=53, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=54, critical=0, deadline=47, deadline=53, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=55, critical=0, deadline=47, deadline=53, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=56, critical=0, deadline=47, deadline=53, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=57, critical=0, deadline=47, deadline=53, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=58, critical=0, deadline=47, deadline=53, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=59, critical=0, deadline=47, deadline=53, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=60, critical=0, deadline=47, deadline=53, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=61, critical=0, deadline=47, deadline=53, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=61, critical=0, deadline=47, deadline=62, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=62, critical=0, deadline=47, deadline=62, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=63, critical=0, deadline=47, deadline=62, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=64, critical=0, deadline=47, deadline=62, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=65, critical=0, deadline=47, deadline=62, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=66, critical=0, deadline=47, deadline=62, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=67, critical=0, deadline=47, deadline=62, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=67, critical=0, deadline=47, deadline=62, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=67, critical=0, deadline=47, deadline=62, delay=1, lock=2, wait=1] [L69] 2 lock := 0; VAL [clk=67, critical=0, deadline=47, deadline=62, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=67, critical=0, deadline=47, deadline=62, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=67, critical=0, deadline=68, deadline=62, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=68, critical=0, deadline=68, deadline=62, delay=1, lock=0, wait=1] [L87] 3 assert critical == 0; VAL [clk=68, critical=0, deadline=68, deadline=62, delay=1, lock=0, wait=1] [L88] 3 critical := 2; VAL [clk=68, critical=2, deadline=68, deadline=62, delay=1, lock=0, wait=1] [L89] 3 critical := 0; VAL [clk=68, critical=0, deadline=68, deadline=62, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=68, critical=0, deadline=68, deadline=62, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=68, critical=0, deadline=68, deadline=62, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=68, critical=0, deadline=68, deadline=62, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=68, critical=0, deadline=69, deadline=62, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=69, critical=0, deadline=69, deadline=62, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=69, critical=0, deadline=69, deadline=62, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=70, critical=0, deadline=69, deadline=62, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=71, critical=0, deadline=69, deadline=62, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=72, critical=0, deadline=69, deadline=62, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=73, critical=0, deadline=69, deadline=62, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=73, critical=0, deadline=69, deadline=62, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=73, critical=0, deadline=69, deadline=62, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=73, critical=1, deadline=69, deadline=62, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=73, critical=0, deadline=69, deadline=62, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=73, critical=0, deadline=69, deadline=62, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=73, critical=0, deadline=69, deadline=62, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=73, critical=0, deadline=74, deadline=62, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=74, critical=0, deadline=74, deadline=62, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=74, critical=0, deadline=74, deadline=62, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=74, critical=0, deadline=74, deadline=62, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=74, critical=0, deadline=74, deadline=62, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=74, critical=0, deadline=75, deadline=62, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=75, critical=0, deadline=75, deadline=62, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=75, critical=0, deadline=75, deadline=62, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=76, critical=0, deadline=75, deadline=62, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=77, critical=0, deadline=75, deadline=62, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=77, critical=0, deadline=75, deadline=62, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=77, critical=0, deadline=75, deadline=62, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=77, critical=0, deadline=75, deadline=62, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=77, critical=0, deadline=75, deadline=62, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=77, critical=0, deadline=75, deadline=78, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=77, critical=0, deadline=75, deadline=78, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=77, critical=0, deadline=75, deadline=78, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=78, critical=0, deadline=75, deadline=78, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=78, critical=0, deadline=75, deadline=78, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=79, critical=0, deadline=75, deadline=78, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=80, critical=0, deadline=75, deadline=78, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=81, critical=0, deadline=75, deadline=78, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=82, critical=0, deadline=75, deadline=78, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=83, critical=0, deadline=75, deadline=78, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=84, critical=0, deadline=75, deadline=78, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=85, critical=0, deadline=75, deadline=78, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=86, critical=0, deadline=75, deadline=78, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=86, critical=0, deadline=75, deadline=87, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=87, critical=0, deadline=75, deadline=87, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=88, critical=0, deadline=75, deadline=87, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=89, critical=0, deadline=75, deadline=87, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=90, critical=0, deadline=75, deadline=87, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=91, critical=0, deadline=75, deadline=87, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=92, critical=0, deadline=75, deadline=87, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=92, critical=0, deadline=75, deadline=87, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=92, critical=0, deadline=75, deadline=87, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=92, critical=0, deadline=75, deadline=87, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=92, critical=2, deadline=75, deadline=87, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=92, critical=0, deadline=75, deadline=87, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=92, critical=1, deadline=75, deadline=87, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=92, critical=1, deadline=75, deadline=87, delay=1, lock=0, wait=1] [L68] 2 critical := 0; VAL [clk=92, critical=0, deadline=75, deadline=87, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=92, critical=0, deadline=75, deadline=87, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=92, critical=0, deadline=75, deadline=93, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=92, critical=0, deadline=75, deadline=93, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=92, critical=0, deadline=75, deadline=93, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=92, critical=0, deadline=75, deadline=93, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=93, critical=0, deadline=75, deadline=93, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=94, critical=0, deadline=75, deadline=93, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=95, critical=0, deadline=75, deadline=93, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=96, critical=0, deadline=75, deadline=93, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=97, critical=0, deadline=75, deadline=93, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=98, critical=0, deadline=75, deadline=93, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=99, critical=0, deadline=75, deadline=93, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=100, critical=0, deadline=75, deadline=93, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=101, critical=0, deadline=75, deadline=93, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=101, critical=0, deadline=75, deadline=102, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=102, critical=0, deadline=75, deadline=102, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=103, critical=0, deadline=75, deadline=102, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=104, critical=0, deadline=75, deadline=102, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=105, critical=0, deadline=75, deadline=102, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=106, critical=0, deadline=75, deadline=102, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=106, critical=0, deadline=75, deadline=102, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=106, critical=0, deadline=75, deadline=102, delay=1, lock=2, wait=1] [L69] 2 lock := 0; VAL [clk=106, critical=0, deadline=75, deadline=102, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=106, critical=0, deadline=75, deadline=102, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=106, critical=0, deadline=107, deadline=102, delay=1, lock=0, wait=1] [L87] 3 assert critical == 0; VAL [clk=106, critical=0, deadline=107, deadline=102, delay=1, lock=0, wait=1] [L88] 3 critical := 2; VAL [clk=106, critical=2, deadline=107, deadline=102, delay=1, lock=0, wait=1] [L89] 3 critical := 0; VAL [clk=106, critical=0, deadline=107, deadline=102, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=106, critical=0, deadline=107, deadline=102, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=106, critical=0, deadline=107, deadline=102, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=106, critical=0, deadline=107, deadline=102, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=106, critical=0, deadline=107, deadline=102, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=107, critical=0, deadline=107, deadline=102, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=107, critical=0, deadline=107, deadline=102, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=108, critical=0, deadline=107, deadline=102, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=109, critical=0, deadline=107, deadline=102, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=110, critical=0, deadline=107, deadline=102, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=110, critical=0, deadline=107, deadline=102, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=110, critical=0, deadline=107, deadline=102, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=110, critical=0, deadline=107, deadline=102, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=110, critical=0, deadline=107, deadline=111, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=110, critical=0, deadline=107, deadline=111, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=110, critical=0, deadline=107, deadline=111, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=111, critical=0, deadline=107, deadline=111, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=111, critical=0, deadline=107, deadline=111, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=112, critical=0, deadline=107, deadline=111, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=113, critical=0, deadline=107, deadline=111, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=114, critical=0, deadline=107, deadline=111, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=115, critical=0, deadline=107, deadline=111, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=116, critical=0, deadline=107, deadline=111, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=117, critical=0, deadline=107, deadline=111, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=118, critical=0, deadline=107, deadline=111, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=119, critical=0, deadline=107, deadline=111, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=119, critical=0, deadline=107, deadline=120, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=120, critical=0, deadline=107, deadline=120, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=121, critical=0, deadline=107, deadline=120, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=122, critical=0, deadline=107, deadline=120, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=123, critical=0, deadline=107, deadline=120, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=124, critical=0, deadline=107, deadline=120, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=125, critical=0, deadline=107, deadline=120, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=125, critical=0, deadline=107, deadline=120, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=125, critical=0, deadline=107, deadline=120, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=125, critical=0, deadline=107, deadline=120, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=125, critical=2, deadline=107, deadline=120, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=125, critical=2, deadline=107, deadline=120, delay=1, lock=2, 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: 27957.1ms, OverallIterations: 16, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15.2ms, PartialOrderReductionTime: 20193.4ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 372, 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: 173.3ms SsaConstructionTime, 983.8ms SatisfiabilityAnalysisTime, 4365.1ms InterpolantComputationTime, 5295 NumberOfCodeBlocks, 4651 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 5040 ConstructedInterpolants, 0 QuantifiedInterpolants, 9320 SizeOfPredicates, 27 NumberOfNonLiveVariables, 2871 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 53546/56404 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: 237.4ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.0ms, PartialOrderReductionTime: 223.5ms, 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: 191.6ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.0ms, PartialOrderReductionTime: 181.1ms, 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: 168.8ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.9ms, PartialOrderReductionTime: 161.6ms, 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: 80221.1ms, OverallIterations: 17, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.7ms, PartialOrderReductionTime: 73671.4ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 687, 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: 313.8ms SsaConstructionTime, 596.1ms SatisfiabilityAnalysisTime, 3458.5ms InterpolantComputationTime, 5445 NumberOfCodeBlocks, 4959 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 5076 ConstructedInterpolants, 0 QuantifiedInterpolants, 9820 SizeOfPredicates, 31 NumberOfNonLiveVariables, 3038 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 25 InterpolantComputations, 7 PerfectInterpolantSequences, 54647/58600 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...