/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-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-770125f [2021-05-22 01:37:54,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-22 01:37:54,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-22 01:37:54,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-22 01:37:54,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-22 01:37:54,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-22 01:37:54,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-22 01:37:54,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-22 01:37:54,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-22 01:37:54,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-22 01:37:54,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-22 01:37:54,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-22 01:37:54,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-22 01:37:54,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-22 01:37:54,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-22 01:37:54,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-22 01:37:54,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-22 01:37:54,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-22 01:37:54,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-22 01:37:54,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-22 01:37:54,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-22 01:37:54,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-22 01:37:54,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-22 01:37:54,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-22 01:37:54,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-22 01:37:54,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-22 01:37:54,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-22 01:37:54,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-22 01:37:54,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-22 01:37:54,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-22 01:37:54,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-22 01:37:54,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-22 01:37:54,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-22 01:37:54,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-22 01:37:54,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-22 01:37:54,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-22 01:37:54,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-22 01:37:54,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-22 01:37:54,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-22 01:37:54,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-22 01:37:54,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-22 01:37:54,801 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-FA-NoLbe-Separate.epf [2021-05-22 01:37:54,816 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-22 01:37:54,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-22 01:37:54,816 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-05-22 01:37:54,816 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-05-22 01:37:54,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-22 01:37:54,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-22 01:37:54,817 INFO L138 SettingsManager]: * Use SBE=true [2021-05-22 01:37:54,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-22 01:37:54,818 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-22 01:37:54,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-22 01:37:54,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-22 01:37:54,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-22 01:37:54,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-22 01:37:54,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-22 01:37:54,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-22 01:37:54,818 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-22 01:37:54,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-22 01:37:54,818 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-22 01:37:54,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-22 01:37:54,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-22 01:37:54,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-22 01:37:54,819 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-22 01:37:54,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-22 01:37:54,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-22 01:37:54,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-22 01:37:54,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-22 01:37:54,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-22 01:37:54,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-22 01:37:54,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-22 01:37:54,820 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-05-22 01:37:54,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-22 01:37:54,820 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-05-22 01:37:54,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-05-22 01:37:55,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-22 01:37:55,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-22 01:37:55,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-22 01:37:55,039 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-05-22 01:37:55,040 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-05-22 01:37:55,041 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-05-22 01:37:55,041 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-05-22 01:37:55,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-22 01:37:55,056 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-22 01:37:55,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-05-22 01:37:55,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-05-22 01:37:55,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-05-22 01:37:55,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.05 01:37:55" (1/1) ... [2021-05-22 01:37:55,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.05 01:37:55" (1/1) ... [2021-05-22 01:37:55,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-05-22 01:37:55,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-22 01:37:55,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-22 01:37:55,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-22 01:37:55,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.05 01:37:55" (1/1) ... [2021-05-22 01:37:55,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.05 01:37:55" (1/1) ... [2021-05-22 01:37:55,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.05 01:37:55" (1/1) ... [2021-05-22 01:37:55,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.05 01:37:55" (1/1) ... [2021-05-22 01:37:55,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.05 01:37:55" (1/1) ... [2021-05-22 01:37:55,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.05 01:37:55" (1/1) ... [2021-05-22 01:37:55,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.05 01:37:55" (1/1) ... [2021-05-22 01:37:55,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-22 01:37:55,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-22 01:37:55,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-22 01:37:55,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-22 01:37:55,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.05 01:37:55" (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-05-22 01:37:55,160 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-05-22 01:37:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-05-22 01:37:55,160 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-05-22 01:37:55,161 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-05-22 01:37:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-05-22 01:37:55,161 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-05-22 01:37:55,161 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-05-22 01:37:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-22 01:37:55,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-22 01:37:55,161 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-05-22 01:37:55,161 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-05-22 01:37:55,161 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-05-22 01:37:55,162 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-05-22 01:37:55,296 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-22 01:37:55,297 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-05-22 01:37:55,297 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.05 01:37:55 BoogieIcfgContainer [2021-05-22 01:37:55,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-22 01:37:55,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-22 01:37:55,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-22 01:37:55,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-22 01:37:55,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 22.05 01:37:55" (1/2) ... [2021-05-22 01:37:55,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eaecc1d and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.05 01:37:55, skipping insertion in model container [2021-05-22 01:37:55,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.05 01:37:55" (2/2) ... [2021-05-22 01:37:55,302 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-05-22 01:37:55,306 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-05-22 01:37:55,306 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-22 01:37:55,306 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-05-22 01:37:55,307 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-05-22 01:37:55,323 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,323 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,324 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,324 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,324 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,324 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,325 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,325 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,326 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,326 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,326 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,327 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,327 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,327 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,327 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,327 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,331 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,333 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-05-22 01:37:55,333 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-05-22 01:37:55,347 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-05-22 01:37:55,370 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-22 01:37:55,370 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-22 01:37:55,370 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-22 01:37:55,370 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-22 01:37:55,370 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-22 01:37:55,370 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-22 01:37:55,370 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-22 01:37:55,370 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-22 01:37:55,377 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 107 flow [2021-05-22 01:37:55,500 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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-05-22 01:37:55,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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-05-22 01:37:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-05-22 01:37:55,509 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:37:55,509 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:37:55,509 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:37:55,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:37:55,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1128325677, now seen corresponding path program 1 times [2021-05-22 01:37:55,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:37:55,518 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655746884] [2021-05-22 01:37:55,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:37:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:37:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:37:55,593 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:37:55,593 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655746884] [2021-05-22 01:37:55,594 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655746884] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:37:55,594 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:37:55,594 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-05-22 01:37:55,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252465270] [2021-05-22 01:37:55,597 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-22 01:37:55,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:37:55,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-22 01:37:55,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-22 01:37:55,609 INFO L87 Difference]: Start difference. First operand has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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) Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-05-22 01:37:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:37:55,654 INFO L93 Difference]: Finished difference Result 398 states and 1386 transitions. [2021-05-22 01:37:55,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-22 01:37:55,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2021-05-22 01:37:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:37:55,667 INFO L225 Difference]: With dead ends: 398 [2021-05-22 01:37:55,667 INFO L226 Difference]: Without dead ends: 398 [2021-05-22 01:37:55,668 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-22 01:37:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-05-22 01:37:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 394. [2021-05-22 01:37:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 394 states have (on average 3.482233502538071) internal successors, (1372), 393 states have internal predecessors, (1372), 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-05-22 01:37:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1372 transitions. [2021-05-22 01:37:55,723 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1372 transitions. Word has length 8 [2021-05-22 01:37:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:37:55,724 INFO L482 AbstractCegarLoop]: Abstraction has 394 states and 1372 transitions. [2021-05-22 01:37:55,724 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-05-22 01:37:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1372 transitions. [2021-05-22 01:37:55,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-22 01:37:55,725 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:37:55,726 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:37:55,726 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-22 01:37:55,726 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:37:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:37:55,727 INFO L82 PathProgramCache]: Analyzing trace with hash -372247321, now seen corresponding path program 1 times [2021-05-22 01:37:55,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:37:55,727 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483788563] [2021-05-22 01:37:55,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:37:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:37:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:37:55,744 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:37:55,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483788563] [2021-05-22 01:37:55,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483788563] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:37:55,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:37:55,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-22 01:37:55,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20357269] [2021-05-22 01:37:55,745 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-22 01:37:55,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:37:55,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-22 01:37:55,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-22 01:37:55,746 INFO L87 Difference]: Start difference. First operand 394 states and 1372 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05-22 01:37:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:37:55,778 INFO L93 Difference]: Finished difference Result 619 states and 2131 transitions. [2021-05-22 01:37:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-22 01:37:55,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2021-05-22 01:37:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:37:55,782 INFO L225 Difference]: With dead ends: 619 [2021-05-22 01:37:55,782 INFO L226 Difference]: Without dead ends: 523 [2021-05-22 01:37:55,783 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-22 01:37:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-05-22 01:37:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 403. [2021-05-22 01:37:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 403 states have (on average 3.332506203473945) internal successors, (1343), 402 states have internal predecessors, (1343), 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-05-22 01:37:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1343 transitions. [2021-05-22 01:37:55,806 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1343 transitions. Word has length 12 [2021-05-22 01:37:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:37:55,806 INFO L482 AbstractCegarLoop]: Abstraction has 403 states and 1343 transitions. [2021-05-22 01:37:55,806 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05-22 01:37:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1343 transitions. [2021-05-22 01:37:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-22 01:37:55,807 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:37:55,808 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:37:55,808 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-22 01:37:55,808 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:37:55,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:37:55,808 INFO L82 PathProgramCache]: Analyzing trace with hash 238912363, now seen corresponding path program 1 times [2021-05-22 01:37:55,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:37:55,809 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131090447] [2021-05-22 01:37:55,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:37:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:37:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:37:55,821 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:37:55,821 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131090447] [2021-05-22 01:37:55,822 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131090447] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:37:55,822 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:37:55,822 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-22 01:37:55,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410989480] [2021-05-22 01:37:55,822 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-22 01:37:55,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:37:55,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-22 01:37:55,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-22 01:37:55,823 INFO L87 Difference]: Start difference. First operand 403 states and 1343 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05-22 01:37:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:37:55,844 INFO L93 Difference]: Finished difference Result 511 states and 1701 transitions. [2021-05-22 01:37:55,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-22 01:37:55,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2021-05-22 01:37:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:37:55,847 INFO L225 Difference]: With dead ends: 511 [2021-05-22 01:37:55,847 INFO L226 Difference]: Without dead ends: 511 [2021-05-22 01:37:55,848 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-22 01:37:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-05-22 01:37:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 459. [2021-05-22 01:37:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 459 states have (on average 3.318082788671024) internal successors, (1523), 458 states have internal predecessors, (1523), 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-05-22 01:37:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1523 transitions. [2021-05-22 01:37:55,864 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 1523 transitions. Word has length 12 [2021-05-22 01:37:55,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:37:55,865 INFO L482 AbstractCegarLoop]: Abstraction has 459 states and 1523 transitions. [2021-05-22 01:37:55,865 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05-22 01:37:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 1523 transitions. [2021-05-22 01:37:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-22 01:37:55,867 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:37:55,867 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:37:55,867 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-22 01:37:55,867 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:37:55,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:37:55,868 INFO L82 PathProgramCache]: Analyzing trace with hash 514367808, now seen corresponding path program 1 times [2021-05-22 01:37:55,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:37:55,868 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918397758] [2021-05-22 01:37:55,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:37:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:37:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:37:55,885 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:37:55,886 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918397758] [2021-05-22 01:37:55,886 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918397758] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:37:55,886 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:37:55,886 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-22 01:37:55,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592383195] [2021-05-22 01:37:55,886 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-22 01:37:55,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:37:55,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-22 01:37:55,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-22 01:37:55,887 INFO L87 Difference]: Start difference. First operand 459 states and 1523 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-05-22 01:37:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:37:55,905 INFO L93 Difference]: Finished difference Result 531 states and 1759 transitions. [2021-05-22 01:37:55,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-22 01:37:55,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) Word has length 19 [2021-05-22 01:37:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:37:55,908 INFO L225 Difference]: With dead ends: 531 [2021-05-22 01:37:55,908 INFO L226 Difference]: Without dead ends: 531 [2021-05-22 01:37:55,908 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-22 01:37:55,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-05-22 01:37:55,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 507. [2021-05-22 01:37:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 507 states have (on average 3.3037475345167655) internal successors, (1675), 506 states have internal predecessors, (1675), 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-05-22 01:37:55,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1675 transitions. [2021-05-22 01:37:55,923 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1675 transitions. Word has length 19 [2021-05-22 01:37:55,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:37:55,923 INFO L482 AbstractCegarLoop]: Abstraction has 507 states and 1675 transitions. [2021-05-22 01:37:55,923 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-05-22 01:37:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1675 transitions. [2021-05-22 01:37:55,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-22 01:37:55,925 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:37:55,925 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:37:55,925 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-22 01:37:55,925 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:37:55,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:37:55,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1752452396, now seen corresponding path program 1 times [2021-05-22 01:37:55,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:37:55,926 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73205951] [2021-05-22 01:37:55,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:37:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:37:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:37:55,940 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:37:55,940 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73205951] [2021-05-22 01:37:55,940 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73205951] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:37:55,940 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:37:55,940 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-22 01:37:55,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448823547] [2021-05-22 01:37:55,941 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-22 01:37:55,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:37:55,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-22 01:37:55,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-22 01:37:55,942 INFO L87 Difference]: Start difference. First operand 507 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-05-22 01:37:55,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:37:55,962 INFO L93 Difference]: Finished difference Result 543 states and 1776 transitions. [2021-05-22 01:37:55,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-22 01:37:55,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) Word has length 19 [2021-05-22 01:37:55,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:37:55,964 INFO L225 Difference]: With dead ends: 543 [2021-05-22 01:37:55,965 INFO L226 Difference]: Without dead ends: 447 [2021-05-22 01:37:55,965 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-22 01:37:55,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-05-22 01:37:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 423. [2021-05-22 01:37:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 423 states have (on average 3.224586288416076) internal successors, (1364), 422 states have internal predecessors, (1364), 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-05-22 01:37:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1364 transitions. [2021-05-22 01:37:55,977 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1364 transitions. Word has length 19 [2021-05-22 01:37:55,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:37:55,978 INFO L482 AbstractCegarLoop]: Abstraction has 423 states and 1364 transitions. [2021-05-22 01:37:55,978 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-05-22 01:37:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1364 transitions. [2021-05-22 01:37:55,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-22 01:37:55,979 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:37:55,979 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:37:55,979 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-22 01:37:55,979 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:37:55,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:37:55,980 INFO L82 PathProgramCache]: Analyzing trace with hash 392965667, now seen corresponding path program 1 times [2021-05-22 01:37:55,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:37:55,980 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035153355] [2021-05-22 01:37:55,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:37:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:37:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:37:56,004 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:37:56,004 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035153355] [2021-05-22 01:37:56,004 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035153355] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:37:56,004 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:37:56,004 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-22 01:37:56,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406081355] [2021-05-22 01:37:56,005 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-22 01:37:56,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:37:56,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-22 01:37:56,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-22 01:37:56,005 INFO L87 Difference]: Start difference. First operand 423 states and 1364 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-05-22 01:37:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:37:56,029 INFO L93 Difference]: Finished difference Result 444 states and 1408 transitions. [2021-05-22 01:37:56,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-22 01:37:56,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) Word has length 26 [2021-05-22 01:37:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:37:56,032 INFO L225 Difference]: With dead ends: 444 [2021-05-22 01:37:56,032 INFO L226 Difference]: Without dead ends: 444 [2021-05-22 01:37:56,032 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-22 01:37:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-05-22 01:37:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2021-05-22 01:37:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 444 states have (on average 3.171171171171171) internal successors, (1408), 443 states have internal predecessors, (1408), 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-05-22 01:37:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1408 transitions. [2021-05-22 01:37:56,042 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1408 transitions. Word has length 26 [2021-05-22 01:37:56,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:37:56,042 INFO L482 AbstractCegarLoop]: Abstraction has 444 states and 1408 transitions. [2021-05-22 01:37:56,042 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-05-22 01:37:56,042 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1408 transitions. [2021-05-22 01:37:56,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-22 01:37:56,043 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:37:56,043 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:37:56,043 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-22 01:37:56,044 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:37:56,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:37:56,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1909628140, now seen corresponding path program 1 times [2021-05-22 01:37:56,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:37:56,044 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546714391] [2021-05-22 01:37:56,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:37:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-22 01:37:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-22 01:37:56,068 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-22 01:37:56,068 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546714391] [2021-05-22 01:37:56,068 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546714391] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-22 01:37:56,068 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-22 01:37:56,068 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-22 01:37:56,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456135976] [2021-05-22 01:37:56,069 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-22 01:37:56,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-22 01:37:56,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-22 01:37:56,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-22 01:37:56,070 INFO L87 Difference]: Start difference. First operand 444 states and 1408 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-05-22 01:37:56,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-22 01:37:56,093 INFO L93 Difference]: Finished difference Result 464 states and 1450 transitions. [2021-05-22 01:37:56,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-22 01:37:56,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) Word has length 27 [2021-05-22 01:37:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-22 01:37:56,095 INFO L225 Difference]: With dead ends: 464 [2021-05-22 01:37:56,095 INFO L226 Difference]: Without dead ends: 464 [2021-05-22 01:37:56,096 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-22 01:37:56,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-05-22 01:37:56,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2021-05-22 01:37:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 464 states have (on average 3.125) internal successors, (1450), 463 states have internal predecessors, (1450), 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-05-22 01:37:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1450 transitions. [2021-05-22 01:37:56,106 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1450 transitions. Word has length 27 [2021-05-22 01:37:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-22 01:37:56,106 INFO L482 AbstractCegarLoop]: Abstraction has 464 states and 1450 transitions. [2021-05-22 01:37:56,106 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-05-22 01:37:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1450 transitions. [2021-05-22 01:37:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-22 01:37:56,107 INFO L513 BasicCegarLoop]: Found error trace [2021-05-22 01:37:56,107 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-22 01:37:56,107 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-22 01:37:56,108 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT, Process1Err0ASSERT_VIOLATIONASSERT, Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-05-22 01:37:56,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-22 01:37:56,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1445736919, now seen corresponding path program 2 times [2021-05-22 01:37:56,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-22 01:37:56,108 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477815657] [2021-05-22 01:37:56,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-22 01:37:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-22 01:37:56,114 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-22 01:37:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-22 01:37:56,119 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-22 01:37:56,130 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-22 01:37:56,130 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-05-22 01:37:56,130 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-22 01:37:56,130 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (1/2) [2021-05-22 01:37:56,132 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-05-22 01:37:56,133 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-22 01:37:56,133 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-22 01:37:56,133 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-22 01:37:56,133 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-22 01:37:56,133 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-22 01:37:56,133 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-22 01:37:56,133 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-22 01:37:56,133 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-05-22 01:37:56,137 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 107 flow [2021-05-22 01:37:56,162 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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-05-22 01:37:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 1403 states, 1399 states have (on average 3.6125804145818443) internal successors, (5054), 1402 states have internal predecessors, (5054), 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-05-22 01:37:56,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-22 01:37:56,168 INFO L315 ceAbstractionStarter]: Result for error location InUseError was SAFE (2/2) [2021-05-22 01:37:56,168 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-05-22 01:37:56,178 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.05 01:37:56 BasicIcfg [2021-05-22 01:37:56,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-22 01:37:56,180 INFO L168 Benchmark]: Toolchain (without parser) took 1123.22 ms. Allocated memory is still 390.1 MB. Free memory was 369.8 MB in the beginning and 230.8 MB in the end (delta: 138.9 MB). Peak memory consumption was 140.4 MB. Max. memory is 16.0 GB. [2021-05-22 01:37:56,180 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.10 ms. Allocated memory is still 390.1 MB. Free memory was 370.9 MB in the beginning and 370.8 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-22 01:37:56,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.59 ms. Allocated memory is still 390.1 MB. Free memory was 369.7 MB in the beginning and 368.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-05-22 01:37:56,180 INFO L168 Benchmark]: Boogie Preprocessor took 14.02 ms. Allocated memory is still 390.1 MB. Free memory was 368.3 MB in the beginning and 367.2 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-22 01:37:56,181 INFO L168 Benchmark]: RCFGBuilder took 206.75 ms. Allocated memory is still 390.1 MB. Free memory was 367.2 MB in the beginning and 354.7 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. [2021-05-22 01:37:56,181 INFO L168 Benchmark]: TraceAbstraction took 879.94 ms. Allocated memory is still 390.1 MB. Free memory was 354.2 MB in the beginning and 230.8 MB in the end (delta: 123.4 MB). Peak memory consumption was 123.7 MB. Max. memory is 16.0 GB. [2021-05-22 01:37:56,182 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.10 ms. Allocated memory is still 390.1 MB. Free memory was 370.9 MB in the beginning and 370.8 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 18.59 ms. Allocated memory is still 390.1 MB. Free memory was 369.7 MB in the beginning and 368.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 14.02 ms. Allocated memory is still 390.1 MB. Free memory was 368.3 MB in the beginning and 367.2 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 206.75 ms. Allocated memory is still 390.1 MB. Free memory was 367.2 MB in the beginning and 354.7 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 879.94 ms. Allocated memory is still 390.1 MB. Free memory was 354.2 MB in the beginning and 230.8 MB in the end (delta: 123.4 MB). Peak memory consumption was 123.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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] [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] [L36] FORK 0 fork 2 Process2(); VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=2, critical=2, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=2, critical=2, deadline=2, deadline=1, delay=1, lock=2, wait=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 762.1ms, OverallIterations: 8, TraceHistogramMax: 2, EmptinessCheckTime: 15.6ms, AutomataDifference: 232.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 129.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 306 SDtfs, 147 SDslu, 169 SDs, 0 SdLazy, 86 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 74.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1403occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 133.0ms AutomataMinimizationTime, 7 MinimizatonAttempts, 224 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 8.1ms SsaConstructionTime, 35.1ms SatisfiabilityAnalysisTime, 99.4ms InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 34.8ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 5.3ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 28.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1403occurred 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...