/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.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 20:35:42,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 20:35:42,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 20:35:42,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 20:35:42,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 20:35:42,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 20:35:42,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 20:35:42,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 20:35:42,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 20:35:42,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 20:35:42,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 20:35:42,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 20:35:42,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 20:35:42,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 20:35:42,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 20:35:42,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 20:35:42,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 20:35:42,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 20:35:42,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 20:35:42,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 20:35:42,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 20:35:42,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 20:35:42,817 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 20:35:42,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 20:35:42,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 20:35:42,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 20:35:42,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 20:35:42,821 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 20:35:42,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 20:35:42,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 20:35:42,823 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 20:35:42,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 20:35:42,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 20:35:42,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 20:35:42,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 20:35:42,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 20:35:42,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 20:35:42,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 20:35:42,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 20:35:42,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 20:35:42,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 20:35:42,830 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.epf [2021-06-05 20:35:42,851 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 20:35:42,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 20:35:42,851 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 20:35:42,851 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 20:35:42,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 20:35:42,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 20:35:42,852 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 20:35:42,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 20:35:42,853 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 20:35:42,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 20:35:42,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 20:35:42,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 20:35:42,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 20:35:42,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 20:35:42,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 20:35:42,854 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 20:35:42,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 20:35:42,854 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 20:35:42,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 20:35:42,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 20:35:42,854 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 20:35:42,854 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 20:35:42,854 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 20:35:42,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 20:35:42,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 20:35:42,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 20:35:42,855 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 20:35:42,855 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 20:35:42,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 20:35:42,855 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 20:35:42,855 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 20:35:42,856 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 20:35:43,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 20:35:43,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 20:35:43,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 20:35:43,180 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 20:35:43,181 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 20:35:43,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl [2021-06-05 20:35:43,182 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-06-05 20:35:43,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 20:35:43,202 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 20:35:43,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 20:35:43,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 20:35:43,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 20:35:43,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 08:35:43" (1/1) ... [2021-06-05 20:35:43,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 08:35:43" (1/1) ... [2021-06-05 20:35:43,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 20:35:43,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 20:35:43,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 20:35:43,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 20:35:43,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 08:35:43" (1/1) ... [2021-06-05 20:35:43,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 08:35:43" (1/1) ... [2021-06-05 20:35:43,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 08:35:43" (1/1) ... [2021-06-05 20:35:43,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 08:35:43" (1/1) ... [2021-06-05 20:35:43,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 08:35:43" (1/1) ... [2021-06-05 20:35:43,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 08:35:43" (1/1) ... [2021-06-05 20:35:43,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 08:35:43" (1/1) ... [2021-06-05 20:35:43,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 20:35:43,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 20:35:43,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 20:35:43,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 20:35:43,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 08:35:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 20:35:43,313 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-06-05 20:35:43,314 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-06-05 20:35:43,314 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-06-05 20:35:43,314 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-06-05 20:35:43,314 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-06-05 20:35:43,314 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-06-05 20:35:43,314 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 20:35:43,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 20:35:43,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 20:35:43,315 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-06-05 20:35:43,315 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-06-05 20:35:43,315 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-06-05 20:35:43,316 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 20:35:43,457 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 20:35:43,457 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-05 20:35:43,459 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:35:43 BoogieIcfgContainer [2021-06-05 20:35:43,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 20:35:43,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 20:35:43,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 20:35:43,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 20:35:43,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 08:35:43" (1/2) ... [2021-06-05 20:35:43,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b88c8b and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:35:43, skipping insertion in model container [2021-06-05 20:35:43,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:35:43" (2/2) ... [2021-06-05 20:35:43,466 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-06-05 20:35:43,470 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 20:35:43,471 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 20:35:43,471 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 20:35:43,471 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 20:35:43,491 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,492 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,493 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,493 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,493 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,493 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,493 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,494 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,495 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,495 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,496 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,496 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,496 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,496 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,497 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,497 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,502 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,503 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 20:35:43,504 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 20:35:43,522 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 20:35:43,561 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 20:35:43,562 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 20:35:43,562 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 20:35:43,562 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 20:35:43,562 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 20:35:43,562 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 20:35:43,563 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 20:35:43,563 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2Thread1of1ForFork2======== [2021-06-05 20:35:43,571 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 107 flow [2021-06-05 20:35:43,751 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-06-05 20:35:43,756 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-06-05 20:35:43,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-06-05 20:35:43,766 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:43,766 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 20:35:43,767 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:43,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:43,775 INFO L82 PathProgramCache]: Analyzing trace with hash -618336958, now seen corresponding path program 1 times [2021-06-05 20:35:43,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:43,782 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390720904] [2021-06-05 20:35:43,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:35:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 20:35:43,887 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:35:43,888 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390720904] [2021-06-05 20:35:43,888 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390720904] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:35:43,889 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:35:43,889 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 20:35:43,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577725647] [2021-06-05 20:35:43,892 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 20:35:43,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:35:43,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 20:35:43,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:43,909 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.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:35:43,960 INFO L93 Difference]: Finished difference Result 398 states and 1386 transitions. [2021-06-05 20:35:43,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 20:35:43,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2021-06-05 20:35:43,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:35:43,980 INFO L225 Difference]: With dead ends: 398 [2021-06-05 20:35:43,980 INFO L226 Difference]: Without dead ends: 374 [2021-06-05 20:35:43,989 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:44,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-06-05 20:35:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 350. [2021-06-05 20:35:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 350 states have (on average 3.5314285714285716) internal successors, (1236), 349 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1236 transitions. [2021-06-05 20:35:44,079 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1236 transitions. Word has length 9 [2021-06-05 20:35:44,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:35:44,080 INFO L482 AbstractCegarLoop]: Abstraction has 350 states and 1236 transitions. [2021-06-05 20:35:44,080 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1236 transitions. [2021-06-05 20:35:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-06-05 20:35:44,082 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:44,082 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 20:35:44,082 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 20:35:44,083 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:44,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:44,083 INFO L82 PathProgramCache]: Analyzing trace with hash -372247321, now seen corresponding path program 1 times [2021-06-05 20:35:44,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:44,084 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997380811] [2021-06-05 20:35:44,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:35:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 20:35:44,106 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:35:44,106 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997380811] [2021-06-05 20:35:44,106 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997380811] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:35:44,107 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:35:44,107 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 20:35:44,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282949821] [2021-06-05 20:35:44,108 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 20:35:44,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:35:44,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 20:35:44,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:44,110 INFO L87 Difference]: Start difference. First operand 350 states and 1236 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-06-05 20:35:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:35:44,153 INFO L93 Difference]: Finished difference Result 569 states and 1978 transitions. [2021-06-05 20:35:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 20:35:44,154 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-06-05 20:35:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:35:44,158 INFO L225 Difference]: With dead ends: 569 [2021-06-05 20:35:44,158 INFO L226 Difference]: Without dead ends: 473 [2021-06-05 20:35:44,159 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-06-05 20:35:44,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 359. [2021-06-05 20:35:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 359 states have (on average 3.367688022284123) internal successors, (1209), 358 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1209 transitions. [2021-06-05 20:35:44,184 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1209 transitions. Word has length 12 [2021-06-05 20:35:44,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:35:44,184 INFO L482 AbstractCegarLoop]: Abstraction has 359 states and 1209 transitions. [2021-06-05 20:35:44,184 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-06-05 20:35:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1209 transitions. [2021-06-05 20:35:44,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-06-05 20:35:44,186 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:44,186 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 20:35:44,186 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 20:35:44,186 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:44,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:44,187 INFO L82 PathProgramCache]: Analyzing trace with hash 238928219, now seen corresponding path program 2 times [2021-06-05 20:35:44,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:44,187 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947726423] [2021-06-05 20:35:44,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:35:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 20:35:44,205 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:35:44,205 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947726423] [2021-06-05 20:35:44,205 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947726423] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:35:44,206 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:35:44,206 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 20:35:44,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407840809] [2021-06-05 20:35:44,206 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 20:35:44,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:35:44,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 20:35:44,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:44,208 INFO L87 Difference]: Start difference. First operand 359 states and 1209 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-06-05 20:35:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:35:44,234 INFO L93 Difference]: Finished difference Result 461 states and 1548 transitions. [2021-06-05 20:35:44,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 20:35:44,235 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-06-05 20:35:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:35:44,238 INFO L225 Difference]: With dead ends: 461 [2021-06-05 20:35:44,238 INFO L226 Difference]: Without dead ends: 461 [2021-06-05 20:35:44,239 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-06-05 20:35:44,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 415. [2021-06-05 20:35:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 415 states have (on average 3.346987951807229) internal successors, (1389), 414 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1389 transitions. [2021-06-05 20:35:44,269 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1389 transitions. Word has length 12 [2021-06-05 20:35:44,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:35:44,270 INFO L482 AbstractCegarLoop]: Abstraction has 415 states and 1389 transitions. [2021-06-05 20:35:44,271 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-06-05 20:35:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1389 transitions. [2021-06-05 20:35:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 20:35:44,277 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:44,277 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 20:35:44,277 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 20:35:44,278 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:44,278 INFO L82 PathProgramCache]: Analyzing trace with hash 514367808, now seen corresponding path program 1 times [2021-06-05 20:35:44,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:44,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014682886] [2021-06-05 20:35:44,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:35:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 20:35:44,321 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:35:44,321 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014682886] [2021-06-05 20:35:44,321 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014682886] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:35:44,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:35:44,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 20:35:44,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443650889] [2021-06-05 20:35:44,323 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 20:35:44,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:35:44,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 20:35:44,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:44,324 INFO L87 Difference]: Start difference. First operand 415 states and 1389 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-06-05 20:35:44,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:35:44,359 INFO L93 Difference]: Finished difference Result 487 states and 1625 transitions. [2021-06-05 20:35:44,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 20:35:44,359 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-06-05 20:35:44,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:35:44,363 INFO L225 Difference]: With dead ends: 487 [2021-06-05 20:35:44,363 INFO L226 Difference]: Without dead ends: 487 [2021-06-05 20:35:44,363 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2021-06-05 20:35:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 463. [2021-06-05 20:35:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 463 states have (on average 3.32829373650108) internal successors, (1541), 462 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1541 transitions. [2021-06-05 20:35:44,385 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1541 transitions. Word has length 19 [2021-06-05 20:35:44,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:35:44,385 INFO L482 AbstractCegarLoop]: Abstraction has 463 states and 1541 transitions. [2021-06-05 20:35:44,385 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-06-05 20:35:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1541 transitions. [2021-06-05 20:35:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 20:35:44,388 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:44,388 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 20:35:44,388 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 20:35:44,389 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:44,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:44,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1752436540, now seen corresponding path program 2 times [2021-06-05 20:35:44,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:44,390 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609378247] [2021-06-05 20:35:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:35:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 20:35:44,425 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:35:44,425 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609378247] [2021-06-05 20:35:44,425 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609378247] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:35:44,425 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:35:44,425 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 20:35:44,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903052364] [2021-06-05 20:35:44,426 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 20:35:44,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:35:44,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 20:35:44,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:44,428 INFO L87 Difference]: Start difference. First operand 463 states and 1541 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-06-05 20:35:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:35:44,462 INFO L93 Difference]: Finished difference Result 499 states and 1644 transitions. [2021-06-05 20:35:44,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 20:35:44,462 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-06-05 20:35:44,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:35:44,465 INFO L225 Difference]: With dead ends: 499 [2021-06-05 20:35:44,465 INFO L226 Difference]: Without dead ends: 403 [2021-06-05 20:35:44,466 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:44,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-06-05 20:35:44,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 379. [2021-06-05 20:35:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 379 states have (on average 3.2506596306068603) internal successors, (1232), 378 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1232 transitions. [2021-06-05 20:35:44,482 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1232 transitions. Word has length 19 [2021-06-05 20:35:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:35:44,483 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1232 transitions. [2021-06-05 20:35:44,483 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-06-05 20:35:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1232 transitions. [2021-06-05 20:35:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-06-05 20:35:44,485 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:44,485 INFO L554 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-06-05 20:35:44,485 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 20:35:44,485 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:44,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:44,486 INFO L82 PathProgramCache]: Analyzing trace with hash 392981523, now seen corresponding path program 1 times [2021-06-05 20:35:44,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:44,487 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349163948] [2021-06-05 20:35:44,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:35:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 20:35:44,544 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:35:44,545 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349163948] [2021-06-05 20:35:44,545 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349163948] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:35:44,545 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:35:44,545 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 20:35:44,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645001996] [2021-06-05 20:35:44,546 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 20:35:44,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:35:44,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 20:35:44,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 20:35:44,547 INFO L87 Difference]: Start difference. First operand 379 states and 1232 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-06-05 20:35:44,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:35:44,574 INFO L93 Difference]: Finished difference Result 398 states and 1271 transitions. [2021-06-05 20:35:44,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 20:35:44,575 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-06-05 20:35:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:35:44,578 INFO L225 Difference]: With dead ends: 398 [2021-06-05 20:35:44,578 INFO L226 Difference]: Without dead ends: 398 [2021-06-05 20:35:44,578 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 20:35:44,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-06-05 20:35:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2021-06-05 20:35:44,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 398 states have (on average 3.193467336683417) internal successors, (1271), 397 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1271 transitions. [2021-06-05 20:35:44,591 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1271 transitions. Word has length 26 [2021-06-05 20:35:44,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:35:44,591 INFO L482 AbstractCegarLoop]: Abstraction has 398 states and 1271 transitions. [2021-06-05 20:35:44,591 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-06-05 20:35:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1271 transitions. [2021-06-05 20:35:44,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-06-05 20:35:44,592 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:44,592 INFO L554 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-06-05 20:35:44,593 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 20:35:44,593 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:44,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:44,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1909612284, now seen corresponding path program 1 times [2021-06-05 20:35:44,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:44,594 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192830200] [2021-06-05 20:35:44,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:35:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 20:35:44,623 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:35:44,623 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192830200] [2021-06-05 20:35:44,623 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192830200] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:35:44,623 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:35:44,623 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 20:35:44,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159428051] [2021-06-05 20:35:44,624 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 20:35:44,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:35:44,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 20:35:44,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 20:35:44,624 INFO L87 Difference]: Start difference. First operand 398 states and 1271 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-06-05 20:35:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:35:44,649 INFO L93 Difference]: Finished difference Result 416 states and 1310 transitions. [2021-06-05 20:35:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 20:35:44,650 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-06-05 20:35:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:35:44,652 INFO L225 Difference]: With dead ends: 416 [2021-06-05 20:35:44,652 INFO L226 Difference]: Without dead ends: 416 [2021-06-05 20:35:44,652 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 20:35:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-06-05 20:35:44,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2021-06-05 20:35:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 416 states have (on average 3.1490384615384617) internal successors, (1310), 415 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1310 transitions. [2021-06-05 20:35:44,664 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1310 transitions. Word has length 27 [2021-06-05 20:35:44,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:35:44,665 INFO L482 AbstractCegarLoop]: Abstraction has 416 states and 1310 transitions. [2021-06-05 20:35:44,665 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-06-05 20:35:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1310 transitions. [2021-06-05 20:35:44,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-06-05 20:35:44,666 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:44,666 INFO L554 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-06-05 20:35:44,666 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 20:35:44,666 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:44,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:44,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1445752775, now seen corresponding path program 2 times [2021-06-05 20:35:44,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:44,667 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808754826] [2021-06-05 20:35:44,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 20:35:44,676 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 20:35:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 20:35:44,682 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 20:35:44,696 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 20:35:44,696 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 20:35:44,697 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 20:35:44,697 INFO L301 ceAbstractionStarter]: Result for error location Process2Thread1of1ForFork2 was UNSAFE (1/5) [2021-06-05 20:35:44,699 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 20:35:44,700 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 20:35:44,700 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 20:35:44,700 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 20:35:44,700 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 20:35:44,700 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 20:35:44,700 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 20:35:44,701 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 20:35:44,701 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2======== [2021-06-05 20:35:44,702 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 107 flow [2021-06-05 20:35:44,736 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-06-05 20:35:44,739 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-06-05 20:35:44,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 20:35:44,745 INFO L301 ceAbstractionStarter]: Result for error location Process2 was SAFE (2/5) [2021-06-05 20:35:44,746 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 20:35:44,747 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 20:35:44,747 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 20:35:44,747 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 20:35:44,747 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 20:35:44,747 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 20:35:44,747 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 20:35:44,747 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 20:35:44,747 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1======== [2021-06-05 20:35:44,749 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 107 flow [2021-06-05 20:35:44,782 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-06-05 20:35:44,785 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-06-05 20:35:44,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 20:35:44,790 INFO L301 ceAbstractionStarter]: Result for error location Process1 was SAFE (3/5) [2021-06-05 20:35:44,791 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 20:35:44,791 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 20:35:44,791 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 20:35:44,792 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 20:35:44,792 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 20:35:44,792 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 20:35:44,792 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 20:35:44,792 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 20:35:44,792 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 20:35:44,793 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 107 flow [2021-06-05 20:35:44,827 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-06-05 20:35:44,830 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-06-05 20:35:44,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 20:35:44,835 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (4/5) [2021-06-05 20:35:44,836 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 20:35:44,836 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 20:35:44,837 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 20:35:44,837 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 20:35:44,837 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 20:35:44,837 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 20:35:44,837 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 20:35:44,837 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 20:35:44,837 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1Thread1of1ForFork1======== [2021-06-05 20:35:44,838 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 107 flow [2021-06-05 20:35:44,872 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-06-05 20:35:44,876 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-06-05 20:35:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-06-05 20:35:44,876 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:44,876 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 20:35:44,877 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:44,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:44,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1128325677, now seen corresponding path program 1 times [2021-06-05 20:35:44,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:44,877 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736707927] [2021-06-05 20:35:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:35:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 20:35:44,887 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:35:44,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736707927] [2021-06-05 20:35:44,888 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736707927] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:35:44,888 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:35:44,888 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-05 20:35:44,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47209950] [2021-06-05 20:35:44,888 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 20:35:44,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:35:44,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 20:35:44,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:44,893 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-06-05 20:35:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:35:44,909 INFO L93 Difference]: Finished difference Result 398 states and 1386 transitions. [2021-06-05 20:35:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 20:35:44,910 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-06-05 20:35:44,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:35:44,912 INFO L225 Difference]: With dead ends: 398 [2021-06-05 20:35:44,912 INFO L226 Difference]: Without dead ends: 374 [2021-06-05 20:35:44,912 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:44,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-06-05 20:35:44,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 350. [2021-06-05 20:35:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 350 states have (on average 3.5314285714285716) internal successors, (1236), 349 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1236 transitions. [2021-06-05 20:35:44,924 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1236 transitions. Word has length 8 [2021-06-05 20:35:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:35:44,924 INFO L482 AbstractCegarLoop]: Abstraction has 350 states and 1236 transitions. [2021-06-05 20:35:44,924 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-06-05 20:35:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1236 transitions. [2021-06-05 20:35:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-06-05 20:35:44,925 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:44,925 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 20:35:44,925 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 20:35:44,925 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:44,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:44,926 INFO L82 PathProgramCache]: Analyzing trace with hash -356311817, now seen corresponding path program 1 times [2021-06-05 20:35:44,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:44,926 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049734033] [2021-06-05 20:35:44,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:35:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 20:35:44,937 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:35:44,937 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049734033] [2021-06-05 20:35:44,938 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049734033] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:35:44,938 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:35:44,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 20:35:44,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18787426] [2021-06-05 20:35:44,938 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 20:35:44,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:35:44,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 20:35:44,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:44,939 INFO L87 Difference]: Start difference. First operand 350 states and 1236 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-06-05 20:35:44,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:35:44,974 INFO L93 Difference]: Finished difference Result 569 states and 1978 transitions. [2021-06-05 20:35:44,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 20:35:44,975 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-06-05 20:35:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:35:44,978 INFO L225 Difference]: With dead ends: 569 [2021-06-05 20:35:44,978 INFO L226 Difference]: Without dead ends: 473 [2021-06-05 20:35:44,978 INFO L810 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-06-05 20:35:44,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-06-05 20:35:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 359. [2021-06-05 20:35:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 359 states have (on average 3.367688022284123) internal successors, (1209), 358 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1209 transitions. [2021-06-05 20:35:44,991 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1209 transitions. Word has length 12 [2021-06-05 20:35:44,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:35:44,991 INFO L482 AbstractCegarLoop]: Abstraction has 359 states and 1209 transitions. [2021-06-05 20:35:44,991 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-06-05 20:35:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1209 transitions. [2021-06-05 20:35:44,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-06-05 20:35:44,992 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:44,992 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 20:35:44,992 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 20:35:44,992 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:44,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:44,993 INFO L82 PathProgramCache]: Analyzing trace with hash 238912363, now seen corresponding path program 2 times [2021-06-05 20:35:44,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:44,993 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422279309] [2021-06-05 20:35:44,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:35:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 20:35:45,017 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:35:45,017 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422279309] [2021-06-05 20:35:45,018 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422279309] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:35:45,018 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:35:45,018 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 20:35:45,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036500558] [2021-06-05 20:35:45,018 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 20:35:45,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:35:45,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 20:35:45,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:45,020 INFO L87 Difference]: Start difference. First operand 359 states and 1209 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-06-05 20:35:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:35:45,041 INFO L93 Difference]: Finished difference Result 461 states and 1548 transitions. [2021-06-05 20:35:45,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 20:35:45,041 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-06-05 20:35:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:35:45,045 INFO L225 Difference]: With dead ends: 461 [2021-06-05 20:35:45,046 INFO L226 Difference]: Without dead ends: 461 [2021-06-05 20:35:45,046 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:45,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-06-05 20:35:45,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 415. [2021-06-05 20:35:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 415 states have (on average 3.346987951807229) internal successors, (1389), 414 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1389 transitions. [2021-06-05 20:35:45,070 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1389 transitions. Word has length 12 [2021-06-05 20:35:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:35:45,070 INFO L482 AbstractCegarLoop]: Abstraction has 415 states and 1389 transitions. [2021-06-05 20:35:45,070 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-06-05 20:35:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1389 transitions. [2021-06-05 20:35:45,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 20:35:45,073 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:45,073 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 20:35:45,073 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 20:35:45,073 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:45,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:45,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1239295116, now seen corresponding path program 1 times [2021-06-05 20:35:45,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:45,075 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101527898] [2021-06-05 20:35:45,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:35:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 20:35:45,105 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:35:45,106 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101527898] [2021-06-05 20:35:45,106 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101527898] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:35:45,106 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:35:45,106 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 20:35:45,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754075159] [2021-06-05 20:35:45,107 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 20:35:45,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:35:45,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 20:35:45,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:45,107 INFO L87 Difference]: Start difference. First operand 415 states and 1389 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-06-05 20:35:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:35:45,130 INFO L93 Difference]: Finished difference Result 487 states and 1625 transitions. [2021-06-05 20:35:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 20:35:45,144 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-06-05 20:35:45,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:35:45,147 INFO L225 Difference]: With dead ends: 487 [2021-06-05 20:35:45,147 INFO L226 Difference]: Without dead ends: 487 [2021-06-05 20:35:45,147 INFO L810 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-06-05 20:35:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2021-06-05 20:35:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 463. [2021-06-05 20:35:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 463 states have (on average 3.32829373650108) internal successors, (1541), 462 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1541 transitions. [2021-06-05 20:35:45,180 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1541 transitions. Word has length 19 [2021-06-05 20:35:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:35:45,181 INFO L482 AbstractCegarLoop]: Abstraction has 463 states and 1541 transitions. [2021-06-05 20:35:45,181 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-06-05 20:35:45,181 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1541 transitions. [2021-06-05 20:35:45,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 20:35:45,183 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:45,183 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 20:35:45,183 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 20:35:45,183 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:45,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:45,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1752452396, now seen corresponding path program 2 times [2021-06-05 20:35:45,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:45,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270370038] [2021-06-05 20:35:45,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:35:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 20:35:45,210 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:35:45,210 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270370038] [2021-06-05 20:35:45,210 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270370038] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:35:45,210 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:35:45,210 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 20:35:45,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890472065] [2021-06-05 20:35:45,211 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 20:35:45,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:35:45,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 20:35:45,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 20:35:45,211 INFO L87 Difference]: Start difference. First operand 463 states and 1541 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-06-05 20:35:45,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:35:45,231 INFO L93 Difference]: Finished difference Result 499 states and 1644 transitions. [2021-06-05 20:35:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 20:35:45,231 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-06-05 20:35:45,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:35:45,234 INFO L225 Difference]: With dead ends: 499 [2021-06-05 20:35:45,234 INFO L226 Difference]: Without dead ends: 403 [2021-06-05 20:35:45,234 INFO L810 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-06-05 20:35:45,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-06-05 20:35:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 379. [2021-06-05 20:35:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 379 states have (on average 3.2506596306068603) internal successors, (1232), 378 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1232 transitions. [2021-06-05 20:35:45,245 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1232 transitions. Word has length 19 [2021-06-05 20:35:45,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:35:45,245 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1232 transitions. [2021-06-05 20:35:45,245 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-06-05 20:35:45,245 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1232 transitions. [2021-06-05 20:35:45,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-06-05 20:35:45,246 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:45,246 INFO L554 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-06-05 20:35:45,246 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 20:35:45,246 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:45,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:45,246 INFO L82 PathProgramCache]: Analyzing trace with hash 392965667, now seen corresponding path program 1 times [2021-06-05 20:35:45,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:45,247 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007968673] [2021-06-05 20:35:45,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:35:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 20:35:45,285 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:35:45,285 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007968673] [2021-06-05 20:35:45,285 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007968673] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:35:45,286 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:35:45,286 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 20:35:45,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284156744] [2021-06-05 20:35:45,286 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 20:35:45,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:35:45,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 20:35:45,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 20:35:45,287 INFO L87 Difference]: Start difference. First operand 379 states and 1232 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-06-05 20:35:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:35:45,314 INFO L93 Difference]: Finished difference Result 398 states and 1273 transitions. [2021-06-05 20:35:45,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 20:35:45,315 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-06-05 20:35:45,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:35:45,317 INFO L225 Difference]: With dead ends: 398 [2021-06-05 20:35:45,317 INFO L226 Difference]: Without dead ends: 398 [2021-06-05 20:35:45,317 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 20:35:45,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-06-05 20:35:45,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2021-06-05 20:35:45,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 398 states have (on average 3.198492462311558) internal successors, (1273), 397 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1273 transitions. [2021-06-05 20:35:45,328 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1273 transitions. Word has length 26 [2021-06-05 20:35:45,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:35:45,328 INFO L482 AbstractCegarLoop]: Abstraction has 398 states and 1273 transitions. [2021-06-05 20:35:45,328 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-06-05 20:35:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1273 transitions. [2021-06-05 20:35:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-06-05 20:35:45,330 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:45,330 INFO L554 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-06-05 20:35:45,330 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 20:35:45,330 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:45,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:45,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1909628140, now seen corresponding path program 1 times [2021-06-05 20:35:45,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:45,332 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284562981] [2021-06-05 20:35:45,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 20:35:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 20:35:45,383 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 20:35:45,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284562981] [2021-06-05 20:35:45,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284562981] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 20:35:45,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 20:35:45,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 20:35:45,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752408464] [2021-06-05 20:35:45,384 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 20:35:45,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 20:35:45,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 20:35:45,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 20:35:45,384 INFO L87 Difference]: Start difference. First operand 398 states and 1273 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-06-05 20:35:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 20:35:45,409 INFO L93 Difference]: Finished difference Result 416 states and 1310 transitions. [2021-06-05 20:35:45,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 20:35:45,410 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-06-05 20:35:45,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 20:35:45,412 INFO L225 Difference]: With dead ends: 416 [2021-06-05 20:35:45,412 INFO L226 Difference]: Without dead ends: 416 [2021-06-05 20:35:45,412 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 20:35:45,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-06-05 20:35:45,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2021-06-05 20:35:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 416 states have (on average 3.1490384615384617) internal successors, (1310), 415 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 20:35:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1310 transitions. [2021-06-05 20:35:45,423 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1310 transitions. Word has length 27 [2021-06-05 20:35:45,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 20:35:45,425 INFO L482 AbstractCegarLoop]: Abstraction has 416 states and 1310 transitions. [2021-06-05 20:35:45,425 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-06-05 20:35:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1310 transitions. [2021-06-05 20:35:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-06-05 20:35:45,426 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 20:35:45,426 INFO L554 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-06-05 20:35:45,426 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 20:35:45,426 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-05 20:35:45,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 20:35:45,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1445736919, now seen corresponding path program 2 times [2021-06-05 20:35:45,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 20:35:45,428 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21721453] [2021-06-05 20:35:45,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 20:35:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 20:35:45,437 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 20:35:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 20:35:45,444 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 20:35:45,450 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 20:35:45,451 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 20:35:45,452 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 20:35:45,452 INFO L301 ceAbstractionStarter]: Result for error location Process1Thread1of1ForFork1 was UNSAFE (5/5) [2021-06-05 20:35:45,452 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 20:35:45,486 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 08:35:45 BasicIcfg [2021-06-05 20:35:45,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 20:35:45,487 INFO L168 Benchmark]: Toolchain (without parser) took 2285.31 ms. Allocated memory is still 367.0 MB. Free memory was 346.9 MB in the beginning and 291.2 MB in the end (delta: 55.7 MB). Peak memory consumption was 56.4 MB. Max. memory is 16.0 GB. [2021-06-05 20:35:45,488 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.12 ms. Allocated memory is still 367.0 MB. Free memory was 347.9 MB in the beginning and 347.9 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 20:35:45,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.53 ms. Allocated memory is still 367.0 MB. Free memory was 346.7 MB in the beginning and 345.3 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 20:35:45,488 INFO L168 Benchmark]: Boogie Preprocessor took 19.24 ms. Allocated memory is still 367.0 MB. Free memory was 345.3 MB in the beginning and 344.3 MB in the end (delta: 972.3 kB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 20:35:45,488 INFO L168 Benchmark]: RCFGBuilder took 210.89 ms. Allocated memory is still 367.0 MB. Free memory was 344.3 MB in the beginning and 331.8 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. [2021-06-05 20:35:45,489 INFO L168 Benchmark]: TraceAbstraction took 2026.02 ms. Allocated memory is still 367.0 MB. Free memory was 331.3 MB in the beginning and 291.2 MB in the end (delta: 40.1 MB). Peak memory consumption was 39.7 MB. Max. memory is 16.0 GB. [2021-06-05 20:35:45,490 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.12 ms. Allocated memory is still 367.0 MB. Free memory was 347.9 MB in the beginning and 347.9 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 23.53 ms. Allocated memory is still 367.0 MB. Free memory was 346.7 MB in the beginning and 345.3 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 19.24 ms. Allocated memory is still 367.0 MB. Free memory was 345.3 MB in the beginning and 344.3 MB in the end (delta: 972.3 kB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 210.89 ms. Allocated memory is still 367.0 MB. Free memory was 344.3 MB in the beginning and 331.8 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 2026.02 ms. Allocated memory is still 367.0 MB. Free memory was 331.3 MB in the beginning and 291.2 MB in the end (delta: 40.1 MB). Peak memory consumption was 39.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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] [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] [L66] 2 assert critical == 0; VAL [clk=2, critical=0, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=2, critical=1, deadline=2, deadline=1, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=2, critical=1, deadline=2, deadline=1, delay=1, lock=2, wait=1] - CounterExampleResult [Line: 66]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [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 for errors in thread instance: Process2Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1137.5ms, OverallIterations: 8, TraceHistogramMax: 2, EmptinessCheckTime: 28.0ms, AutomataDifference: 317.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 188.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 300 SDtfs, 141 SDslu, 164 SDs, 0 SdLazy, 86 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 108.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.7ms 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: 194.7ms AutomataMinimizationTime, 7 MinimizatonAttempts, 232 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 18.4ms SsaConstructionTime, 80.6ms SatisfiabilityAnalysisTime, 152.1ms InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 229 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 errors in thread instance: Process2 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 44.7ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 8.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 35.9ms, 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process1 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 43.3ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 7.3ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 35.0ms, 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 43.9ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 7.8ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 35.2ms, 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process1Thread1of1ForFork1 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 615.7ms, OverallIterations: 8, TraceHistogramMax: 2, EmptinessCheckTime: 12.1ms, AutomataDifference: 214.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 35.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 300 SDtfs, 146 SDslu, 164 SDs, 0 SdLazy, 86 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 89.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.0ms 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: 111.6ms AutomataMinimizationTime, 7 MinimizatonAttempts, 232 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 13.7ms SsaConstructionTime, 49.7ms SatisfiabilityAnalysisTime, 114.6ms InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 218 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...