/usr/bin/java -Xmx16000000000 -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-NewStatesSleepUncond-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9b7772ad7705253c1305067fc38dc9bc7271fbe3-9b7772a [2021-04-15 12:57:07,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-15 12:57:07,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-15 12:57:07,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-15 12:57:07,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-15 12:57:07,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-15 12:57:07,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-15 12:57:07,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-15 12:57:07,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-15 12:57:07,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-15 12:57:07,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-15 12:57:07,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-15 12:57:07,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-15 12:57:07,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-15 12:57:07,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-15 12:57:07,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-15 12:57:07,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-15 12:57:07,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-15 12:57:07,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-15 12:57:07,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-15 12:57:07,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-15 12:57:07,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-15 12:57:07,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-15 12:57:07,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-15 12:57:07,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-15 12:57:07,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-15 12:57:07,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-15 12:57:07,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-15 12:57:07,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-15 12:57:07,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-15 12:57:07,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-15 12:57:07,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-15 12:57:07,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-15 12:57:07,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-15 12:57:07,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-15 12:57:07,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-15 12:57:07,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-15 12:57:07,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-15 12:57:07,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-15 12:57:07,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-15 12:57:07,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-15 12:57:07,919 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-NewStatesSleepUncond-NoLbe.epf [2021-04-15 12:57:07,968 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-15 12:57:07,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-15 12:57:07,969 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-04-15 12:57:07,970 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-04-15 12:57:07,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-15 12:57:07,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-15 12:57:07,975 INFO L138 SettingsManager]: * Use SBE=true [2021-04-15 12:57:07,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-15 12:57:07,976 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-15 12:57:07,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-15 12:57:07,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-15 12:57:07,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-15 12:57:07,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-15 12:57:07,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-15 12:57:07,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-15 12:57:07,979 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-15 12:57:07,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-15 12:57:07,979 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-15 12:57:07,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-15 12:57:07,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-15 12:57:07,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-15 12:57:07,980 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-15 12:57:07,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-15 12:57:07,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-15 12:57:07,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-15 12:57:07,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-15 12:57:07,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-15 12:57:07,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-15 12:57:07,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-15 12:57:07,981 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-04-15 12:57:07,981 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-04-15 12:57:07,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-04-15 12:57:07,981 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2021-04-15 12:57:07,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-15 12:57:07,982 INFO L138 SettingsManager]: * Use conditional POR in concurrent analysis=false 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-04-15 12:57:08,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-15 12:57:08,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-15 12:57:08,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-15 12:57:08,418 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-04-15 12:57:08,419 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-04-15 12:57:08,421 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-04-15 12:57:08,421 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-04-15 12:57:08,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-15 12:57:08,486 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-04-15 12:57:08,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-15 12:57:08,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-15 12:57:08,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-15 12:57:08,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.04 12:57:08" (1/1) ... [2021-04-15 12:57:08,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.04 12:57:08" (1/1) ... [2021-04-15 12:57:08,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-15 12:57:08,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-15 12:57:08,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-15 12:57:08,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-15 12:57:08,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.04 12:57:08" (1/1) ... [2021-04-15 12:57:08,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.04 12:57:08" (1/1) ... [2021-04-15 12:57:08,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.04 12:57:08" (1/1) ... [2021-04-15 12:57:08,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.04 12:57:08" (1/1) ... [2021-04-15 12:57:08,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.04 12:57:08" (1/1) ... [2021-04-15 12:57:08,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.04 12:57:08" (1/1) ... [2021-04-15 12:57:08,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.04 12:57:08" (1/1) ... [2021-04-15 12:57:08,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-15 12:57:08,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-15 12:57:08,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-15 12:57:08,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-15 12:57:08,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.04 12:57:08" (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-04-15 12:57:08,620 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-04-15 12:57:08,621 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-04-15 12:57:08,621 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-04-15 12:57:08,621 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-04-15 12:57:08,621 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-04-15 12:57:08,621 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-04-15 12:57:08,621 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-04-15 12:57:08,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-15 12:57:08,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-15 12:57:08,621 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-04-15 12:57:08,622 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-04-15 12:57:08,622 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-04-15 12:57:08,623 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-15 12:57:08,931 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-15 12:57:08,932 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-04-15 12:57:08,933 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:57:08 BoogieIcfgContainer [2021-04-15 12:57:08,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-15 12:57:08,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-15 12:57:08,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-15 12:57:08,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-15 12:57:08,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.04 12:57:08" (1/2) ... [2021-04-15 12:57:08,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350cb851 and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:57:08, skipping insertion in model container [2021-04-15 12:57:08,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:57:08" (2/2) ... [2021-04-15 12:57:08,958 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-04-15 12:57:08,964 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-04-15 12:57:08,964 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-15 12:57:08,968 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-15 12:57:08,969 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-15 12:57:08,994 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:08,994 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:08,995 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:08,995 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:08,996 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:08,996 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:08,996 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:08,996 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:08,997 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:08,998 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:08,998 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:08,998 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:08,999 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:08,999 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:08,999 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:08,999 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:09,006 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:09,008 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 12:57:09,010 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-15 12:57:09,046 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 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-04-15 12:57:09,166 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-15 12:57:09,167 INFO L377 AbstractCegarLoop]: Hoare is true [2021-04-15 12:57:09,167 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-15 12:57:09,167 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-15 12:57:09,167 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-15 12:57:09,167 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-15 12:57:09,167 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-15 12:57:09,167 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-15 12:57:09,229 INFO L428 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-15 12:57:09,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 12:57:09,240 INFO L82 PathProgramCache]: Analyzing trace with hash 326055189, now seen corresponding path program 1 times [2021-04-15 12:57:09,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 12:57:09,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049749173] [2021-04-15 12:57:09,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 12:57:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 12:57:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 12:57:09,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049749173] [2021-04-15 12:57:09,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 12:57:09,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-15 12:57:09,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42760660] [2021-04-15 12:57:09,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-04-15 12:57:09,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 12:57:09,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-04-15 12:57:09,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-04-15 12:57:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:09,423 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-04-15 12:57:09,426 INFO L481 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-04-15 12:57:09,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:09,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:09,491 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-15 12:57:09,492 INFO L428 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-15 12:57:09,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 12:57:09,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1309413604, now seen corresponding path program 1 times [2021-04-15 12:57:09,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 12:57:09,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394861903] [2021-04-15 12:57:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 12:57:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 12:57:09,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 12:57:09,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394861903] [2021-04-15 12:57:09,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 12:57:09,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-15 12:57:09,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686059934] [2021-04-15 12:57:09,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-15 12:57:09,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 12:57:09,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-15 12:57:09,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 12:57:09,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:09,574 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-04-15 12:57:09,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-04-15 12:57:09,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:09,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:09,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:09,772 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-15 12:57:09,773 INFO L428 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-15 12:57:09,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 12:57:09,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1273138009, now seen corresponding path program 1 times [2021-04-15 12:57:09,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 12:57:09,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399904266] [2021-04-15 12:57:09,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 12:57:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 12:57:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2021-04-15 12:57:09,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399904266] [2021-04-15 12:57:09,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 12:57:09,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-15 12:57:09,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619036248] [2021-04-15 12:57:09,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-15 12:57:09,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 12:57:09,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-15 12:57:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 12:57:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:09,922 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-04-15 12:57:09,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-04-15 12:57:09,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:09,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:09,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,067 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-15 12:57:10,067 INFO L428 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-15 12:57:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 12:57:10,068 INFO L82 PathProgramCache]: Analyzing trace with hash -349652305, now seen corresponding path program 1 times [2021-04-15 12:57:10,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 12:57:10,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284280600] [2021-04-15 12:57:10,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 12:57:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 12:57:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2021-04-15 12:57:10,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284280600] [2021-04-15 12:57:10,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 12:57:10,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-15 12:57:10,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397734693] [2021-04-15 12:57:10,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-15 12:57:10,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 12:57:10,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-15 12:57:10,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 12:57:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,137 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-04-15 12:57:10,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 12:57:10,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,194 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-15 12:57:10,194 INFO L428 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-15 12:57:10,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 12:57:10,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1122987757, now seen corresponding path program 2 times [2021-04-15 12:57:10,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 12:57:10,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118269687] [2021-04-15 12:57:10,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 12:57:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 12:57:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-04-15 12:57:10,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118269687] [2021-04-15 12:57:10,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 12:57:10,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-15 12:57:10,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972014853] [2021-04-15 12:57:10,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-15 12:57:10,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 12:57:10,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-15 12:57:10,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 12:57:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,245 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-04-15 12:57:10,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 12:57:10,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-15 12:57:10,325 INFO L428 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-15 12:57:10,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 12:57:10,326 INFO L82 PathProgramCache]: Analyzing trace with hash 582325919, now seen corresponding path program 2 times [2021-04-15 12:57:10,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 12:57:10,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707208509] [2021-04-15 12:57:10,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 12:57:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 12:57:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-04-15 12:57:10,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707208509] [2021-04-15 12:57:10,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 12:57:10,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-15 12:57:10,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659913804] [2021-04-15 12:57:10,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-15 12:57:10,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 12:57:10,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-15 12:57:10,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-15 12:57:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,381 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-04-15 12:57:10,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-04-15 12:57:10,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-15 12:57:10,490 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-15 12:57:10,491 INFO L428 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-15 12:57:10,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 12:57:10,491 INFO L82 PathProgramCache]: Analyzing trace with hash 849800052, now seen corresponding path program 3 times [2021-04-15 12:57:10,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 12:57:10,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685930980] [2021-04-15 12:57:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 12:57:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 12:57:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-04-15 12:57:10,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685930980] [2021-04-15 12:57:10,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 12:57:10,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-15 12:57:10,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332576172] [2021-04-15 12:57:10,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-15 12:57:10,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 12:57:10,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-15 12:57:10,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-15 12:57:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,586 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-04-15 12:57:10,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 12:57:10,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-04-15 12:57:10,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-15 12:57:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-15 12:57:10,684 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-15 12:57:10,686 INFO L428 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-15 12:57:10,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 12:57:10,686 INFO L82 PathProgramCache]: Analyzing trace with hash 698179790, now seen corresponding path program 1 times [2021-04-15 12:57:10,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 12:57:10,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890919066] [2021-04-15 12:57:10,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 12:57:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 12:57:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-04-15 12:57:10,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890919066] [2021-04-15 12:57:10,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 12:57:10,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-15 12:57:10,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286213900] [2021-04-15 12:57:10,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-15 12:57:10,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 12:57:10,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-15 12:57:10,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 12:57:10,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,750 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-04-15 12:57:10,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 12:57:10,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-04-15 12:57:10,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-04-15 12:57:10,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-15 12:57:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-15 12:57:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:10,845 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-15 12:57:10,845 INFO L428 AbstractCegarLoop]: === Iteration 9 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-15 12:57:10,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 12:57:10,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1425213936, now seen corresponding path program 4 times [2021-04-15 12:57:10,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 12:57:10,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78682455] [2021-04-15 12:57:10,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 12:57:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 12:57:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-04-15 12:57:10,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78682455] [2021-04-15 12:57:10,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012363583] [2021-04-15 12:57:10,980 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 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-04-15 12:57:11,049 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-04-15 12:57:11,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-04-15 12:57:11,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2021-04-15 12:57:11,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-04-15 12:57:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 76 proven. 26 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-04-15 12:57:11,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-04-15 12:57:11,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-04-15 12:57:11,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045590052] [2021-04-15 12:57:11,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-04-15 12:57:11,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 12:57:11,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-04-15 12:57:11,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-04-15 12:57:11,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:11,512 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-04-15 12:57:11,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 8.4) internal successors, (126), 15 states have internal predecessors, (126), 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-04-15 12:57:11,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:11,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:11,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:11,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:11,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:11,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-04-15 12:57:11,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-04-15 12:57:11,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:11,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:12,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-04-15 12:57:12,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:12,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:12,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:12,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:12,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-15 12:57:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-15 12:57:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 12:57:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-04-15 12:57:13,002 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-04-15 12:57:13,002 INFO L428 AbstractCegarLoop]: === Iteration 10 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2INUSE_VIOLATION, Process1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1INUSE_VIOLATION, Process2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-04-15 12:57:13,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 12:57:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1595846676, now seen corresponding path program 2 times [2021-04-15 12:57:13,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 12:57:13,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249971639] [2021-04-15 12:57:13,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 12:57:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 12:57:13,030 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 12:57:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 12:57:13,063 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 12:57:13,115 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-15 12:57:13,115 INFO L652 BasicCegarLoop]: Counterexample might be feasible [2021-04-15 12:57:13,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-15 12:57:13,204 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:57:13 BasicIcfg [2021-04-15 12:57:13,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-15 12:57:13,205 INFO L168 Benchmark]: Toolchain (without parser) took 4719.29 ms. Allocated memory was 255.9 MB in the beginning and 492.8 MB in the end (delta: 237.0 MB). Free memory was 236.7 MB in the beginning and 462.0 MB in the end (delta: -225.3 MB). Peak memory consumption was 64.8 MB. Max. memory is 16.0 GB. [2021-04-15 12:57:13,205 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-15 12:57:13,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.74 ms. Allocated memory is still 255.9 MB. Free memory was 236.7 MB in the beginning and 235.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-15 12:57:13,205 INFO L168 Benchmark]: Boogie Preprocessor took 22.16 ms. Allocated memory is still 255.9 MB. Free memory was 235.3 MB in the beginning and 234.2 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-15 12:57:13,205 INFO L168 Benchmark]: RCFGBuilder took 390.68 ms. Allocated memory is still 255.9 MB. Free memory was 234.1 MB in the beginning and 238.5 MB in the end (delta: -4.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.0 GB. [2021-04-15 12:57:13,206 INFO L168 Benchmark]: TraceAbstraction took 4269.18 ms. Allocated memory was 255.9 MB in the beginning and 492.8 MB in the end (delta: 237.0 MB). Free memory was 238.3 MB in the beginning and 462.0 MB in the end (delta: -223.7 MB). Peak memory consumption was 66.2 MB. Max. memory is 16.0 GB. [2021-04-15 12:57:13,206 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.24 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 31.74 ms. Allocated memory is still 255.9 MB. Free memory was 236.7 MB in the beginning and 235.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 22.16 ms. Allocated memory is still 255.9 MB. Free memory was 235.3 MB in the beginning and 234.2 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 390.68 ms. Allocated memory is still 255.9 MB. Free memory was 234.1 MB in the beginning and 238.5 MB in the end (delta: -4.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 4269.18 ms. Allocated memory was 255.9 MB in the beginning and 492.8 MB in the end (delta: 237.0 MB). Free memory was 238.3 MB in the beginning and 462.0 MB in the end (delta: -223.7 MB). Peak memory consumption was 66.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 25158, positive: 18652, positive conditional: 18652, positive unconditional: 0, negative: 6506, negative conditional: 6506, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20634, positive: 18652, positive conditional: 0, positive unconditional: 18652, negative: 1982, negative conditional: 0, negative unconditional: 1982, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 477, positive: 448, positive conditional: 0, positive unconditional: 448, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 477, positive: 430, positive conditional: 0, positive unconditional: 430, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 152, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 109, negative conditional: 0, negative unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20634, positive: 18204, positive conditional: 0, positive unconditional: 18204, negative: 1953, negative conditional: 0, negative unconditional: 1953, unknown: 477, unknown conditional: 0, unknown unconditional: 477] , Statistics on independence cache: Total cache size (in pairs): 477, Positive cache size: 448, Positive conditional cache size: 0, Positive unconditional cache size: 448, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Independence queries for same thread: 4524 - 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] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=1, critical=1, deadline=1, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=3, critical=1, deadline=2, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=4, critical=0, deadline=5, deadline=2, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=4, critical=0, deadline=5, deadline=2, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=4, critical=0, deadline=5, deadline=2, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=4, critical=0, deadline=5, deadline=2, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=4, critical=0, deadline=5, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=5, deadline=2, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=5, critical=0, deadline=5, deadline=2, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=5, critical=0, deadline=5, deadline=2, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=5, critical=0, deadline=5, deadline=2, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=5, critical=2, deadline=5, deadline=2, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=5, critical=0, deadline=5, deadline=2, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=5, critical=0, deadline=5, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=5, critical=0, deadline=5, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=5, critical=0, deadline=6, deadline=2, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=5, critical=0, deadline=6, deadline=2, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=5, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=5, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=5, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=6, critical=2, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=6, critical=0, deadline=7, deadline=6, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=6, critical=0, deadline=7, deadline=6, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=6, critical=0, deadline=7, deadline=6, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=6, critical=0, deadline=7, deadline=6, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=6, critical=0, deadline=7, deadline=6, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=6, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=7, critical=0, deadline=8, deadline=7, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=7, critical=0, deadline=8, deadline=7, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=7, critical=1, deadline=8, deadline=7, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=7, critical=0, deadline=8, deadline=7, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=8, critical=2, deadline=8, deadline=7, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=8, critical=0, deadline=8, deadline=7, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=8, critical=0, deadline=9, deadline=7, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=8, critical=0, deadline=9, deadline=7, delay=1, lock=0, wait=1] [L69] 2 lock := 0; VAL [clk=8, critical=0, deadline=9, deadline=7, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=8, critical=0, deadline=9, deadline=7, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=8, critical=0, deadline=9, deadline=7, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=8, critical=0, deadline=9, deadline=7, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=9, critical=0, deadline=9, deadline=7, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=9, critical=0, deadline=9, deadline=7, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=9, critical=0, deadline=9, deadline=7, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=9, critical=0, deadline=9, deadline=7, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=9, critical=2, deadline=9, deadline=7, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=9, critical=0, deadline=9, deadline=7, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=9, critical=0, deadline=9, deadline=7, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=9, critical=0, deadline=9, deadline=7, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=9, critical=0, deadline=10, deadline=7, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=9, critical=0, deadline=10, deadline=7, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=9, critical=0, deadline=10, deadline=7, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=9, critical=0, deadline=10, deadline=10, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=9, critical=0, deadline=10, deadline=10, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=9, critical=0, deadline=10, deadline=10, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=9, critical=0, deadline=10, deadline=10, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=9, critical=0, deadline=10, deadline=10, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=10, critical=0, deadline=10, deadline=10, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=10, critical=0, deadline=10, deadline=10, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=10, critical=0, deadline=10, deadline=10, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=10, critical=0, deadline=10, deadline=10, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=10, critical=2, deadline=10, deadline=10, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=10, critical=0, deadline=10, deadline=10, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=10, critical=0, deadline=10, deadline=10, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=10, critical=0, deadline=10, deadline=10, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=10, critical=0, deadline=10, deadline=11, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=11, critical=0, deadline=10, deadline=11, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=11, critical=0, deadline=12, deadline=11, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=11, critical=0, deadline=12, deadline=11, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=11, critical=0, deadline=12, deadline=11, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=11, critical=0, deadline=12, deadline=11, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=11, critical=0, deadline=12, deadline=11, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=11, critical=1, deadline=12, deadline=11, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=12, critical=1, deadline=12, deadline=11, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=12, critical=1, deadline=13, deadline=11, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=13, critical=1, deadline=13, deadline=11, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=13, critical=1, deadline=13, deadline=11, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=13, critical=1, deadline=13, deadline=11, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=13, critical=1, deadline=13, deadline=11, delay=1, lock=2, wait=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4040.2ms, OverallIterations: 10, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 20.0ms, PartialOrderReductionTime: 2149.8ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 59, 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: 44.8ms SsaConstructionTime, 201.3ms SatisfiabilityAnalysisTime, 963.4ms InterpolantComputationTime, 1132 NumberOfCodeBlocks, 1132 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 986 ConstructedInterpolants, 0 QuantifiedInterpolants, 1666 SizeOfPredicates, 4 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 1844/1896 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...