/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:31:11,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:31:11,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:31:11,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:31:11,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:31:11,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:31:11,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:31:11,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:31:11,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:31:11,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:31:11,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:31:11,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:31:11,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:31:11,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:31:11,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:31:11,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:31:11,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:31:11,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:31:11,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:31:11,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:31:11,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:31:11,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:31:11,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:31:11,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:31:11,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:31:11,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:31:11,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:31:11,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:31:11,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:31:11,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:31:11,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:31:11,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:31:11,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:31:11,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:31:11,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:31:11,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:31:11,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:31:11,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:31:11,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:31:11,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:31:11,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:31:11,665 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-PN-SemanticLbe.epf [2020-10-16 01:31:11,687 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:31:11,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:31:11,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:31:11,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:31:11,689 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:31:11,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:31:11,689 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:31:11,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:31:11,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:31:11,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:31:11,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:31:11,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:31:11,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:31:11,690 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:31:11,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:31:11,691 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:31:11,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:31:11,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:31:11,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:31:11,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:31:11,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:31:11,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:31:11,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:31:11,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:31:11,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:31:11,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:31:11,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:31:11,693 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:31:11,694 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:31:12,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:31:12,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:31:12,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:31:12,027 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:31:12,027 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:31:12,028 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i [2020-10-16 01:31:12,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5677bd96/bc0b249d44204c39b8971ed41288d177/FLAG1c0f84ad8 [2020-10-16 01:31:12,631 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:31:12,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i [2020-10-16 01:31:12,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5677bd96/bc0b249d44204c39b8971ed41288d177/FLAG1c0f84ad8 [2020-10-16 01:31:12,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5677bd96/bc0b249d44204c39b8971ed41288d177 [2020-10-16 01:31:12,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:31:12,861 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:31:12,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:31:12,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:31:12,865 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:31:12,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:31:12" (1/1) ... [2020-10-16 01:31:12,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a114ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:12, skipping insertion in model container [2020-10-16 01:31:12,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:31:12" (1/1) ... [2020-10-16 01:31:12,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:31:12,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:31:13,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:31:13,400 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:31:13,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:31:13,631 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:31:13,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:13 WrapperNode [2020-10-16 01:31:13,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:31:13,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:31:13,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:31:13,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:31:13,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:13" (1/1) ... [2020-10-16 01:31:13,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:13" (1/1) ... [2020-10-16 01:31:13,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:31:13,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:31:13,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:31:13,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:31:13,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:13" (1/1) ... [2020-10-16 01:31:13,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:13" (1/1) ... [2020-10-16 01:31:13,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:13" (1/1) ... [2020-10-16 01:31:13,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:13" (1/1) ... [2020-10-16 01:31:13,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:13" (1/1) ... [2020-10-16 01:31:13,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:13" (1/1) ... [2020-10-16 01:31:13,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:13" (1/1) ... [2020-10-16 01:31:13,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:31:13,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:31:13,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:31:13,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:31:13,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:13" (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 [2020-10-16 01:31:13,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:31:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:31:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:31:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:31:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:31:13,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:31:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:31:13,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:31:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:31:13,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:31:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 01:31:13,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 01:31:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:31:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:31:13,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:31:13,837 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:31:15,782 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:31:15,782 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:31:15,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:31:15 BoogieIcfgContainer [2020-10-16 01:31:15,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:31:15,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:31:15,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:31:15,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:31:15,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:31:12" (1/3) ... [2020-10-16 01:31:15,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5901814f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:31:15, skipping insertion in model container [2020-10-16 01:31:15,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:13" (2/3) ... [2020-10-16 01:31:15,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5901814f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:31:15, skipping insertion in model container [2020-10-16 01:31:15,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:31:15" (3/3) ... [2020-10-16 01:31:15,794 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.opt.i [2020-10-16 01:31:15,807 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:31:15,815 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:31:15,816 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:31:15,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,848 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,848 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,849 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,850 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,853 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,853 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,853 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,854 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,855 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,855 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,855 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,855 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,855 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,862 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,863 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,869 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,869 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,871 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,871 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,874 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,875 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,878 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,878 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:15,897 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 01:31:15,919 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:31:15,919 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:31:15,919 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:31:15,919 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:31:15,919 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:31:15,919 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:31:15,920 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:31:15,920 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:31:15,935 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-16 01:31:15,984 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-16 01:31:15,984 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:31:15,989 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 01:31:15,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 107 transitions, 234 flow [2020-10-16 01:31:15,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 103 transitions, 218 flow [2020-10-16 01:31:15,999 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:31:16,002 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 103 transitions, 218 flow [2020-10-16 01:31:16,005 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 103 transitions, 218 flow [2020-10-16 01:31:16,006 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 114 places, 103 transitions, 218 flow [2020-10-16 01:31:16,031 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-16 01:31:16,032 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:31:16,033 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 01:31:16,036 INFO L117 LiptonReduction]: Number of co-enabled transitions 2352 [2020-10-16 01:31:16,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:16,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:16,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:16,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:16,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:16,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:16,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:16,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:16,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:16,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:16,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:16,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:16,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:16,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:16,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:16,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:16,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:16,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:16,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:16,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:16,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:16,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:16,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:16,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:17,659 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 01:31:17,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 01:31:17,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:17,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:17,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:18,976 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 01:31:19,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:31:19,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:19,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:19,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:19,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:19,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:19,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:19,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:19,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:19,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:19,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:19,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:19,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:19,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:19,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:19,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:19,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:19,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:19,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:19,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:19,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:19,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:19,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:19,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:19,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:19,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:19,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:19,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:19,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:19,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:19,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:19,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:19,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:19,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:19,610 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 01:31:19,967 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:31:20,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:20,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:20,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:31:20,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:20,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:20,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:20,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:20,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:20,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:20,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:20,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:21,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:21,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:21,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:31:21,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:21,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:21,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:21,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:21,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:21,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:21,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:21,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:21,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:21,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:21,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:21,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:21,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:21,624 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 01:31:22,058 WARN L193 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 01:31:22,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:22,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:22,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:22,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:22,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:22,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:22,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:31:22,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:22,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:22,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:22,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:22,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:22,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:22,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:22,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:22,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:22,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:22,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:22,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:22,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:22,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:22,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:22,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:22,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:22,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:22,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:22,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:22,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:22,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:31:22,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:22,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:22,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:22,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:22,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:22,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:22,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:22,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:22,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:22,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:22,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:22,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:22,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:22,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:22,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:23,543 WARN L193 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-16 01:31:23,937 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 01:31:24,635 WARN L193 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 109 [2020-10-16 01:31:24,942 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-16 01:31:24,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:31:24,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:25,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:31:25,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:25,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:25,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:25,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:25,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:25,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:25,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:25,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:31:25,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:25,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:25,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:25,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:25,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:25,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:25,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:25,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:25,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:25,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:25,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:25,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:25,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:25,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:25,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:25,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:25,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:25,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:31:25,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:25,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:25,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:25,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:25,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:25,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:25,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:25,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:25,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:25,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:25,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:25,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:25,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:25,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:25,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:25,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:25,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:25,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:25,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:25,923 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 01:31:26,301 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-10-16 01:31:26,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:26,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:26,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:26,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:26,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:26,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:26,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:26,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:26,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:26,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:26,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:26,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:26,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:26,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:26,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:26,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:26,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:26,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:26,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:26,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:26,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:26,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:26,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:26,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:26,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:26,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:26,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:26,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:26,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:26,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:26,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:26,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:26,886 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-16 01:31:27,019 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 01:31:27,064 INFO L132 LiptonReduction]: Checked pairs total: 6523 [2020-10-16 01:31:27,064 INFO L134 LiptonReduction]: Total number of compositions: 87 [2020-10-16 01:31:27,067 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11070 [2020-10-16 01:31:27,077 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2020-10-16 01:31:27,077 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:31:27,078 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:27,079 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:27,079 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:27,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:27,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1680903237, now seen corresponding path program 1 times [2020-10-16 01:31:27,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:27,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534155472] [2020-10-16 01:31:27,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:27,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534155472] [2020-10-16 01:31:27,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:27,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:31:27,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301308237] [2020-10-16 01:31:27,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:31:27,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:27,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:31:27,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:31:27,462 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 194 [2020-10-16 01:31:27,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states. [2020-10-16 01:31:27,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:27,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 194 [2020-10-16 01:31:27,467 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:27,559 INFO L129 PetriNetUnfolder]: 23/69 cut-off events. [2020-10-16 01:31:27,560 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:31:27,560 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 69 events. 23/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 217 event pairs, 9 based on Foata normal form. 6/69 useless extension candidates. Maximal degree in co-relation 119. Up to 37 conditions per place. [2020-10-16 01:31:27,562 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 7 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2020-10-16 01:31:27,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 94 flow [2020-10-16 01:31:27,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:31:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:31:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2020-10-16 01:31:27,582 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8487972508591065 [2020-10-16 01:31:27,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2020-10-16 01:31:27,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2020-10-16 01:31:27,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:27,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2020-10-16 01:31:27,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:31:27,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:31:27,601 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:31:27,604 INFO L185 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 494 transitions. [2020-10-16 01:31:27,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 94 flow [2020-10-16 01:31:27,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 90 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 01:31:27,611 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2020-10-16 01:31:27,614 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2020-10-16 01:31:27,615 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2020-10-16 01:31:27,615 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2020-10-16 01:31:27,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:31:27,615 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:27,615 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:27,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:31:27,616 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:27,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:27,616 INFO L82 PathProgramCache]: Analyzing trace with hash 440307498, now seen corresponding path program 1 times [2020-10-16 01:31:27,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:27,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290400079] [2020-10-16 01:31:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:27,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290400079] [2020-10-16 01:31:27,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:27,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:31:27,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569534322] [2020-10-16 01:31:27,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:31:27,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:27,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:31:27,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:31:27,720 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2020-10-16 01:31:27,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states. [2020-10-16 01:31:27,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:27,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2020-10-16 01:31:27,721 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:27,742 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2020-10-16 01:31:27,742 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:31:27,743 INFO L80 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 51. Up to 10 conditions per place. [2020-10-16 01:31:27,743 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 3 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2020-10-16 01:31:27,743 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 78 flow [2020-10-16 01:31:27,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:31:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:31:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2020-10-16 01:31:27,747 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8625429553264605 [2020-10-16 01:31:27,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2020-10-16 01:31:27,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2020-10-16 01:31:27,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:27,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2020-10-16 01:31:27,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:31:27,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:31:27,752 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:31:27,752 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 502 transitions. [2020-10-16 01:31:27,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 78 flow [2020-10-16 01:31:27,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:31:27,754 INFO L241 Difference]: Finished difference. Result has 37 places, 27 transitions, 77 flow [2020-10-16 01:31:27,754 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2020-10-16 01:31:27,755 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2020-10-16 01:31:27,755 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2020-10-16 01:31:27,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:31:27,755 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:27,755 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:27,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:31:27,756 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:27,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:27,756 INFO L82 PathProgramCache]: Analyzing trace with hash 764630339, now seen corresponding path program 1 times [2020-10-16 01:31:27,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:27,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674553718] [2020-10-16 01:31:27,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:27,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674553718] [2020-10-16 01:31:27,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:27,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:31:27,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377037100] [2020-10-16 01:31:27,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:31:27,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:27,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:31:27,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:31:27,863 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2020-10-16 01:31:27,864 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 77 flow. Second operand 3 states. [2020-10-16 01:31:27,864 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:27,864 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2020-10-16 01:31:27,864 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:27,909 INFO L129 PetriNetUnfolder]: 10/58 cut-off events. [2020-10-16 01:31:27,910 INFO L130 PetriNetUnfolder]: For 8/17 co-relation queries the response was YES. [2020-10-16 01:31:27,910 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 58 events. 10/58 cut-off events. For 8/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 173 event pairs, 3 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 97. Up to 19 conditions per place. [2020-10-16 01:31:27,911 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2020-10-16 01:31:27,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 93 flow [2020-10-16 01:31:27,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:31:27,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:31:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2020-10-16 01:31:27,915 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8625429553264605 [2020-10-16 01:31:27,915 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2020-10-16 01:31:27,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2020-10-16 01:31:27,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:27,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2020-10-16 01:31:27,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:31:27,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:31:27,923 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:31:27,923 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 77 flow. Second operand 3 states and 502 transitions. [2020-10-16 01:31:27,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 93 flow [2020-10-16 01:31:27,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 90 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:31:27,927 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 93 flow [2020-10-16 01:31:27,928 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2020-10-16 01:31:27,928 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2020-10-16 01:31:27,928 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 93 flow [2020-10-16 01:31:27,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:31:27,928 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:27,929 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:27,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:31:27,929 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:27,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:27,929 INFO L82 PathProgramCache]: Analyzing trace with hash 8974314, now seen corresponding path program 1 times [2020-10-16 01:31:27,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:27,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688043531] [2020-10-16 01:31:27,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:28,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688043531] [2020-10-16 01:31:28,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:28,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:31:28,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354013458] [2020-10-16 01:31:28,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:31:28,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:28,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:31:28,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:31:28,035 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2020-10-16 01:31:28,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 93 flow. Second operand 3 states. [2020-10-16 01:31:28,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:28,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2020-10-16 01:31:28,036 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:28,063 INFO L129 PetriNetUnfolder]: 4/52 cut-off events. [2020-10-16 01:31:28,063 INFO L130 PetriNetUnfolder]: For 30/81 co-relation queries the response was YES. [2020-10-16 01:31:28,064 INFO L80 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 52 events. 4/52 cut-off events. For 30/81 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 176 event pairs, 1 based on Foata normal form. 2/50 useless extension candidates. Maximal degree in co-relation 98. Up to 15 conditions per place. [2020-10-16 01:31:28,065 INFO L132 encePairwiseOnDemand]: 191/194 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2020-10-16 01:31:28,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 105 flow [2020-10-16 01:31:28,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:31:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:31:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2020-10-16 01:31:28,068 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8608247422680413 [2020-10-16 01:31:28,068 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2020-10-16 01:31:28,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2020-10-16 01:31:28,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:28,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2020-10-16 01:31:28,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:31:28,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:31:28,072 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:31:28,072 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 93 flow. Second operand 3 states and 501 transitions. [2020-10-16 01:31:28,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 105 flow [2020-10-16 01:31:28,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 102 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:31:28,074 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 101 flow [2020-10-16 01:31:28,074 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2020-10-16 01:31:28,074 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2020-10-16 01:31:28,074 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 101 flow [2020-10-16 01:31:28,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:31:28,074 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:28,075 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:28,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:31:28,075 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:28,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:28,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2066264129, now seen corresponding path program 1 times [2020-10-16 01:31:28,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:28,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486411001] [2020-10-16 01:31:28,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:28,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486411001] [2020-10-16 01:31:28,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:28,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:31:28,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156111996] [2020-10-16 01:31:28,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:31:28,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:28,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:31:28,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:31:28,164 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 194 [2020-10-16 01:31:28,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 101 flow. Second operand 3 states. [2020-10-16 01:31:28,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:28,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 194 [2020-10-16 01:31:28,165 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:28,243 INFO L129 PetriNetUnfolder]: 91/231 cut-off events. [2020-10-16 01:31:28,243 INFO L130 PetriNetUnfolder]: For 208/332 co-relation queries the response was YES. [2020-10-16 01:31:28,245 INFO L80 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 231 events. 91/231 cut-off events. For 208/332 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1149 event pairs, 31 based on Foata normal form. 9/213 useless extension candidates. Maximal degree in co-relation 529. Up to 125 conditions per place. [2020-10-16 01:31:28,247 INFO L132 encePairwiseOnDemand]: 191/194 looper letters, 8 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2020-10-16 01:31:28,247 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 32 transitions, 127 flow [2020-10-16 01:31:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:31:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:31:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2020-10-16 01:31:28,250 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7972508591065293 [2020-10-16 01:31:28,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2020-10-16 01:31:28,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2020-10-16 01:31:28,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:28,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2020-10-16 01:31:28,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:31:28,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:31:28,254 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:31:28,254 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 101 flow. Second operand 3 states and 464 transitions. [2020-10-16 01:31:28,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 32 transitions, 127 flow [2020-10-16 01:31:28,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 122 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:31:28,257 INFO L241 Difference]: Finished difference. Result has 43 places, 29 transitions, 104 flow [2020-10-16 01:31:28,257 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2020-10-16 01:31:28,257 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2020-10-16 01:31:28,258 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 104 flow [2020-10-16 01:31:28,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:31:28,258 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:28,258 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:28,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:31:28,258 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:28,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:28,259 INFO L82 PathProgramCache]: Analyzing trace with hash -543020087, now seen corresponding path program 1 times [2020-10-16 01:31:28,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:28,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749325440] [2020-10-16 01:31:28,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:28,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749325440] [2020-10-16 01:31:28,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:28,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:31:28,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694639505] [2020-10-16 01:31:28,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:31:28,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:28,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:31:28,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:31:28,402 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 194 [2020-10-16 01:31:28,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 104 flow. Second operand 5 states. [2020-10-16 01:31:28,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:28,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 194 [2020-10-16 01:31:28,403 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:28,512 INFO L129 PetriNetUnfolder]: 69/202 cut-off events. [2020-10-16 01:31:28,512 INFO L130 PetriNetUnfolder]: For 348/423 co-relation queries the response was YES. [2020-10-16 01:31:28,514 INFO L80 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 202 events. 69/202 cut-off events. For 348/423 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1058 event pairs, 21 based on Foata normal form. 5/184 useless extension candidates. Maximal degree in co-relation 474. Up to 90 conditions per place. [2020-10-16 01:31:28,516 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 9 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2020-10-16 01:31:28,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 141 flow [2020-10-16 01:31:28,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:31:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:31:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2020-10-16 01:31:28,519 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7749140893470791 [2020-10-16 01:31:28,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2020-10-16 01:31:28,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2020-10-16 01:31:28,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:28,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2020-10-16 01:31:28,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:31:28,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:31:28,522 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:31:28,523 INFO L185 Difference]: Start difference. First operand has 43 places, 29 transitions, 104 flow. Second operand 3 states and 451 transitions. [2020-10-16 01:31:28,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 141 flow [2020-10-16 01:31:28,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 135 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:31:28,525 INFO L241 Difference]: Finished difference. Result has 44 places, 31 transitions, 119 flow [2020-10-16 01:31:28,525 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2020-10-16 01:31:28,526 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2020-10-16 01:31:28,526 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 119 flow [2020-10-16 01:31:28,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:31:28,526 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:28,526 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:28,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:31:28,527 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:28,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:28,527 INFO L82 PathProgramCache]: Analyzing trace with hash -638889432, now seen corresponding path program 1 times [2020-10-16 01:31:28,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:28,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645491796] [2020-10-16 01:31:28,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:28,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:28,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645491796] [2020-10-16 01:31:28,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:28,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:31:28,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95746773] [2020-10-16 01:31:28,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:31:28,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:28,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:31:28,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:31:28,708 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 194 [2020-10-16 01:31:28,709 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 119 flow. Second operand 6 states. [2020-10-16 01:31:28,709 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:28,709 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 194 [2020-10-16 01:31:28,709 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:28,886 INFO L129 PetriNetUnfolder]: 84/236 cut-off events. [2020-10-16 01:31:28,886 INFO L130 PetriNetUnfolder]: For 292/340 co-relation queries the response was YES. [2020-10-16 01:31:28,888 INFO L80 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 236 events. 84/236 cut-off events. For 292/340 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1257 event pairs, 21 based on Foata normal form. 3/219 useless extension candidates. Maximal degree in co-relation 643. Up to 108 conditions per place. [2020-10-16 01:31:28,891 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 11 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2020-10-16 01:31:28,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 192 flow [2020-10-16 01:31:28,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:31:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:31:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2020-10-16 01:31:28,895 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7494845360824742 [2020-10-16 01:31:28,895 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 727 transitions. [2020-10-16 01:31:28,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 727 transitions. [2020-10-16 01:31:28,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:28,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 727 transitions. [2020-10-16 01:31:28,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:31:28,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:31:28,901 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:31:28,901 INFO L185 Difference]: Start difference. First operand has 44 places, 31 transitions, 119 flow. Second operand 5 states and 727 transitions. [2020-10-16 01:31:28,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 192 flow [2020-10-16 01:31:28,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 185 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:31:28,905 INFO L241 Difference]: Finished difference. Result has 50 places, 37 transitions, 175 flow [2020-10-16 01:31:28,905 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2020-10-16 01:31:28,905 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2020-10-16 01:31:28,905 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 175 flow [2020-10-16 01:31:28,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:31:28,906 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:28,906 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:28,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:31:28,906 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:28,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:28,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1670873392, now seen corresponding path program 2 times [2020-10-16 01:31:28,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:28,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281480040] [2020-10-16 01:31:28,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:29,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281480040] [2020-10-16 01:31:29,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:29,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:31:29,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825776241] [2020-10-16 01:31:29,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:31:29,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:29,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:31:29,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:31:29,075 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 194 [2020-10-16 01:31:29,076 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 175 flow. Second operand 7 states. [2020-10-16 01:31:29,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:29,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 194 [2020-10-16 01:31:29,077 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:29,292 INFO L129 PetriNetUnfolder]: 87/252 cut-off events. [2020-10-16 01:31:29,293 INFO L130 PetriNetUnfolder]: For 488/547 co-relation queries the response was YES. [2020-10-16 01:31:29,295 INFO L80 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 252 events. 87/252 cut-off events. For 488/547 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1390 event pairs, 10 based on Foata normal form. 8/240 useless extension candidates. Maximal degree in co-relation 829. Up to 102 conditions per place. [2020-10-16 01:31:29,297 INFO L132 encePairwiseOnDemand]: 188/194 looper letters, 10 selfloop transitions, 11 changer transitions 0/43 dead transitions. [2020-10-16 01:31:29,297 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 247 flow [2020-10-16 01:31:29,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:31:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:31:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 722 transitions. [2020-10-16 01:31:29,301 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7443298969072165 [2020-10-16 01:31:29,302 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 722 transitions. [2020-10-16 01:31:29,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 722 transitions. [2020-10-16 01:31:29,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:29,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 722 transitions. [2020-10-16 01:31:29,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:31:29,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:31:29,307 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:31:29,307 INFO L185 Difference]: Start difference. First operand has 50 places, 37 transitions, 175 flow. Second operand 5 states and 722 transitions. [2020-10-16 01:31:29,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 247 flow [2020-10-16 01:31:29,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 43 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:31:29,310 INFO L241 Difference]: Finished difference. Result has 54 places, 40 transitions, 221 flow [2020-10-16 01:31:29,310 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2020-10-16 01:31:29,311 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2020-10-16 01:31:29,311 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 221 flow [2020-10-16 01:31:29,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:31:29,311 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:29,311 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:29,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:31:29,312 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:29,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:29,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1465895810, now seen corresponding path program 3 times [2020-10-16 01:31:29,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:29,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037851189] [2020-10-16 01:31:29,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:29,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037851189] [2020-10-16 01:31:29,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:29,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:31:29,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864735989] [2020-10-16 01:31:29,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:31:29,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:29,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:31:29,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:31:29,445 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 194 [2020-10-16 01:31:29,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 221 flow. Second operand 7 states. [2020-10-16 01:31:29,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:29,446 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 194 [2020-10-16 01:31:29,446 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:29,731 INFO L129 PetriNetUnfolder]: 93/277 cut-off events. [2020-10-16 01:31:29,731 INFO L130 PetriNetUnfolder]: For 699/758 co-relation queries the response was YES. [2020-10-16 01:31:29,734 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1051 conditions, 277 events. 93/277 cut-off events. For 699/758 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1619 event pairs, 4 based on Foata normal form. 8/265 useless extension candidates. Maximal degree in co-relation 1029. Up to 108 conditions per place. [2020-10-16 01:31:29,738 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 12 selfloop transitions, 17 changer transitions 0/51 dead transitions. [2020-10-16 01:31:29,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 51 transitions, 351 flow [2020-10-16 01:31:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:31:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:31:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 996 transitions. [2020-10-16 01:31:29,743 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7334315169366715 [2020-10-16 01:31:29,744 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 996 transitions. [2020-10-16 01:31:29,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 996 transitions. [2020-10-16 01:31:29,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:29,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 996 transitions. [2020-10-16 01:31:29,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:31:29,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:31:29,751 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:31:29,751 INFO L185 Difference]: Start difference. First operand has 54 places, 40 transitions, 221 flow. Second operand 7 states and 996 transitions. [2020-10-16 01:31:29,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 51 transitions, 351 flow [2020-10-16 01:31:29,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:31:29,755 INFO L241 Difference]: Finished difference. Result has 61 places, 47 transitions, 324 flow [2020-10-16 01:31:29,756 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=324, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2020-10-16 01:31:29,756 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2020-10-16 01:31:29,756 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 324 flow [2020-10-16 01:31:29,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:31:29,756 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:29,756 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:29,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:31:29,757 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:29,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:29,757 INFO L82 PathProgramCache]: Analyzing trace with hash -729156162, now seen corresponding path program 4 times [2020-10-16 01:31:29,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:29,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743190521] [2020-10-16 01:31:29,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:29,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743190521] [2020-10-16 01:31:29,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:29,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:31:29,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014551555] [2020-10-16 01:31:29,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:31:29,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:29,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:31:29,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:31:29,912 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 194 [2020-10-16 01:31:29,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 324 flow. Second operand 6 states. [2020-10-16 01:31:29,913 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:29,913 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 194 [2020-10-16 01:31:29,914 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:30,102 INFO L129 PetriNetUnfolder]: 82/279 cut-off events. [2020-10-16 01:31:30,102 INFO L130 PetriNetUnfolder]: For 1454/1523 co-relation queries the response was YES. [2020-10-16 01:31:30,105 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 279 events. 82/279 cut-off events. For 1454/1523 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1696 event pairs, 4 based on Foata normal form. 16/277 useless extension candidates. Maximal degree in co-relation 1158. Up to 104 conditions per place. [2020-10-16 01:31:30,108 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 14 selfloop transitions, 16 changer transitions 0/52 dead transitions. [2020-10-16 01:31:30,108 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 52 transitions, 417 flow [2020-10-16 01:31:30,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:31:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:31:30,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 868 transitions. [2020-10-16 01:31:30,113 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7457044673539519 [2020-10-16 01:31:30,113 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 868 transitions. [2020-10-16 01:31:30,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 868 transitions. [2020-10-16 01:31:30,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:30,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 868 transitions. [2020-10-16 01:31:30,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:31:30,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:31:30,118 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:31:30,119 INFO L185 Difference]: Start difference. First operand has 61 places, 47 transitions, 324 flow. Second operand 6 states and 868 transitions. [2020-10-16 01:31:30,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 52 transitions, 417 flow [2020-10-16 01:31:30,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 52 transitions, 398 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 01:31:30,124 INFO L241 Difference]: Finished difference. Result has 65 places, 48 transitions, 365 flow [2020-10-16 01:31:30,125 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=365, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2020-10-16 01:31:30,125 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2020-10-16 01:31:30,125 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 365 flow [2020-10-16 01:31:30,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:31:30,126 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:30,126 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:30,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:31:30,126 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:30,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:30,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1096290072, now seen corresponding path program 1 times [2020-10-16 01:31:30,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:30,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492316009] [2020-10-16 01:31:30,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:30,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492316009] [2020-10-16 01:31:30,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:30,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:31:30,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562910169] [2020-10-16 01:31:30,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:31:30,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:30,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:31:30,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:31:30,192 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194 [2020-10-16 01:31:30,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 365 flow. Second operand 4 states. [2020-10-16 01:31:30,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:30,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194 [2020-10-16 01:31:30,192 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:30,521 INFO L129 PetriNetUnfolder]: 818/1583 cut-off events. [2020-10-16 01:31:30,521 INFO L130 PetriNetUnfolder]: For 4606/5062 co-relation queries the response was YES. [2020-10-16 01:31:30,532 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4890 conditions, 1583 events. 818/1583 cut-off events. For 4606/5062 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 11850 event pairs, 117 based on Foata normal form. 162/1480 useless extension candidates. Maximal degree in co-relation 4863. Up to 729 conditions per place. [2020-10-16 01:31:30,543 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 12 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2020-10-16 01:31:30,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 57 transitions, 419 flow [2020-10-16 01:31:30,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:31:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:31:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2020-10-16 01:31:30,548 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8324742268041238 [2020-10-16 01:31:30,549 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 646 transitions. [2020-10-16 01:31:30,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 646 transitions. [2020-10-16 01:31:30,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:30,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 646 transitions. [2020-10-16 01:31:30,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:31:30,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:31:30,555 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:31:30,555 INFO L185 Difference]: Start difference. First operand has 65 places, 48 transitions, 365 flow. Second operand 4 states and 646 transitions. [2020-10-16 01:31:30,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 57 transitions, 419 flow [2020-10-16 01:31:30,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 398 flow, removed 3 selfloop flow, removed 4 redundant places. [2020-10-16 01:31:30,569 INFO L241 Difference]: Finished difference. Result has 66 places, 53 transitions, 398 flow [2020-10-16 01:31:30,569 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=398, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2020-10-16 01:31:30,570 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2020-10-16 01:31:30,570 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 398 flow [2020-10-16 01:31:30,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:31:30,570 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:30,571 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:30,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:31:30,571 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:30,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:30,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1356176847, now seen corresponding path program 1 times [2020-10-16 01:31:30,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:30,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860246954] [2020-10-16 01:31:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:30,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860246954] [2020-10-16 01:31:30,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:30,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:31:30,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699379506] [2020-10-16 01:31:30,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:31:30,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:30,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:31:30,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:31:30,685 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194 [2020-10-16 01:31:30,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 398 flow. Second operand 5 states. [2020-10-16 01:31:30,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:30,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194 [2020-10-16 01:31:30,687 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:30,923 INFO L129 PetriNetUnfolder]: 592/1226 cut-off events. [2020-10-16 01:31:30,923 INFO L130 PetriNetUnfolder]: For 3357/6290 co-relation queries the response was YES. [2020-10-16 01:31:30,932 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4500 conditions, 1226 events. 592/1226 cut-off events. For 3357/6290 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 9027 event pairs, 27 based on Foata normal form. 223/1224 useless extension candidates. Maximal degree in co-relation 4472. Up to 927 conditions per place. [2020-10-16 01:31:30,939 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 13 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2020-10-16 01:31:30,939 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 481 flow [2020-10-16 01:31:30,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:31:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:31:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 808 transitions. [2020-10-16 01:31:30,943 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8329896907216495 [2020-10-16 01:31:30,943 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 808 transitions. [2020-10-16 01:31:30,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 808 transitions. [2020-10-16 01:31:30,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:30,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 808 transitions. [2020-10-16 01:31:30,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:31:30,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:31:30,948 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:31:30,948 INFO L185 Difference]: Start difference. First operand has 66 places, 53 transitions, 398 flow. Second operand 5 states and 808 transitions. [2020-10-16 01:31:30,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 481 flow [2020-10-16 01:31:30,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 478 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:31:30,955 INFO L241 Difference]: Finished difference. Result has 71 places, 58 transitions, 471 flow [2020-10-16 01:31:30,955 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=471, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2020-10-16 01:31:30,955 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2020-10-16 01:31:30,955 INFO L481 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 471 flow [2020-10-16 01:31:30,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:31:30,956 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:30,956 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:30,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:31:30,956 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:30,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:30,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1404044969, now seen corresponding path program 1 times [2020-10-16 01:31:30,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:30,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301773878] [2020-10-16 01:31:30,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:31,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301773878] [2020-10-16 01:31:31,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:31,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:31:31,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052511160] [2020-10-16 01:31:31,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:31:31,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:31,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:31:31,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:31:31,021 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 194 [2020-10-16 01:31:31,021 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 471 flow. Second operand 5 states. [2020-10-16 01:31:31,021 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:31,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 194 [2020-10-16 01:31:31,022 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:31,303 INFO L129 PetriNetUnfolder]: 923/1926 cut-off events. [2020-10-16 01:31:31,303 INFO L130 PetriNetUnfolder]: For 7563/9497 co-relation queries the response was YES. [2020-10-16 01:31:31,318 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7989 conditions, 1926 events. 923/1926 cut-off events. For 7563/9497 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 15780 event pairs, 125 based on Foata normal form. 76/1687 useless extension candidates. Maximal degree in co-relation 7958. Up to 1502 conditions per place. [2020-10-16 01:31:31,330 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 16 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2020-10-16 01:31:31,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 65 transitions, 597 flow [2020-10-16 01:31:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:31:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:31:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2020-10-16 01:31:31,333 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8015463917525774 [2020-10-16 01:31:31,334 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 622 transitions. [2020-10-16 01:31:31,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 622 transitions. [2020-10-16 01:31:31,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:31,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 622 transitions. [2020-10-16 01:31:31,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:31:31,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:31:31,338 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:31:31,338 INFO L185 Difference]: Start difference. First operand has 71 places, 58 transitions, 471 flow. Second operand 4 states and 622 transitions. [2020-10-16 01:31:31,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 65 transitions, 597 flow [2020-10-16 01:31:31,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 65 transitions, 582 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 01:31:31,347 INFO L241 Difference]: Finished difference. Result has 73 places, 58 transitions, 469 flow [2020-10-16 01:31:31,347 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=469, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2020-10-16 01:31:31,348 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2020-10-16 01:31:31,348 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 469 flow [2020-10-16 01:31:31,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:31:31,348 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:31,348 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:31,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:31:31,348 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:31,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:31,349 INFO L82 PathProgramCache]: Analyzing trace with hash -547666753, now seen corresponding path program 1 times [2020-10-16 01:31:31,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:31,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825410016] [2020-10-16 01:31:31,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:31,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825410016] [2020-10-16 01:31:31,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:31,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:31:31,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724031111] [2020-10-16 01:31:31,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:31:31,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:31,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:31:31,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:31:31,418 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194 [2020-10-16 01:31:31,420 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 469 flow. Second operand 6 states. [2020-10-16 01:31:31,420 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:31,420 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194 [2020-10-16 01:31:31,420 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:31,793 INFO L129 PetriNetUnfolder]: 717/1439 cut-off events. [2020-10-16 01:31:31,794 INFO L130 PetriNetUnfolder]: For 4585/9149 co-relation queries the response was YES. [2020-10-16 01:31:31,803 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6091 conditions, 1439 events. 717/1439 cut-off events. For 4585/9149 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 10619 event pairs, 0 based on Foata normal form. 295/1414 useless extension candidates. Maximal degree in co-relation 6059. Up to 1160 conditions per place. [2020-10-16 01:31:31,811 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 12 selfloop transitions, 14 changer transitions 0/60 dead transitions. [2020-10-16 01:31:31,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 60 transitions, 489 flow [2020-10-16 01:31:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:31:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:31:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 970 transitions. [2020-10-16 01:31:31,815 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2020-10-16 01:31:31,815 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 970 transitions. [2020-10-16 01:31:31,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 970 transitions. [2020-10-16 01:31:31,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:31,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 970 transitions. [2020-10-16 01:31:31,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:31:31,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:31:31,821 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:31:31,821 INFO L185 Difference]: Start difference. First operand has 73 places, 58 transitions, 469 flow. Second operand 6 states and 970 transitions. [2020-10-16 01:31:31,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 60 transitions, 489 flow [2020-10-16 01:31:31,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 60 transitions, 465 flow, removed 2 selfloop flow, removed 5 redundant places. [2020-10-16 01:31:31,828 INFO L241 Difference]: Finished difference. Result has 75 places, 56 transitions, 444 flow [2020-10-16 01:31:31,828 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=444, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2020-10-16 01:31:31,829 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2020-10-16 01:31:31,829 INFO L481 AbstractCegarLoop]: Abstraction has has 75 places, 56 transitions, 444 flow [2020-10-16 01:31:31,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:31:31,829 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:31,829 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:31,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:31:31,829 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:31,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:31,830 INFO L82 PathProgramCache]: Analyzing trace with hash 600818007, now seen corresponding path program 1 times [2020-10-16 01:31:31,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:31,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580285979] [2020-10-16 01:31:31,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:31,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580285979] [2020-10-16 01:31:31,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:31,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:31:31,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315759952] [2020-10-16 01:31:31,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:31:31,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:31,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:31:31,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:31:31,898 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 194 [2020-10-16 01:31:31,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 56 transitions, 444 flow. Second operand 6 states. [2020-10-16 01:31:31,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:31,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 194 [2020-10-16 01:31:31,899 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:32,519 INFO L129 PetriNetUnfolder]: 1593/3331 cut-off events. [2020-10-16 01:31:32,520 INFO L130 PetriNetUnfolder]: For 17922/24089 co-relation queries the response was YES. [2020-10-16 01:31:32,551 INFO L80 FinitePrefix]: Finished finitePrefix Result has 15528 conditions, 3331 events. 1593/3331 cut-off events. For 17922/24089 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 30957 event pairs, 31 based on Foata normal form. 169/2830 useless extension candidates. Maximal degree in co-relation 15496. Up to 2526 conditions per place. [2020-10-16 01:31:32,575 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 34 selfloop transitions, 10 changer transitions 2/84 dead transitions. [2020-10-16 01:31:32,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 84 transitions, 835 flow [2020-10-16 01:31:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:31:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:31:32,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1072 transitions. [2020-10-16 01:31:32,581 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7893961708394698 [2020-10-16 01:31:32,581 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1072 transitions. [2020-10-16 01:31:32,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1072 transitions. [2020-10-16 01:31:32,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:32,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1072 transitions. [2020-10-16 01:31:32,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:31:32,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:31:32,589 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:31:32,589 INFO L185 Difference]: Start difference. First operand has 75 places, 56 transitions, 444 flow. Second operand 7 states and 1072 transitions. [2020-10-16 01:31:32,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 84 transitions, 835 flow [2020-10-16 01:31:32,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 804 flow, removed 8 selfloop flow, removed 3 redundant places. [2020-10-16 01:31:32,666 INFO L241 Difference]: Finished difference. Result has 80 places, 61 transitions, 479 flow [2020-10-16 01:31:32,667 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=479, PETRI_PLACES=80, PETRI_TRANSITIONS=61} [2020-10-16 01:31:32,667 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 40 predicate places. [2020-10-16 01:31:32,667 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 61 transitions, 479 flow [2020-10-16 01:31:32,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:31:32,667 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:32,668 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:32,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:31:32,668 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:32,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:32,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1370646847, now seen corresponding path program 2 times [2020-10-16 01:31:32,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:32,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981734840] [2020-10-16 01:31:32,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:32,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981734840] [2020-10-16 01:31:32,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:32,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:31:32,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255268666] [2020-10-16 01:31:32,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:31:32,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:32,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:31:32,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:31:32,744 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194 [2020-10-16 01:31:32,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 61 transitions, 479 flow. Second operand 7 states. [2020-10-16 01:31:32,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:32,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194 [2020-10-16 01:31:32,746 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:33,259 INFO L129 PetriNetUnfolder]: 1338/2664 cut-off events. [2020-10-16 01:31:33,260 INFO L130 PetriNetUnfolder]: For 10350/22419 co-relation queries the response was YES. [2020-10-16 01:31:33,281 INFO L80 FinitePrefix]: Finished finitePrefix Result has 12188 conditions, 2664 events. 1338/2664 cut-off events. For 10350/22419 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 22567 event pairs, 0 based on Foata normal form. 506/2571 useless extension candidates. Maximal degree in co-relation 12154. Up to 1369 conditions per place. [2020-10-16 01:31:33,295 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 5 selfloop transitions, 18 changer transitions 17/62 dead transitions. [2020-10-16 01:31:33,295 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 62 transitions, 533 flow [2020-10-16 01:31:33,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:31:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:31:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1124 transitions. [2020-10-16 01:31:33,299 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8276877761413843 [2020-10-16 01:31:33,300 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1124 transitions. [2020-10-16 01:31:33,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1124 transitions. [2020-10-16 01:31:33,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:33,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1124 transitions. [2020-10-16 01:31:33,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:31:33,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:31:33,310 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:31:33,310 INFO L185 Difference]: Start difference. First operand has 80 places, 61 transitions, 479 flow. Second operand 7 states and 1124 transitions. [2020-10-16 01:31:33,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 62 transitions, 533 flow [2020-10-16 01:31:33,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 62 transitions, 511 flow, removed 7 selfloop flow, removed 2 redundant places. [2020-10-16 01:31:33,341 INFO L241 Difference]: Finished difference. Result has 86 places, 45 transitions, 370 flow [2020-10-16 01:31:33,341 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=370, PETRI_PLACES=86, PETRI_TRANSITIONS=45} [2020-10-16 01:31:33,342 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 46 predicate places. [2020-10-16 01:31:33,342 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 45 transitions, 370 flow [2020-10-16 01:31:33,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:31:33,342 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:33,343 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-16 01:31:33,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 01:31:33,343 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:33,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2016881101, now seen corresponding path program 1 times [2020-10-16 01:31:33,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:33,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007913611] [2020-10-16 01:31:33,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:31:33,404 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:31:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:31:33,436 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:31:33,489 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:31:33,490 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:31:33,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 01:31:33,492 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 01:31:33,507 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L3-->L841: Formula: (let ((.cse6 (= (mod ~z$r_buff0_thd0~0_In-1491805700 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In-1491805700 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In-1491805700 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In-1491805700 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-1491805700 0)) (or (and (= ~z$w_buff1_used~0_Out-1491805700 ~z$w_buff1_used~0_In-1491805700) .cse0) (and .cse1 .cse2 (= ~z$w_buff1_used~0_Out-1491805700 0))) (or (and .cse3 (or (and .cse1 .cse2 (= ~z$w_buff1~0_In-1491805700 ~z~0_Out-1491805700)) (and (= ~z~0_In-1491805700 ~z~0_Out-1491805700) .cse0))) (and .cse4 .cse5 (= ~z$w_buff0~0_In-1491805700 ~z~0_Out-1491805700))) (or (and .cse4 (= ~z$w_buff0_used~0_Out-1491805700 0) .cse5) (and (= ~z$w_buff0_used~0_In-1491805700 ~z$w_buff0_used~0_Out-1491805700) .cse3)) (= ~z$r_buff0_thd0~0_Out-1491805700 ~z$r_buff0_thd0~0_In-1491805700) (= ~z$r_buff1_thd0~0_In-1491805700 ~z$r_buff1_thd0~0_Out-1491805700)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1491805700, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1491805700, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1491805700, ~z$w_buff0~0=~z$w_buff0~0_In-1491805700, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1491805700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1491805700, ~z$w_buff1~0=~z$w_buff1~0_In-1491805700, ~z~0=~z~0_In-1491805700} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1491805700, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1491805700|, ~z$w_buff0~0=~z$w_buff0~0_In-1491805700, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1491805700|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1491805700, ~z$w_buff1~0=~z$w_buff1~0_In-1491805700, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1491805700|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1491805700|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1491805700|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1491805700|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-1491805700, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1491805700, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1491805700, ~z~0=~z~0_Out-1491805700} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 01:31:33,518 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,519 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,520 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,520 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,521 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,521 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,521 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,521 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,522 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,522 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,522 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,522 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,522 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,523 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,523 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,523 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,524 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,526 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,526 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,526 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,531 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,531 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,531 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,531 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,532 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,532 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,532 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,533 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,533 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,534 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:31:33,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:31:33 BasicIcfg [2020-10-16 01:31:33,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:31:33,611 INFO L168 Benchmark]: Toolchain (without parser) took 20750.84 ms. Allocated memory was 250.6 MB in the beginning and 666.4 MB in the end (delta: 415.8 MB). Free memory was 206.3 MB in the beginning and 442.5 MB in the end (delta: -236.1 MB). Peak memory consumption was 179.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:31:33,611 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:31:33,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.98 ms. Allocated memory was 250.6 MB in the beginning and 314.6 MB in the end (delta: 64.0 MB). Free memory was 206.3 MB in the beginning and 266.8 MB in the end (delta: -60.5 MB). Peak memory consumption was 36.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:31:33,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.82 ms. Allocated memory is still 314.6 MB. Free memory was 266.8 MB in the beginning and 264.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:31:33,613 INFO L168 Benchmark]: Boogie Preprocessor took 40.46 ms. Allocated memory is still 314.6 MB. Free memory was 264.3 MB in the beginning and 261.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:31:33,614 INFO L168 Benchmark]: RCFGBuilder took 2022.19 ms. Allocated memory was 314.6 MB in the beginning and 356.0 MB in the end (delta: 41.4 MB). Free memory was 261.8 MB in the beginning and 209.3 MB in the end (delta: 52.5 MB). Peak memory consumption was 101.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:31:33,614 INFO L168 Benchmark]: TraceAbstraction took 17822.94 ms. Allocated memory was 356.0 MB in the beginning and 666.4 MB in the end (delta: 310.4 MB). Free memory was 209.3 MB in the beginning and 442.5 MB in the end (delta: -233.2 MB). Peak memory consumption was 77.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:31:33,618 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 771.98 ms. Allocated memory was 250.6 MB in the beginning and 314.6 MB in the end (delta: 64.0 MB). Free memory was 206.3 MB in the beginning and 266.8 MB in the end (delta: -60.5 MB). Peak memory consumption was 36.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 86.82 ms. Allocated memory is still 314.6 MB. Free memory was 266.8 MB in the beginning and 264.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 40.46 ms. Allocated memory is still 314.6 MB. Free memory was 264.3 MB in the beginning and 261.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2022.19 ms. Allocated memory was 314.6 MB in the beginning and 356.0 MB in the end (delta: 41.4 MB). Free memory was 261.8 MB in the beginning and 209.3 MB in the end (delta: 52.5 MB). Peak memory consumption was 101.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 17822.94 ms. Allocated memory was 356.0 MB in the beginning and 666.4 MB in the end (delta: 310.4 MB). Free memory was 209.3 MB in the beginning and 442.5 MB in the end (delta: -233.2 MB). Peak memory consumption was 77.2 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1653 VarBasedMoverChecksPositive, 109 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 68 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 194 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.0s, 114 PlacesBefore, 40 PlacesAfterwards, 103 TransitionsBefore, 28 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 87 TotalNumberOfCompositions, 6523 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int a = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L709] 0 int y = 0; [L711] 0 int z = 0; [L712] 0 _Bool z$flush_delayed; [L713] 0 int z$mem_tmp; [L714] 0 _Bool z$r_buff0_thd0; [L715] 0 _Bool z$r_buff0_thd1; [L716] 0 _Bool z$r_buff0_thd2; [L717] 0 _Bool z$r_buff0_thd3; [L718] 0 _Bool z$r_buff0_thd4; [L719] 0 _Bool z$r_buff1_thd0; [L720] 0 _Bool z$r_buff1_thd1; [L721] 0 _Bool z$r_buff1_thd2; [L722] 0 _Bool z$r_buff1_thd3; [L723] 0 _Bool z$r_buff1_thd4; [L724] 0 _Bool z$read_delayed; [L725] 0 int *z$read_delayed_var; [L726] 0 int z$w_buff0; [L727] 0 _Bool z$w_buff0_used; [L728] 0 int z$w_buff1; [L729] 0 _Bool z$w_buff1_used; [L730] 0 _Bool weak$$choice0; [L731] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1541; [L824] FCALL, FORK 0 pthread_create(&t1541, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 pthread_t t1542; [L826] FCALL, FORK 0 pthread_create(&t1542, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 pthread_t t1543; [L828] FCALL, FORK 0 pthread_create(&t1543, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t1544; [L830] FCALL, FORK 0 pthread_create(&t1544, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 4 z$w_buff1 = z$w_buff0 [L786] 4 z$w_buff0 = 2 [L787] 4 z$w_buff1_used = z$w_buff0_used [L788] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L790] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L791] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L792] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L793] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L794] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L795] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L771] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L772] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L774] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L775] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L802] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L803] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L805] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 2 return 0; [L778] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 3 return 0; [L808] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 4 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 z$flush_delayed = weak$$choice2 [L846] 0 z$mem_tmp = z [L847] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L847] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L848] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L848] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L849] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L849] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L850] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L852] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L852] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L852] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L853] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L855] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L855] 0 z = z$flush_delayed ? z$mem_tmp : z [L856] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.1s, HoareTripleCheckerStatistics: 54 SDtfs, 42 SDslu, 29 SDs, 0 SdLazy, 316 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 23135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...