/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/mix056_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:30:38,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:30:38,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:30:38,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:30:38,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:30:38,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:30:38,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:30:38,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:30:38,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:30:38,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:30:38,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:30:38,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:30:38,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:30:38,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:30:38,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:30:38,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:30:38,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:30:38,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:30:38,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:30:38,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:30:38,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:30:38,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:30:38,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:30:38,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:30:38,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:30:38,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:30:38,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:30:38,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:30:38,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:30:38,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:30:38,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:30:38,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:30:38,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:30:38,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:30:38,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:30:38,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:30:38,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:30:38,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:30:38,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:30:38,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:30:38,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:30:38,673 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:30:38,696 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:30:38,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:30:38,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:30:38,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:30:38,697 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:30:38,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:30:38,698 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:30:38,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:30:38,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:30:38,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:30:38,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:30:38,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:30:38,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:30:38,699 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:30:38,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:30:38,700 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:30:38,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:30:38,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:30:38,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:30:38,700 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:30:38,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:30:38,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:30:38,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:30:38,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:30:38,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:30:38,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:30:38,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:30:38,702 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:30:38,702 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:30:38,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:30:38,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:30:39,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:30:39,004 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:30:39,004 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:30:39,005 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2020-10-16 01:30:39,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3708bcfcb/4f3813c33f0d4447a8e71f23677eff9c/FLAG1b1b65adb [2020-10-16 01:30:39,523 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:30:39,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2020-10-16 01:30:39,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3708bcfcb/4f3813c33f0d4447a8e71f23677eff9c/FLAG1b1b65adb [2020-10-16 01:30:39,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3708bcfcb/4f3813c33f0d4447a8e71f23677eff9c [2020-10-16 01:30:39,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:30:39,848 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:30:39,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:30:39,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:30:39,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:30:39,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:30:39" (1/1) ... [2020-10-16 01:30:39,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dae63aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:39, skipping insertion in model container [2020-10-16 01:30:39,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:30:39" (1/1) ... [2020-10-16 01:30:39,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:30:39,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:30:40,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:30:40,504 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:30:40,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:30:40,737 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:30:40,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:40 WrapperNode [2020-10-16 01:30:40,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:30:40,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:30:40,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:30:40,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:30:40,751 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:30:40" (1/1) ... [2020-10-16 01:30:40,797 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:30:40" (1/1) ... [2020-10-16 01:30:40,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:30:40,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:30:40,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:30:40,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:30:40,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:40" (1/1) ... [2020-10-16 01:30:40,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:40" (1/1) ... [2020-10-16 01:30:40,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:40" (1/1) ... [2020-10-16 01:30:40,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:40" (1/1) ... [2020-10-16 01:30:40,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:40" (1/1) ... [2020-10-16 01:30:40,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:40" (1/1) ... [2020-10-16 01:30:40,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:40" (1/1) ... [2020-10-16 01:30:40,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:30:40,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:30:40,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:30:40,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:30:40,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:40" (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:30:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:30:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:30:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:30:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:30:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:30:40,984 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:30:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:30:40,985 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:30:40,986 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:30:40,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:30:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:30:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:30:40,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:30:40,991 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:30:43,030 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:30:43,031 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:30:43,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:30:43 BoogieIcfgContainer [2020-10-16 01:30:43,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:30:43,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:30:43,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:30:43,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:30:43,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:30:39" (1/3) ... [2020-10-16 01:30:43,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f442d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:30:43, skipping insertion in model container [2020-10-16 01:30:43,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:40" (2/3) ... [2020-10-16 01:30:43,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f442d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:30:43, skipping insertion in model container [2020-10-16 01:30:43,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:30:43" (3/3) ... [2020-10-16 01:30:43,042 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_power.opt.i [2020-10-16 01:30:43,054 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:30:43,061 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:30:43,062 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:30:43,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,091 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,091 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,093 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,093 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,096 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,096 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,096 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,097 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,103 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,103 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,107 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,108 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,108 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,110 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:43,128 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:30:43,150 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:30:43,150 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:30:43,150 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:30:43,150 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:30:43,150 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:30:43,150 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:30:43,151 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:30:43,151 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:30:43,165 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-16 01:30:43,209 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-16 01:30:43,210 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:30:43,215 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 01:30:43,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 91 transitions, 197 flow [2020-10-16 01:30:43,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 88 transitions, 185 flow [2020-10-16 01:30:43,225 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:30:43,227 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 88 transitions, 185 flow [2020-10-16 01:30:43,230 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 88 transitions, 185 flow [2020-10-16 01:30:43,231 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 96 places, 88 transitions, 185 flow [2020-10-16 01:30:43,254 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-16 01:30:43,255 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:30:43,255 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 01:30:43,258 INFO L117 LiptonReduction]: Number of co-enabled transitions 1536 [2020-10-16 01:30:43,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:43,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:43,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:43,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:43,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:43,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:43,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:43,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:43,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:30:43,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:44,008 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:30:44,121 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 01:30:44,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:44,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:44,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:44,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:44,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:30:44,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:44,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:30:44,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:44,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:30:44,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:30:44,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:30:44,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:44,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:44,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:44,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:44,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:44,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:44,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:44,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:44,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:44,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:44,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:30:44,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:30:44,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:30:44,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:44,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:44,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:44,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:44,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 01:30:44,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:44,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:44,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:44,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:44,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:44,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:44,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:44,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:44,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:44,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:44,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:44,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:30:44,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:30:44,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:44,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:30:44,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:30:45,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:45,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:30:45,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:30:45,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:30:45,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:45,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:45,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:45,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:45,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:45,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:45,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:45,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:45,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:45,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:45,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:30:45,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:30:45,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:30:45,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:30:45,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:45,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:30:45,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:30:45,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:30:45,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-16 01:30:45,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:45,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:45,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:45,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:45,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:30:45,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:30:45,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:45,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:45,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:45,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:45,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:45,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:45,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:45,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:45,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:30:45,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:45,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 01:30:45,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:45,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:45,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:45,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:45,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,084 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 01:30:46,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:46,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:46,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:46,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:46,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:30:46,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:30:46,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 01:30:46,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:30:46,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:30:46,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:46,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:46,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:46,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:30:46,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:30:46,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:30:46,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:46,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:46,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:46,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:46,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:46,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:46,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:46,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:46,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:46,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:46,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:46,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:46,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:46,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:46,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:46,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:46,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:46,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:46,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:46,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:46,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:46,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:46,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:46,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:47,134 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2020-10-16 01:30:47,369 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 01:30:47,474 INFO L132 LiptonReduction]: Checked pairs total: 3968 [2020-10-16 01:30:47,474 INFO L134 LiptonReduction]: Total number of compositions: 78 [2020-10-16 01:30:47,477 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4255 [2020-10-16 01:30:47,485 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2020-10-16 01:30:47,485 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:30:47,486 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:47,487 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:47,487 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:47,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:47,493 INFO L82 PathProgramCache]: Analyzing trace with hash 138438280, now seen corresponding path program 1 times [2020-10-16 01:30:47,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:47,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930787256] [2020-10-16 01:30:47,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:47,758 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:30:47,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930787256] [2020-10-16 01:30:47,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:47,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:30:47,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182100641] [2020-10-16 01:30:47,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:30:47,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:47,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:30:47,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:30:47,793 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 169 [2020-10-16 01:30:47,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states. [2020-10-16 01:30:47,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:47,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 169 [2020-10-16 01:30:47,797 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:47,866 INFO L129 PetriNetUnfolder]: 16/63 cut-off events. [2020-10-16 01:30:47,867 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:30:47,867 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 63 events. 16/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 207 event pairs, 2 based on Foata normal form. 6/67 useless extension candidates. Maximal degree in co-relation 98. Up to 27 conditions per place. [2020-10-16 01:30:47,869 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 7 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2020-10-16 01:30:47,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 77 flow [2020-10-16 01:30:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:30:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:30:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2020-10-16 01:30:47,889 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8579881656804734 [2020-10-16 01:30:47,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2020-10-16 01:30:47,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2020-10-16 01:30:47,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:47,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2020-10-16 01:30:47,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:30:47,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:30:47,908 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:30:47,910 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 435 transitions. [2020-10-16 01:30:47,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 77 flow [2020-10-16 01:30:47,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 74 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:30:47,917 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 54 flow [2020-10-16 01:30:47,920 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2020-10-16 01:30:47,921 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2020-10-16 01:30:47,921 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2020-10-16 01:30:47,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:30:47,922 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:47,922 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:47,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:30:47,922 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:47,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:47,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1047275778, now seen corresponding path program 1 times [2020-10-16 01:30:47,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:47,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574842766] [2020-10-16 01:30:47,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:48,093 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:30:48,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574842766] [2020-10-16 01:30:48,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:48,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:30:48,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734042650] [2020-10-16 01:30:48,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:30:48,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:48,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:30:48,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:30:48,099 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 169 [2020-10-16 01:30:48,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand 4 states. [2020-10-16 01:30:48,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:48,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 169 [2020-10-16 01:30:48,100 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:48,166 INFO L129 PetriNetUnfolder]: 12/69 cut-off events. [2020-10-16 01:30:48,167 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:30:48,167 INFO L80 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 69 events. 12/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 236 event pairs, 3 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 104. Up to 20 conditions per place. [2020-10-16 01:30:48,168 INFO L132 encePairwiseOnDemand]: 164/169 looper letters, 4 selfloop transitions, 3 changer transitions 8/31 dead transitions. [2020-10-16 01:30:48,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 102 flow [2020-10-16 01:30:48,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:30:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:30:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2020-10-16 01:30:48,173 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8248520710059172 [2020-10-16 01:30:48,173 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2020-10-16 01:30:48,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2020-10-16 01:30:48,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:48,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2020-10-16 01:30:48,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:30:48,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:30:48,179 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:30:48,179 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 5 states and 697 transitions. [2020-10-16 01:30:48,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 102 flow [2020-10-16 01:30:48,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:30:48,181 INFO L241 Difference]: Finished difference. Result has 36 places, 23 transitions, 75 flow [2020-10-16 01:30:48,181 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2020-10-16 01:30:48,182 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2020-10-16 01:30:48,182 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 75 flow [2020-10-16 01:30:48,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:30:48,182 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:48,182 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:48,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:30:48,183 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:48,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:48,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1894135605, now seen corresponding path program 1 times [2020-10-16 01:30:48,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:48,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987694556] [2020-10-16 01:30:48,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:48,351 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:30:48,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987694556] [2020-10-16 01:30:48,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:48,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:30:48,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111974276] [2020-10-16 01:30:48,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:30:48,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:48,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:30:48,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:30:48,356 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 169 [2020-10-16 01:30:48,356 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 75 flow. Second operand 4 states. [2020-10-16 01:30:48,356 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:48,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 169 [2020-10-16 01:30:48,357 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:48,488 INFO L129 PetriNetUnfolder]: 102/234 cut-off events. [2020-10-16 01:30:48,488 INFO L130 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2020-10-16 01:30:48,491 INFO L80 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 234 events. 102/234 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1127 event pairs, 61 based on Foata normal form. 19/242 useless extension candidates. Maximal degree in co-relation 508. Up to 136 conditions per place. [2020-10-16 01:30:48,493 INFO L132 encePairwiseOnDemand]: 164/169 looper letters, 8 selfloop transitions, 3 changer transitions 7/33 dead transitions. [2020-10-16 01:30:48,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 133 flow [2020-10-16 01:30:48,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:30:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:30:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 630 transitions. [2020-10-16 01:30:48,496 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7455621301775148 [2020-10-16 01:30:48,497 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 630 transitions. [2020-10-16 01:30:48,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 630 transitions. [2020-10-16 01:30:48,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:48,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 630 transitions. [2020-10-16 01:30:48,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:30:48,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:30:48,500 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:30:48,500 INFO L185 Difference]: Start difference. First operand has 36 places, 23 transitions, 75 flow. Second operand 5 states and 630 transitions. [2020-10-16 01:30:48,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 133 flow [2020-10-16 01:30:48,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 128 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:30:48,503 INFO L241 Difference]: Finished difference. Result has 38 places, 25 transitions, 97 flow [2020-10-16 01:30:48,504 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2020-10-16 01:30:48,504 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2020-10-16 01:30:48,504 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 97 flow [2020-10-16 01:30:48,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:30:48,504 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:48,505 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:48,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:30:48,505 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:48,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1332767515, now seen corresponding path program 1 times [2020-10-16 01:30:48,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:48,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247227026] [2020-10-16 01:30:48,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:48,689 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:30:48,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247227026] [2020-10-16 01:30:48,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:48,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:30:48,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022956326] [2020-10-16 01:30:48,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:30:48,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:48,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:30:48,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:30:48,693 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 169 [2020-10-16 01:30:48,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 97 flow. Second operand 6 states. [2020-10-16 01:30:48,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:48,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 169 [2020-10-16 01:30:48,694 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:48,873 INFO L129 PetriNetUnfolder]: 88/203 cut-off events. [2020-10-16 01:30:48,873 INFO L130 PetriNetUnfolder]: For 210/210 co-relation queries the response was YES. [2020-10-16 01:30:48,875 INFO L80 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 203 events. 88/203 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 946 event pairs, 19 based on Foata normal form. 12/206 useless extension candidates. Maximal degree in co-relation 541. Up to 106 conditions per place. [2020-10-16 01:30:48,877 INFO L132 encePairwiseOnDemand]: 162/169 looper letters, 8 selfloop transitions, 7 changer transitions 6/36 dead transitions. [2020-10-16 01:30:48,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 177 flow [2020-10-16 01:30:48,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:30:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:30:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions. [2020-10-16 01:30:48,880 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2020-10-16 01:30:48,881 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 754 transitions. [2020-10-16 01:30:48,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions. [2020-10-16 01:30:48,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:48,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions. [2020-10-16 01:30:48,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:30:48,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:30:48,885 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:30:48,885 INFO L185 Difference]: Start difference. First operand has 38 places, 25 transitions, 97 flow. Second operand 6 states and 754 transitions. [2020-10-16 01:30:48,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 177 flow [2020-10-16 01:30:48,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 166 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 01:30:48,889 INFO L241 Difference]: Finished difference. Result has 43 places, 28 transitions, 134 flow [2020-10-16 01:30:48,889 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2020-10-16 01:30:48,889 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2020-10-16 01:30:48,889 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 134 flow [2020-10-16 01:30:48,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:30:48,890 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:48,890 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:48,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:30:48,890 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:48,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:48,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1411421825, now seen corresponding path program 1 times [2020-10-16 01:30:48,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:48,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988116719] [2020-10-16 01:30:48,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:49,004 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:30:49,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988116719] [2020-10-16 01:30:49,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:49,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:30:49,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578995576] [2020-10-16 01:30:49,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:30:49,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:49,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:30:49,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:30:49,007 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 169 [2020-10-16 01:30:49,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 134 flow. Second operand 6 states. [2020-10-16 01:30:49,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:49,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 169 [2020-10-16 01:30:49,008 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:49,160 INFO L129 PetriNetUnfolder]: 71/179 cut-off events. [2020-10-16 01:30:49,161 INFO L130 PetriNetUnfolder]: For 354/360 co-relation queries the response was YES. [2020-10-16 01:30:49,162 INFO L80 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 179 events. 71/179 cut-off events. For 354/360 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 858 event pairs, 11 based on Foata normal form. 16/186 useless extension candidates. Maximal degree in co-relation 564. Up to 102 conditions per place. [2020-10-16 01:30:49,164 INFO L132 encePairwiseOnDemand]: 163/169 looper letters, 12 selfloop transitions, 5 changer transitions 6/38 dead transitions. [2020-10-16 01:30:49,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 226 flow [2020-10-16 01:30:49,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:30:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:30:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2020-10-16 01:30:49,168 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7140039447731755 [2020-10-16 01:30:49,168 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 724 transitions. [2020-10-16 01:30:49,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 724 transitions. [2020-10-16 01:30:49,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:49,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 724 transitions. [2020-10-16 01:30:49,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:30:49,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:30:49,172 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:30:49,173 INFO L185 Difference]: Start difference. First operand has 43 places, 28 transitions, 134 flow. Second operand 6 states and 724 transitions. [2020-10-16 01:30:49,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 226 flow [2020-10-16 01:30:49,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 38 transitions, 216 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 01:30:49,176 INFO L241 Difference]: Finished difference. Result has 46 places, 30 transitions, 159 flow [2020-10-16 01:30:49,177 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=159, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2020-10-16 01:30:49,177 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2020-10-16 01:30:49,177 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 159 flow [2020-10-16 01:30:49,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:30:49,177 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:49,178 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:49,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:30:49,178 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:49,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:49,178 INFO L82 PathProgramCache]: Analyzing trace with hash 802253687, now seen corresponding path program 1 times [2020-10-16 01:30:49,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:49,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309921698] [2020-10-16 01:30:49,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:49,300 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:30:49,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309921698] [2020-10-16 01:30:49,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:49,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:30:49,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089591581] [2020-10-16 01:30:49,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:30:49,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:49,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:30:49,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:30:49,304 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 169 [2020-10-16 01:30:49,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 159 flow. Second operand 6 states. [2020-10-16 01:30:49,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:49,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 169 [2020-10-16 01:30:49,305 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:49,507 INFO L129 PetriNetUnfolder]: 84/203 cut-off events. [2020-10-16 01:30:49,508 INFO L130 PetriNetUnfolder]: For 460/462 co-relation queries the response was YES. [2020-10-16 01:30:49,509 INFO L80 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 203 events. 84/203 cut-off events. For 460/462 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 965 event pairs, 16 based on Foata normal form. 10/206 useless extension candidates. Maximal degree in co-relation 726. Up to 112 conditions per place. [2020-10-16 01:30:49,511 INFO L132 encePairwiseOnDemand]: 161/169 looper letters, 10 selfloop transitions, 13 changer transitions 5/43 dead transitions. [2020-10-16 01:30:49,511 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 43 transitions, 297 flow [2020-10-16 01:30:49,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:30:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:30:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 864 transitions. [2020-10-16 01:30:49,514 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7303465765004227 [2020-10-16 01:30:49,514 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 864 transitions. [2020-10-16 01:30:49,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 864 transitions. [2020-10-16 01:30:49,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:49,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 864 transitions. [2020-10-16 01:30:49,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:30:49,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:30:49,519 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:30:49,519 INFO L185 Difference]: Start difference. First operand has 46 places, 30 transitions, 159 flow. Second operand 7 states and 864 transitions. [2020-10-16 01:30:49,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 43 transitions, 297 flow [2020-10-16 01:30:49,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 282 flow, removed 4 selfloop flow, removed 3 redundant places. [2020-10-16 01:30:49,523 INFO L241 Difference]: Finished difference. Result has 51 places, 36 transitions, 235 flow [2020-10-16 01:30:49,523 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2020-10-16 01:30:49,524 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2020-10-16 01:30:49,524 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 235 flow [2020-10-16 01:30:49,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:30:49,524 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:49,524 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:49,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:30:49,524 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:49,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:49,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1332546551, now seen corresponding path program 2 times [2020-10-16 01:30:49,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:49,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806528047] [2020-10-16 01:30:49,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:49,652 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:30:49,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806528047] [2020-10-16 01:30:49,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:49,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:30:49,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83130828] [2020-10-16 01:30:49,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:30:49,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:49,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:30:49,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:30:49,656 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 169 [2020-10-16 01:30:49,657 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 235 flow. Second operand 7 states. [2020-10-16 01:30:49,657 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:49,657 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 169 [2020-10-16 01:30:49,657 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:49,865 INFO L129 PetriNetUnfolder]: 80/205 cut-off events. [2020-10-16 01:30:49,865 INFO L130 PetriNetUnfolder]: For 795/799 co-relation queries the response was YES. [2020-10-16 01:30:49,867 INFO L80 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 205 events. 80/205 cut-off events. For 795/799 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1009 event pairs, 10 based on Foata normal form. 14/212 useless extension candidates. Maximal degree in co-relation 890. Up to 90 conditions per place. [2020-10-16 01:30:49,869 INFO L132 encePairwiseOnDemand]: 162/169 looper letters, 14 selfloop transitions, 15 changer transitions 6/50 dead transitions. [2020-10-16 01:30:49,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 416 flow [2020-10-16 01:30:49,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:30:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:30:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions. [2020-10-16 01:30:49,873 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7125950972104819 [2020-10-16 01:30:49,873 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 843 transitions. [2020-10-16 01:30:49,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions. [2020-10-16 01:30:49,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:49,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions. [2020-10-16 01:30:49,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:30:49,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:30:49,878 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:30:49,878 INFO L185 Difference]: Start difference. First operand has 51 places, 36 transitions, 235 flow. Second operand 7 states and 843 transitions. [2020-10-16 01:30:49,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 416 flow [2020-10-16 01:30:49,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 389 flow, removed 13 selfloop flow, removed 4 redundant places. [2020-10-16 01:30:49,884 INFO L241 Difference]: Finished difference. Result has 54 places, 41 transitions, 304 flow [2020-10-16 01:30:49,884 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2020-10-16 01:30:49,884 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2020-10-16 01:30:49,884 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 304 flow [2020-10-16 01:30:49,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:30:49,885 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:49,885 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:49,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:30:49,885 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:49,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:49,886 INFO L82 PathProgramCache]: Analyzing trace with hash -899926196, now seen corresponding path program 1 times [2020-10-16 01:30:49,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:49,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615220983] [2020-10-16 01:30:49,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:50,006 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:30:50,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615220983] [2020-10-16 01:30:50,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:50,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:30:50,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782750924] [2020-10-16 01:30:50,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:30:50,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:50,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:30:50,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:30:50,012 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 169 [2020-10-16 01:30:50,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 304 flow. Second operand 7 states. [2020-10-16 01:30:50,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:50,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 169 [2020-10-16 01:30:50,013 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:50,189 INFO L129 PetriNetUnfolder]: 75/190 cut-off events. [2020-10-16 01:30:50,189 INFO L130 PetriNetUnfolder]: For 744/751 co-relation queries the response was YES. [2020-10-16 01:30:50,191 INFO L80 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 190 events. 75/190 cut-off events. For 744/751 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 915 event pairs, 9 based on Foata normal form. 10/193 useless extension candidates. Maximal degree in co-relation 929. Up to 107 conditions per place. [2020-10-16 01:30:50,194 INFO L132 encePairwiseOnDemand]: 161/169 looper letters, 19 selfloop transitions, 10 changer transitions 2/46 dead transitions. [2020-10-16 01:30:50,194 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 420 flow [2020-10-16 01:30:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:30:50,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:30:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 819 transitions. [2020-10-16 01:30:50,197 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2020-10-16 01:30:50,198 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 819 transitions. [2020-10-16 01:30:50,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 819 transitions. [2020-10-16 01:30:50,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:50,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 819 transitions. [2020-10-16 01:30:50,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:30:50,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:30:50,203 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:30:50,203 INFO L185 Difference]: Start difference. First operand has 54 places, 41 transitions, 304 flow. Second operand 7 states and 819 transitions. [2020-10-16 01:30:50,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 420 flow [2020-10-16 01:30:50,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 397 flow, removed 10 selfloop flow, removed 3 redundant places. [2020-10-16 01:30:50,209 INFO L241 Difference]: Finished difference. Result has 58 places, 42 transitions, 330 flow [2020-10-16 01:30:50,209 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=330, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2020-10-16 01:30:50,210 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2020-10-16 01:30:50,210 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 330 flow [2020-10-16 01:30:50,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:30:50,210 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:50,210 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:50,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:30:50,211 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:50,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:50,211 INFO L82 PathProgramCache]: Analyzing trace with hash 351584322, now seen corresponding path program 2 times [2020-10-16 01:30:50,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:50,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697838098] [2020-10-16 01:30:50,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:50,369 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:30:50,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697838098] [2020-10-16 01:30:50,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:50,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:30:50,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615772271] [2020-10-16 01:30:50,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:30:50,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:50,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:30:50,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:30:50,373 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 169 [2020-10-16 01:30:50,375 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 330 flow. Second operand 8 states. [2020-10-16 01:30:50,375 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:50,375 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 169 [2020-10-16 01:30:50,375 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:50,570 INFO L129 PetriNetUnfolder]: 77/206 cut-off events. [2020-10-16 01:30:50,570 INFO L130 PetriNetUnfolder]: For 824/828 co-relation queries the response was YES. [2020-10-16 01:30:50,572 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 206 events. 77/206 cut-off events. For 824/828 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1033 event pairs, 4 based on Foata normal form. 8/207 useless extension candidates. Maximal degree in co-relation 1003. Up to 103 conditions per place. [2020-10-16 01:30:50,575 INFO L132 encePairwiseOnDemand]: 163/169 looper letters, 23 selfloop transitions, 10 changer transitions 2/50 dead transitions. [2020-10-16 01:30:50,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 482 flow [2020-10-16 01:30:50,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:30:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:30:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 825 transitions. [2020-10-16 01:30:50,579 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6973795435333897 [2020-10-16 01:30:50,579 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 825 transitions. [2020-10-16 01:30:50,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 825 transitions. [2020-10-16 01:30:50,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:50,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 825 transitions. [2020-10-16 01:30:50,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:30:50,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:30:50,585 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:30:50,585 INFO L185 Difference]: Start difference. First operand has 58 places, 42 transitions, 330 flow. Second operand 7 states and 825 transitions. [2020-10-16 01:30:50,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 482 flow [2020-10-16 01:30:50,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 50 transitions, 451 flow, removed 7 selfloop flow, removed 5 redundant places. [2020-10-16 01:30:50,593 INFO L241 Difference]: Finished difference. Result has 60 places, 44 transitions, 363 flow [2020-10-16 01:30:50,593 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=363, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2020-10-16 01:30:50,594 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2020-10-16 01:30:50,594 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 363 flow [2020-10-16 01:30:50,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:30:50,594 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:50,594 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:50,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:30:50,595 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:50,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:50,595 INFO L82 PathProgramCache]: Analyzing trace with hash -832650430, now seen corresponding path program 1 times [2020-10-16 01:30:50,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:50,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569937370] [2020-10-16 01:30:50,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:50,702 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:30:50,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569937370] [2020-10-16 01:30:50,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:50,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:30:50,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029647192] [2020-10-16 01:30:50,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:30:50,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:50,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:30:50,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:30:50,706 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 169 [2020-10-16 01:30:50,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 363 flow. Second operand 4 states. [2020-10-16 01:30:50,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:50,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 169 [2020-10-16 01:30:50,706 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:50,806 INFO L129 PetriNetUnfolder]: 135/336 cut-off events. [2020-10-16 01:30:50,806 INFO L130 PetriNetUnfolder]: For 1379/1471 co-relation queries the response was YES. [2020-10-16 01:30:50,810 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 336 events. 135/336 cut-off events. For 1379/1471 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1961 event pairs, 16 based on Foata normal form. 52/355 useless extension candidates. Maximal degree in co-relation 1361. Up to 96 conditions per place. [2020-10-16 01:30:50,813 INFO L132 encePairwiseOnDemand]: 163/169 looper letters, 10 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2020-10-16 01:30:50,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 407 flow [2020-10-16 01:30:50,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:30:50,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:30:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2020-10-16 01:30:50,815 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8150887573964497 [2020-10-16 01:30:50,815 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2020-10-16 01:30:50,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2020-10-16 01:30:50,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:50,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2020-10-16 01:30:50,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:30:50,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:30:50,819 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:30:50,819 INFO L185 Difference]: Start difference. First operand has 60 places, 44 transitions, 363 flow. Second operand 4 states and 551 transitions. [2020-10-16 01:30:50,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 407 flow [2020-10-16 01:30:50,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 380 flow, removed 9 selfloop flow, removed 4 redundant places. [2020-10-16 01:30:50,825 INFO L241 Difference]: Finished difference. Result has 59 places, 48 transitions, 382 flow [2020-10-16 01:30:50,826 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=382, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2020-10-16 01:30:50,826 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2020-10-16 01:30:50,827 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 382 flow [2020-10-16 01:30:50,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:30:50,827 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:50,827 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:50,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:30:50,827 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:50,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:50,828 INFO L82 PathProgramCache]: Analyzing trace with hash 327788179, now seen corresponding path program 1 times [2020-10-16 01:30:50,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:50,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996376057] [2020-10-16 01:30:50,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:50,898 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:30:50,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996376057] [2020-10-16 01:30:50,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:50,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:30:50,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188008933] [2020-10-16 01:30:50,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:30:50,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:30:50,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:30:50,901 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 169 [2020-10-16 01:30:50,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 382 flow. Second operand 5 states. [2020-10-16 01:30:50,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:50,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 169 [2020-10-16 01:30:50,902 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:51,023 INFO L129 PetriNetUnfolder]: 60/200 cut-off events. [2020-10-16 01:30:51,024 INFO L130 PetriNetUnfolder]: For 667/1052 co-relation queries the response was YES. [2020-10-16 01:30:51,025 INFO L80 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 200 events. 60/200 cut-off events. For 667/1052 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1072 event pairs, 3 based on Foata normal form. 60/231 useless extension candidates. Maximal degree in co-relation 798. Up to 98 conditions per place. [2020-10-16 01:30:51,027 INFO L132 encePairwiseOnDemand]: 163/169 looper letters, 10 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2020-10-16 01:30:51,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 49 transitions, 386 flow [2020-10-16 01:30:51,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:30:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:30:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2020-10-16 01:30:51,031 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8153846153846154 [2020-10-16 01:30:51,031 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2020-10-16 01:30:51,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2020-10-16 01:30:51,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:51,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2020-10-16 01:30:51,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:30:51,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:30:51,035 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:30:51,035 INFO L185 Difference]: Start difference. First operand has 59 places, 48 transitions, 382 flow. Second operand 5 states and 689 transitions. [2020-10-16 01:30:51,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 49 transitions, 386 flow [2020-10-16 01:30:51,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 370 flow, removed 1 selfloop flow, removed 4 redundant places. [2020-10-16 01:30:51,044 INFO L241 Difference]: Finished difference. Result has 61 places, 46 transitions, 364 flow [2020-10-16 01:30:51,045 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=364, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2020-10-16 01:30:51,045 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 28 predicate places. [2020-10-16 01:30:51,045 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 364 flow [2020-10-16 01:30:51,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:30:51,045 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:51,045 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:30:51,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:30:51,046 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:51,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:51,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1035350767, now seen corresponding path program 1 times [2020-10-16 01:30:51,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:51,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266903253] [2020-10-16 01:30:51,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:51,138 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:30:51,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266903253] [2020-10-16 01:30:51,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:51,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:30:51,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682201096] [2020-10-16 01:30:51,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:30:51,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:51,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:30:51,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:30:51,141 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 169 [2020-10-16 01:30:51,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 364 flow. Second operand 4 states. [2020-10-16 01:30:51,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:51,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 169 [2020-10-16 01:30:51,142 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:51,228 INFO L129 PetriNetUnfolder]: 87/280 cut-off events. [2020-10-16 01:30:51,229 INFO L130 PetriNetUnfolder]: For 1087/1306 co-relation queries the response was YES. [2020-10-16 01:30:51,231 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 280 events. 87/280 cut-off events. For 1087/1306 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1723 event pairs, 3 based on Foata normal form. 30/268 useless extension candidates. Maximal degree in co-relation 1246. Up to 156 conditions per place. [2020-10-16 01:30:51,232 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 6 selfloop transitions, 3 changer transitions 3/50 dead transitions. [2020-10-16 01:30:51,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 50 transitions, 429 flow [2020-10-16 01:30:51,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:30:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:30:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2020-10-16 01:30:51,236 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8177514792899409 [2020-10-16 01:30:51,236 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2020-10-16 01:30:51,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2020-10-16 01:30:51,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:51,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2020-10-16 01:30:51,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:30:51,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:30:51,240 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:30:51,240 INFO L185 Difference]: Start difference. First operand has 61 places, 46 transitions, 364 flow. Second operand 5 states and 691 transitions. [2020-10-16 01:30:51,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 50 transitions, 429 flow [2020-10-16 01:30:51,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 50 transitions, 413 flow, removed 5 selfloop flow, removed 2 redundant places. [2020-10-16 01:30:51,248 INFO L241 Difference]: Finished difference. Result has 66 places, 46 transitions, 367 flow [2020-10-16 01:30:51,249 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=367, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2020-10-16 01:30:51,249 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 33 predicate places. [2020-10-16 01:30:51,249 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 367 flow [2020-10-16 01:30:51,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:30:51,249 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:51,249 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:51,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:30:51,250 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:51,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:51,250 INFO L82 PathProgramCache]: Analyzing trace with hash -149681866, now seen corresponding path program 1 times [2020-10-16 01:30:51,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:51,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044193660] [2020-10-16 01:30:51,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:51,323 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:30:51,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044193660] [2020-10-16 01:30:51,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:51,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:30:51,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99877282] [2020-10-16 01:30:51,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:30:51,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:51,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:30:51,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:30:51,327 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 169 [2020-10-16 01:30:51,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 367 flow. Second operand 5 states. [2020-10-16 01:30:51,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:51,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 169 [2020-10-16 01:30:51,328 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:51,446 INFO L129 PetriNetUnfolder]: 158/477 cut-off events. [2020-10-16 01:30:51,446 INFO L130 PetriNetUnfolder]: For 1677/1880 co-relation queries the response was YES. [2020-10-16 01:30:51,449 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 477 events. 158/477 cut-off events. For 1677/1880 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 3450 event pairs, 8 based on Foata normal form. 41/443 useless extension candidates. Maximal degree in co-relation 1920. Up to 244 conditions per place. [2020-10-16 01:30:51,452 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 8 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2020-10-16 01:30:51,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 52 transitions, 466 flow [2020-10-16 01:30:51,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:30:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:30:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 676 transitions. [2020-10-16 01:30:51,455 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8 [2020-10-16 01:30:51,455 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 676 transitions. [2020-10-16 01:30:51,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 676 transitions. [2020-10-16 01:30:51,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:51,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 676 transitions. [2020-10-16 01:30:51,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:30:51,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:30:51,459 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:30:51,459 INFO L185 Difference]: Start difference. First operand has 66 places, 46 transitions, 367 flow. Second operand 5 states and 676 transitions. [2020-10-16 01:30:51,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 52 transitions, 466 flow [2020-10-16 01:30:51,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 52 transitions, 449 flow, removed 7 selfloop flow, removed 3 redundant places. [2020-10-16 01:30:51,467 INFO L241 Difference]: Finished difference. Result has 68 places, 47 transitions, 375 flow [2020-10-16 01:30:51,468 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=375, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2020-10-16 01:30:51,468 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 35 predicate places. [2020-10-16 01:30:51,468 INFO L481 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 375 flow [2020-10-16 01:30:51,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:30:51,468 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:51,468 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:51,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:30:51,469 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:51,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:51,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1253390242, now seen corresponding path program 2 times [2020-10-16 01:30:51,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:51,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621533577] [2020-10-16 01:30:51,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:51,533 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:30:51,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621533577] [2020-10-16 01:30:51,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:51,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:30:51,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114625387] [2020-10-16 01:30:51,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:30:51,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:51,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:30:51,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:30:51,536 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 169 [2020-10-16 01:30:51,537 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 375 flow. Second operand 6 states. [2020-10-16 01:30:51,537 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:51,537 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 169 [2020-10-16 01:30:51,537 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:51,662 INFO L129 PetriNetUnfolder]: 127/385 cut-off events. [2020-10-16 01:30:51,662 INFO L130 PetriNetUnfolder]: For 1295/2329 co-relation queries the response was YES. [2020-10-16 01:30:51,665 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1639 conditions, 385 events. 127/385 cut-off events. For 1295/2329 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 2742 event pairs, 0 based on Foata normal form. 139/449 useless extension candidates. Maximal degree in co-relation 1613. Up to 209 conditions per place. [2020-10-16 01:30:51,666 INFO L132 encePairwiseOnDemand]: 163/169 looper letters, 4 selfloop transitions, 11 changer transitions 11/46 dead transitions. [2020-10-16 01:30:51,667 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 46 transitions, 381 flow [2020-10-16 01:30:51,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:30:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:30:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 821 transitions. [2020-10-16 01:30:51,670 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8096646942800789 [2020-10-16 01:30:51,670 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 821 transitions. [2020-10-16 01:30:51,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 821 transitions. [2020-10-16 01:30:51,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:51,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 821 transitions. [2020-10-16 01:30:51,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:30:51,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:30:51,674 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:30:51,674 INFO L185 Difference]: Start difference. First operand has 68 places, 47 transitions, 375 flow. Second operand 6 states and 821 transitions. [2020-10-16 01:30:51,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 46 transitions, 381 flow [2020-10-16 01:30:51,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 46 transitions, 345 flow, removed 15 selfloop flow, removed 5 redundant places. [2020-10-16 01:30:51,680 INFO L241 Difference]: Finished difference. Result has 69 places, 35 transitions, 262 flow [2020-10-16 01:30:51,680 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=69, PETRI_TRANSITIONS=35} [2020-10-16 01:30:51,680 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 36 predicate places. [2020-10-16 01:30:51,680 INFO L481 AbstractCegarLoop]: Abstraction has has 69 places, 35 transitions, 262 flow [2020-10-16 01:30:51,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:30:51,680 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:51,681 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] [2020-10-16 01:30:51,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:30:51,681 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:51,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:51,681 INFO L82 PathProgramCache]: Analyzing trace with hash -512070087, now seen corresponding path program 1 times [2020-10-16 01:30:51,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:51,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739485387] [2020-10-16 01:30:51,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:30:51,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:30:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:30:51,815 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:30:51,884 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:30:51,885 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:30:51,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:30:51,917 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:30:51,917 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,919 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:30:51,919 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,920 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:30:51,920 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,920 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:30:51,921 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,921 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:30:51,921 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,921 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:30:51,921 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,922 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:30:51,922 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,923 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:30:51,923 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,923 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:30:51,923 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,923 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:30:51,923 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,924 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:30:51,924 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,925 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:30:51,925 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,926 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:30:51,926 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,926 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:30:51,926 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,926 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:30:51,926 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,927 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:30:51,927 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,927 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:30:51,927 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,928 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:30:51,928 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,932 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:30:51,932 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,933 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:30:51,933 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,933 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:30:51,933 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,934 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:30:51,934 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,934 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:30:51,934 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,935 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:30:51,935 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,935 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:30:51,935 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,936 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:30:51,936 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,936 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:30:51,937 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,937 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:30:51,937 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,937 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:30:51,938 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,938 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:30:51,938 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:51,938 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:30:51,938 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:52,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:30:52 BasicIcfg [2020-10-16 01:30:52,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:30:52,063 INFO L168 Benchmark]: Toolchain (without parser) took 12214.91 ms. Allocated memory was 249.6 MB in the beginning and 553.6 MB in the end (delta: 304.1 MB). Free memory was 205.5 MB in the beginning and 286.4 MB in the end (delta: -80.9 MB). Peak memory consumption was 223.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:52,064 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:30:52,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 888.22 ms. Allocated memory was 249.6 MB in the beginning and 310.4 MB in the end (delta: 60.8 MB). Free memory was 205.5 MB in the beginning and 262.8 MB in the end (delta: -57.2 MB). Peak memory consumption was 36.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:52,066 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.28 ms. Allocated memory is still 310.4 MB. Free memory was 262.8 MB in the beginning and 260.2 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:30:52,068 INFO L168 Benchmark]: Boogie Preprocessor took 44.32 ms. Allocated memory is still 310.4 MB. Free memory was 260.2 MB in the beginning and 257.7 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:30:52,069 INFO L168 Benchmark]: RCFGBuilder took 2157.73 ms. Allocated memory was 310.4 MB in the beginning and 354.4 MB in the end (delta: 44.0 MB). Free memory was 257.7 MB in the beginning and 212.9 MB in the end (delta: 44.8 MB). Peak memory consumption was 101.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:52,072 INFO L168 Benchmark]: TraceAbstraction took 9026.14 ms. Allocated memory was 354.4 MB in the beginning and 553.6 MB in the end (delta: 199.2 MB). Free memory was 209.6 MB in the beginning and 286.4 MB in the end (delta: -76.8 MB). Peak memory consumption was 122.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:52,081 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.22 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 888.22 ms. Allocated memory was 249.6 MB in the beginning and 310.4 MB in the end (delta: 60.8 MB). Free memory was 205.5 MB in the beginning and 262.8 MB in the end (delta: -57.2 MB). Peak memory consumption was 36.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 90.28 ms. Allocated memory is still 310.4 MB. Free memory was 262.8 MB in the beginning and 260.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 44.32 ms. Allocated memory is still 310.4 MB. Free memory was 260.2 MB in the beginning and 257.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2157.73 ms. Allocated memory was 310.4 MB in the beginning and 354.4 MB in the end (delta: 44.0 MB). Free memory was 257.7 MB in the beginning and 212.9 MB in the end (delta: 44.8 MB). Peak memory consumption was 101.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 9026.14 ms. Allocated memory was 354.4 MB in the beginning and 553.6 MB in the end (delta: 199.2 MB). Free memory was 209.6 MB in the beginning and 286.4 MB in the end (delta: -76.8 MB). Peak memory consumption was 122.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1055 VarBasedMoverChecksPositive, 64 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 36 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 133 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.2s, 96 PlacesBefore, 33 PlacesAfterwards, 88 TransitionsBefore, 24 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 3968 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L724] 0 int z = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1492; [L803] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t1493; [L805] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 0 pthread_t t1494; [L807] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 3 y$w_buff1 = y$w_buff0 [L766] 3 y$w_buff0 = 2 [L767] 3 y$w_buff1_used = y$w_buff0_used [L768] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L770] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L771] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L772] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L773] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L774] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L730] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L780] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L740] 1 return 0; [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 2 return 0; [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 3 return 0; [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L813] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L815] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L817] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L827] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 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: 8.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 69 SDtfs, 49 SDslu, 58 SDs, 0 SdLazy, 341 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=10, 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.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 12874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...