/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/mix027_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:21:56,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:21:56,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:21:56,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:21:56,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:21:56,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:21:56,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:21:56,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:21:56,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:21:56,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:21:56,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:21:56,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:21:56,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:21:56,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:21:56,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:21:56,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:21:56,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:21:56,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:21:56,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:21:56,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:21:56,148 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:21:56,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:21:56,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:21:56,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:21:56,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:21:56,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:21:56,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:21:56,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:21:56,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:21:56,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:21:56,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:21:56,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:21:56,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:21:56,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:21:56,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:21:56,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:21:56,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:21:56,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:21:56,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:21:56,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:21:56,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:21:56,177 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:21:56,226 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:21:56,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:21:56,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:21:56,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:21:56,228 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:21:56,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:21:56,229 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:21:56,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:21:56,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:21:56,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:21:56,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:21:56,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:21:56,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:21:56,232 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:21:56,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:21:56,232 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:21:56,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:21:56,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:21:56,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:21:56,233 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:21:56,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:21:56,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:21:56,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:21:56,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:21:56,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:21:56,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:21:56,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:21:56,235 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:21:56,235 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:21:56,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:21:56,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:21:56,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:21:56,558 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:21:56,558 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:21:56,559 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i [2020-10-16 01:21:56,639 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1ab08aa4/ec10362d70d04ccb9add6a7246c4fbfc/FLAG875474f69 [2020-10-16 01:21:57,192 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:21:57,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i [2020-10-16 01:21:57,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1ab08aa4/ec10362d70d04ccb9add6a7246c4fbfc/FLAG875474f69 [2020-10-16 01:21:57,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1ab08aa4/ec10362d70d04ccb9add6a7246c4fbfc [2020-10-16 01:21:57,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:21:57,507 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:21:57,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:21:57,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:21:57,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:21:57,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:21:57" (1/1) ... [2020-10-16 01:21:57,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61049a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:57, skipping insertion in model container [2020-10-16 01:21:57,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:21:57" (1/1) ... [2020-10-16 01:21:57,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:21:57,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:21:58,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:21:58,129 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:21:58,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:21:58,288 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:21:58,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:58 WrapperNode [2020-10-16 01:21:58,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:21:58,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:21:58,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:21:58,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:21:58,301 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:21:58" (1/1) ... [2020-10-16 01:21:58,322 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:21:58" (1/1) ... [2020-10-16 01:21:58,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:21:58,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:21:58,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:21:58,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:21:58,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:58" (1/1) ... [2020-10-16 01:21:58,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:58" (1/1) ... [2020-10-16 01:21:58,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:58" (1/1) ... [2020-10-16 01:21:58,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:58" (1/1) ... [2020-10-16 01:21:58,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:58" (1/1) ... [2020-10-16 01:21:58,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:58" (1/1) ... [2020-10-16 01:21:58,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:58" (1/1) ... [2020-10-16 01:21:58,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:21:58,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:21:58,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:21:58,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:21:58,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:58" (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:21:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:21:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:21:58,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:21:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:21:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:21:58,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:21:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:21:58,491 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:21:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:21:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:21:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 01:21:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 01:21:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:21:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:21:58,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:21:58,495 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:22:00,815 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:22:00,816 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:22:00,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:22:00 BoogieIcfgContainer [2020-10-16 01:22:00,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:22:00,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:22:00,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:22:00,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:22:00,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:21:57" (1/3) ... [2020-10-16 01:22:00,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8b2d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:22:00, skipping insertion in model container [2020-10-16 01:22:00,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:58" (2/3) ... [2020-10-16 01:22:00,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8b2d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:22:00, skipping insertion in model container [2020-10-16 01:22:00,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:22:00" (3/3) ... [2020-10-16 01:22:00,828 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_tso.opt.i [2020-10-16 01:22:00,840 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:22:00,849 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:22:00,850 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:22:00,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,886 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,887 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,891 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,891 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,891 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,892 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,895 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,895 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,898 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,898 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,899 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,899 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,899 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,899 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,900 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,900 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,900 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,900 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,900 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,901 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,901 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,936 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,936 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,942 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,942 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,942 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,947 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,947 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,950 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,951 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,951 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,951 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,951 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,951 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,952 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,952 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,952 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,952 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:00,973 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 01:22:00,996 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:22:00,996 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:22:00,997 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:22:01,001 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:22:01,001 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:22:01,001 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:22:01,002 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:22:01,008 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:22:01,026 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-16 01:22:01,100 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-16 01:22:01,100 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:22:01,108 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-10-16 01:22:01,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow [2020-10-16 01:22:01,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow [2020-10-16 01:22:01,123 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:22:01,126 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow [2020-10-16 01:22:01,129 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow [2020-10-16 01:22:01,130 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow [2020-10-16 01:22:01,177 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-16 01:22:01,177 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:22:01,178 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-10-16 01:22:01,183 INFO L117 LiptonReduction]: Number of co-enabled transitions 2706 [2020-10-16 01:22:01,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:01,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:01,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:01,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:01,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:01,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:01,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:01,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:01,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:01,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:01,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:01,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:01,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:01,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:01,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:01,886 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:22:02,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:22:02,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:02,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:02,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:02,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:02,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:02,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:02,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:02,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:02,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:02,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:02,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:02,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:02,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:02,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:02,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:02,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:02,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:02,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:02,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:02,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:02,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:02,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:02,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:02,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:02,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:02,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:02,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:02,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:02,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:03,294 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 01:22:03,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:03,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:03,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:03,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:03,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:03,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:03,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:03,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:03,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:03,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:03,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:03,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:03,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:03,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:03,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:03,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:03,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:03,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:03,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:03,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:03,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:03,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:03,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:03,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:03,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:03,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:03,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:03,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:03,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:03,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:03,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:03,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:03,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:03,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:03,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:03,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:03,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:03,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:03,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:03,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:03,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:03,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:03,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-16 01:22:03,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:03,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:03,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:03,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:03,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:04,826 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 01:22:04,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 01:22:04,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:04,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:04,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:06,064 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-16 01:22:06,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:06,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:06,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:06,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:06,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:06,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:06,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:06,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:06,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:06,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:06,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:06,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:06,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:06,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:06,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:06,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:06,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:22:06,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:07,218 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-16 01:22:07,595 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-16 01:22:08,249 WARN L193 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 111 [2020-10-16 01:22:08,576 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-16 01:22:08,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:08,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:08,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:08,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:08,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:08,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:08,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:08,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:08,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:08,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:08,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:08,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:08,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:08,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:08,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:08,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:08,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:08,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:08,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:08,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:08,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:08,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:08,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:08,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:08,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:08,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:09,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:09,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:09,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:09,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:09,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:09,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:09,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:09,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:09,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:09,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:09,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:09,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:09,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:09,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:09,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:09,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:09,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:09,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:09,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:09,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:09,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:09,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:09,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:09,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:09,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:09,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:09,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:09,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:09,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:09,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:09,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:09,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:09,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:09,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:09,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:09,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:09,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:10,606 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-16 01:22:11,007 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 01:22:11,983 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-10-16 01:22:12,304 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-10-16 01:22:12,694 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-16 01:22:12,833 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-16 01:22:12,860 INFO L132 LiptonReduction]: Checked pairs total: 7733 [2020-10-16 01:22:12,860 INFO L134 LiptonReduction]: Total number of compositions: 88 [2020-10-16 01:22:12,873 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11752 [2020-10-16 01:22:12,885 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2020-10-16 01:22:12,886 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:22:12,886 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:12,887 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 01:22:12,887 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:12,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1147105433, now seen corresponding path program 1 times [2020-10-16 01:22:12,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:12,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620277120] [2020-10-16 01:22:12,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:13,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:22:13,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620277120] [2020-10-16 01:22:13,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:13,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:22:13,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44957003] [2020-10-16 01:22:13,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:22:13,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:13,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:22:13,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:22:13,165 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 200 [2020-10-16 01:22:13,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states. [2020-10-16 01:22:13,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:13,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 200 [2020-10-16 01:22:13,169 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:13,352 INFO L129 PetriNetUnfolder]: 185/370 cut-off events. [2020-10-16 01:22:13,352 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:22:13,354 INFO L80 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 370 events. 185/370 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2009 event pairs, 41 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 654. Up to 209 conditions per place. [2020-10-16 01:22:13,361 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 11 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2020-10-16 01:22:13,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 112 flow [2020-10-16 01:22:13,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:22:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:22:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2020-10-16 01:22:13,381 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8616666666666667 [2020-10-16 01:22:13,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 517 transitions. [2020-10-16 01:22:13,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions. [2020-10-16 01:22:13,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:13,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions. [2020-10-16 01:22:13,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:22:13,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:22:13,401 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:22:13,403 INFO L185 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 517 transitions. [2020-10-16 01:22:13,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 112 flow [2020-10-16 01:22:13,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 108 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 01:22:13,410 INFO L241 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2020-10-16 01:22:13,413 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2020-10-16 01:22:13,414 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2020-10-16 01:22:13,414 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2020-10-16 01:22:13,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:22:13,414 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:13,415 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:13,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:22:13,419 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:13,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:13,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1606034959, now seen corresponding path program 1 times [2020-10-16 01:22:13,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:13,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620751028] [2020-10-16 01:22:13,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:13,557 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:22:13,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620751028] [2020-10-16 01:22:13,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:13,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:22:13,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406202463] [2020-10-16 01:22:13,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:22:13,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:13,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:22:13,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:22:13,563 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2020-10-16 01:22:13,564 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states. [2020-10-16 01:22:13,564 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:13,564 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2020-10-16 01:22:13,564 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:13,685 INFO L129 PetriNetUnfolder]: 205/382 cut-off events. [2020-10-16 01:22:13,685 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-10-16 01:22:13,687 INFO L80 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 382 events. 205/382 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1846 event pairs, 121 based on Foata normal form. 4/375 useless extension candidates. Maximal degree in co-relation 726. Up to 297 conditions per place. [2020-10-16 01:22:13,690 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 11 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2020-10-16 01:22:13,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 108 flow [2020-10-16 01:22:13,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:22:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:22:13,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2020-10-16 01:22:13,694 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.83 [2020-10-16 01:22:13,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2020-10-16 01:22:13,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2020-10-16 01:22:13,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:13,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2020-10-16 01:22:13,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:22:13,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:22:13,697 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:22:13,697 INFO L185 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 498 transitions. [2020-10-16 01:22:13,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 108 flow [2020-10-16 01:22:13,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:22:13,699 INFO L241 Difference]: Finished difference. Result has 40 places, 30 transitions, 83 flow [2020-10-16 01:22:13,699 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2020-10-16 01:22:13,700 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2020-10-16 01:22:13,700 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 83 flow [2020-10-16 01:22:13,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:22:13,700 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:13,701 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:13,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:22:13,701 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:13,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:13,701 INFO L82 PathProgramCache]: Analyzing trace with hash -252750820, now seen corresponding path program 1 times [2020-10-16 01:22:13,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:13,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860490132] [2020-10-16 01:22:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:13,778 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:22:13,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860490132] [2020-10-16 01:22:13,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:13,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:22:13,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107196949] [2020-10-16 01:22:13,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:22:13,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:13,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:22:13,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:22:13,781 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 200 [2020-10-16 01:22:13,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 83 flow. Second operand 3 states. [2020-10-16 01:22:13,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:13,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 200 [2020-10-16 01:22:13,782 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:13,805 INFO L129 PetriNetUnfolder]: 13/66 cut-off events. [2020-10-16 01:22:13,805 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 01:22:13,806 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 66 events. 13/66 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 193 event pairs, 3 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 114. Up to 24 conditions per place. [2020-10-16 01:22:13,807 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 5 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2020-10-16 01:22:13,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 103 flow [2020-10-16 01:22:13,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:22:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:22:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2020-10-16 01:22:13,810 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2020-10-16 01:22:13,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 530 transitions. [2020-10-16 01:22:13,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 530 transitions. [2020-10-16 01:22:13,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:13,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 530 transitions. [2020-10-16 01:22:13,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:22:13,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:22:13,813 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:22:13,813 INFO L185 Difference]: Start difference. First operand has 40 places, 30 transitions, 83 flow. Second operand 3 states and 530 transitions. [2020-10-16 01:22:13,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 103 flow [2020-10-16 01:22:13,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:22:13,815 INFO L241 Difference]: Finished difference. Result has 42 places, 32 transitions, 99 flow [2020-10-16 01:22:13,816 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2020-10-16 01:22:13,816 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2020-10-16 01:22:13,816 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 99 flow [2020-10-16 01:22:13,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:22:13,816 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:13,816 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:13,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:22:13,817 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:13,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:13,817 INFO L82 PathProgramCache]: Analyzing trace with hash 753539710, now seen corresponding path program 1 times [2020-10-16 01:22:13,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:13,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592722283] [2020-10-16 01:22:13,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:13,883 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:22:13,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592722283] [2020-10-16 01:22:13,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:13,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:22:13,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306785768] [2020-10-16 01:22:13,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:22:13,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:13,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:22:13,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:22:13,890 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 200 [2020-10-16 01:22:13,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 99 flow. Second operand 4 states. [2020-10-16 01:22:13,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:13,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 200 [2020-10-16 01:22:13,891 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:14,066 INFO L129 PetriNetUnfolder]: 258/498 cut-off events. [2020-10-16 01:22:14,066 INFO L130 PetriNetUnfolder]: For 169/258 co-relation queries the response was YES. [2020-10-16 01:22:14,068 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 498 events. 258/498 cut-off events. For 169/258 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2671 event pairs, 23 based on Foata normal form. 14/490 useless extension candidates. Maximal degree in co-relation 1048. Up to 325 conditions per place. [2020-10-16 01:22:14,072 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 14 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2020-10-16 01:22:14,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 149 flow [2020-10-16 01:22:14,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:22:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:22:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 655 transitions. [2020-10-16 01:22:14,076 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.81875 [2020-10-16 01:22:14,076 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 655 transitions. [2020-10-16 01:22:14,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 655 transitions. [2020-10-16 01:22:14,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:14,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 655 transitions. [2020-10-16 01:22:14,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:22:14,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:22:14,080 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:22:14,080 INFO L185 Difference]: Start difference. First operand has 42 places, 32 transitions, 99 flow. Second operand 4 states and 655 transitions. [2020-10-16 01:22:14,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 149 flow [2020-10-16 01:22:14,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:22:14,082 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 108 flow [2020-10-16 01:22:14,082 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2020-10-16 01:22:14,083 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2020-10-16 01:22:14,083 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 108 flow [2020-10-16 01:22:14,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:22:14,083 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:14,083 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:14,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:22:14,084 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:14,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:14,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1506329753, now seen corresponding path program 1 times [2020-10-16 01:22:14,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:14,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192353037] [2020-10-16 01:22:14,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:14,172 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:22:14,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192353037] [2020-10-16 01:22:14,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:14,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:22:14,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647372275] [2020-10-16 01:22:14,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:22:14,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:14,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:22:14,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:22:14,176 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 200 [2020-10-16 01:22:14,176 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 108 flow. Second operand 4 states. [2020-10-16 01:22:14,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:14,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 200 [2020-10-16 01:22:14,176 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:14,412 INFO L129 PetriNetUnfolder]: 342/627 cut-off events. [2020-10-16 01:22:14,413 INFO L130 PetriNetUnfolder]: For 491/602 co-relation queries the response was YES. [2020-10-16 01:22:14,415 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1443 conditions, 627 events. 342/627 cut-off events. For 491/602 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3315 event pairs, 190 based on Foata normal form. 12/577 useless extension candidates. Maximal degree in co-relation 1429. Up to 466 conditions per place. [2020-10-16 01:22:14,420 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 12 selfloop transitions, 10 changer transitions 0/44 dead transitions. [2020-10-16 01:22:14,421 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 190 flow [2020-10-16 01:22:14,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:22:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:22:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 656 transitions. [2020-10-16 01:22:14,424 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.82 [2020-10-16 01:22:14,424 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 656 transitions. [2020-10-16 01:22:14,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 656 transitions. [2020-10-16 01:22:14,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:14,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 656 transitions. [2020-10-16 01:22:14,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:22:14,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:22:14,429 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:22:14,429 INFO L185 Difference]: Start difference. First operand has 45 places, 32 transitions, 108 flow. Second operand 4 states and 656 transitions. [2020-10-16 01:22:14,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 190 flow [2020-10-16 01:22:14,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 180 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:22:14,434 INFO L241 Difference]: Finished difference. Result has 48 places, 41 transitions, 177 flow [2020-10-16 01:22:14,435 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2020-10-16 01:22:14,435 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2020-10-16 01:22:14,435 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 177 flow [2020-10-16 01:22:14,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:22:14,436 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:14,436 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:14,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:22:14,436 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:14,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:14,437 INFO L82 PathProgramCache]: Analyzing trace with hash -527633028, now seen corresponding path program 1 times [2020-10-16 01:22:14,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:14,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517421217] [2020-10-16 01:22:14,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:14,604 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:22:14,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517421217] [2020-10-16 01:22:14,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:14,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:22:14,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187131377] [2020-10-16 01:22:14,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:22:14,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:14,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:22:14,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:22:14,608 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 200 [2020-10-16 01:22:14,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 177 flow. Second operand 5 states. [2020-10-16 01:22:14,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:14,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 200 [2020-10-16 01:22:14,609 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:14,851 INFO L129 PetriNetUnfolder]: 340/634 cut-off events. [2020-10-16 01:22:14,851 INFO L130 PetriNetUnfolder]: For 1087/1405 co-relation queries the response was YES. [2020-10-16 01:22:14,856 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1816 conditions, 634 events. 340/634 cut-off events. For 1087/1405 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3395 event pairs, 165 based on Foata normal form. 30/606 useless extension candidates. Maximal degree in co-relation 1800. Up to 446 conditions per place. [2020-10-16 01:22:14,862 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 16 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2020-10-16 01:22:14,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 261 flow [2020-10-16 01:22:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:22:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:22:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 652 transitions. [2020-10-16 01:22:14,867 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.815 [2020-10-16 01:22:14,867 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 652 transitions. [2020-10-16 01:22:14,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 652 transitions. [2020-10-16 01:22:14,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:14,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 652 transitions. [2020-10-16 01:22:14,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:22:14,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:22:14,873 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:22:14,874 INFO L185 Difference]: Start difference. First operand has 48 places, 41 transitions, 177 flow. Second operand 4 states and 652 transitions. [2020-10-16 01:22:14,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 261 flow [2020-10-16 01:22:14,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 261 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 01:22:14,881 INFO L241 Difference]: Finished difference. Result has 52 places, 45 transitions, 231 flow [2020-10-16 01:22:14,882 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2020-10-16 01:22:14,882 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2020-10-16 01:22:14,882 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 231 flow [2020-10-16 01:22:14,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:22:14,883 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:14,883 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:14,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:22:14,884 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:14,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:14,884 INFO L82 PathProgramCache]: Analyzing trace with hash 450722164, now seen corresponding path program 1 times [2020-10-16 01:22:14,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:14,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229674751] [2020-10-16 01:22:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:15,015 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:22:15,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229674751] [2020-10-16 01:22:15,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:15,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:22:15,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187569263] [2020-10-16 01:22:15,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:22:15,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:15,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:22:15,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:22:15,018 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 200 [2020-10-16 01:22:15,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 231 flow. Second operand 5 states. [2020-10-16 01:22:15,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:15,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 200 [2020-10-16 01:22:15,020 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:15,256 INFO L129 PetriNetUnfolder]: 352/641 cut-off events. [2020-10-16 01:22:15,257 INFO L130 PetriNetUnfolder]: For 1703/2391 co-relation queries the response was YES. [2020-10-16 01:22:15,260 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2200 conditions, 641 events. 352/641 cut-off events. For 1703/2391 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3368 event pairs, 101 based on Foata normal form. 37/625 useless extension candidates. Maximal degree in co-relation 2181. Up to 418 conditions per place. [2020-10-16 01:22:15,266 INFO L132 encePairwiseOnDemand]: 192/200 looper letters, 18 selfloop transitions, 15 changer transitions 0/55 dead transitions. [2020-10-16 01:22:15,267 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 55 transitions, 347 flow [2020-10-16 01:22:15,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:22:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:22:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 653 transitions. [2020-10-16 01:22:15,270 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.81625 [2020-10-16 01:22:15,270 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 653 transitions. [2020-10-16 01:22:15,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 653 transitions. [2020-10-16 01:22:15,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:15,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 653 transitions. [2020-10-16 01:22:15,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:22:15,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:22:15,274 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:22:15,274 INFO L185 Difference]: Start difference. First operand has 52 places, 45 transitions, 231 flow. Second operand 4 states and 653 transitions. [2020-10-16 01:22:15,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 55 transitions, 347 flow [2020-10-16 01:22:15,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 331 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:22:15,279 INFO L241 Difference]: Finished difference. Result has 55 places, 51 transitions, 310 flow [2020-10-16 01:22:15,280 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2020-10-16 01:22:15,280 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2020-10-16 01:22:15,280 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 310 flow [2020-10-16 01:22:15,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:22:15,280 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:15,281 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:15,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:22:15,281 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:15,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:15,281 INFO L82 PathProgramCache]: Analyzing trace with hash -73095305, now seen corresponding path program 1 times [2020-10-16 01:22:15,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:15,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415910118] [2020-10-16 01:22:15,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:15,405 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:22:15,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415910118] [2020-10-16 01:22:15,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:15,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:22:15,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169578536] [2020-10-16 01:22:15,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:22:15,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:15,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:22:15,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:22:15,409 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 200 [2020-10-16 01:22:15,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 310 flow. Second operand 6 states. [2020-10-16 01:22:15,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:15,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 200 [2020-10-16 01:22:15,410 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:15,748 INFO L129 PetriNetUnfolder]: 380/711 cut-off events. [2020-10-16 01:22:15,748 INFO L130 PetriNetUnfolder]: For 3179/4577 co-relation queries the response was YES. [2020-10-16 01:22:15,755 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2861 conditions, 711 events. 380/711 cut-off events. For 3179/4577 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3833 event pairs, 28 based on Foata normal form. 69/728 useless extension candidates. Maximal degree in co-relation 2840. Up to 368 conditions per place. [2020-10-16 01:22:15,766 INFO L132 encePairwiseOnDemand]: 192/200 looper letters, 17 selfloop transitions, 26 changer transitions 0/65 dead transitions. [2020-10-16 01:22:15,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 492 flow [2020-10-16 01:22:15,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:22:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:22:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 806 transitions. [2020-10-16 01:22:15,771 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.806 [2020-10-16 01:22:15,772 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 806 transitions. [2020-10-16 01:22:15,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 806 transitions. [2020-10-16 01:22:15,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:15,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 806 transitions. [2020-10-16 01:22:15,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:22:15,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:22:15,779 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:22:15,779 INFO L185 Difference]: Start difference. First operand has 55 places, 51 transitions, 310 flow. Second operand 5 states and 806 transitions. [2020-10-16 01:22:15,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 492 flow [2020-10-16 01:22:15,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 459 flow, removed 8 selfloop flow, removed 2 redundant places. [2020-10-16 01:22:15,788 INFO L241 Difference]: Finished difference. Result has 59 places, 60 transitions, 438 flow [2020-10-16 01:22:15,788 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=438, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2020-10-16 01:22:15,789 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2020-10-16 01:22:15,789 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 438 flow [2020-10-16 01:22:15,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:22:15,789 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:15,789 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:15,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:22:15,790 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:15,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:15,790 INFO L82 PathProgramCache]: Analyzing trace with hash 122213315, now seen corresponding path program 1 times [2020-10-16 01:22:15,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:15,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508769010] [2020-10-16 01:22:15,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:15,877 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:22:15,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508769010] [2020-10-16 01:22:15,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:15,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:22:15,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426134103] [2020-10-16 01:22:15,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:22:15,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:15,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:22:15,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:22:15,882 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 200 [2020-10-16 01:22:15,883 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 438 flow. Second operand 4 states. [2020-10-16 01:22:15,883 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:15,883 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 200 [2020-10-16 01:22:15,883 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:16,274 INFO L129 PetriNetUnfolder]: 730/1371 cut-off events. [2020-10-16 01:22:16,274 INFO L130 PetriNetUnfolder]: For 4255/5206 co-relation queries the response was YES. [2020-10-16 01:22:16,286 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4856 conditions, 1371 events. 730/1371 cut-off events. For 4255/5206 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 9065 event pairs, 258 based on Foata normal form. 227/1472 useless extension candidates. Maximal degree in co-relation 4833. Up to 589 conditions per place. [2020-10-16 01:22:16,299 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 11 selfloop transitions, 10 changer transitions 0/72 dead transitions. [2020-10-16 01:22:16,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 501 flow [2020-10-16 01:22:16,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:22:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:22:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 852 transitions. [2020-10-16 01:22:16,302 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.852 [2020-10-16 01:22:16,302 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 852 transitions. [2020-10-16 01:22:16,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 852 transitions. [2020-10-16 01:22:16,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:16,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 852 transitions. [2020-10-16 01:22:16,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:22:16,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:22:16,307 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:22:16,308 INFO L185 Difference]: Start difference. First operand has 59 places, 60 transitions, 438 flow. Second operand 5 states and 852 transitions. [2020-10-16 01:22:16,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 501 flow [2020-10-16 01:22:16,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 481 flow, removed 6 selfloop flow, removed 1 redundant places. [2020-10-16 01:22:16,316 INFO L241 Difference]: Finished difference. Result has 65 places, 68 transitions, 492 flow [2020-10-16 01:22:16,316 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=492, PETRI_PLACES=65, PETRI_TRANSITIONS=68} [2020-10-16 01:22:16,316 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2020-10-16 01:22:16,316 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 492 flow [2020-10-16 01:22:16,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:22:16,317 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:16,317 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:22:16,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:22:16,317 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:16,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:16,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2117427739, now seen corresponding path program 1 times [2020-10-16 01:22:16,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:16,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331291937] [2020-10-16 01:22:16,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:16,376 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:22:16,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331291937] [2020-10-16 01:22:16,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:16,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:22:16,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428246374] [2020-10-16 01:22:16,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:22:16,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:16,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:22:16,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:22:16,380 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 200 [2020-10-16 01:22:16,380 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 492 flow. Second operand 5 states. [2020-10-16 01:22:16,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:16,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 200 [2020-10-16 01:22:16,381 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:16,608 INFO L129 PetriNetUnfolder]: 419/940 cut-off events. [2020-10-16 01:22:16,608 INFO L130 PetriNetUnfolder]: For 3752/6905 co-relation queries the response was YES. [2020-10-16 01:22:16,616 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3971 conditions, 940 events. 419/940 cut-off events. For 3752/6905 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6477 event pairs, 67 based on Foata normal form. 473/1326 useless extension candidates. Maximal degree in co-relation 3944. Up to 505 conditions per place. [2020-10-16 01:22:16,625 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 11 selfloop transitions, 19 changer transitions 0/78 dead transitions. [2020-10-16 01:22:16,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 78 transitions, 602 flow [2020-10-16 01:22:16,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:22:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:22:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1193 transitions. [2020-10-16 01:22:16,630 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8521428571428571 [2020-10-16 01:22:16,630 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1193 transitions. [2020-10-16 01:22:16,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1193 transitions. [2020-10-16 01:22:16,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:16,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1193 transitions. [2020-10-16 01:22:16,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:22:16,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:22:16,636 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:22:16,636 INFO L185 Difference]: Start difference. First operand has 65 places, 68 transitions, 492 flow. Second operand 7 states and 1193 transitions. [2020-10-16 01:22:16,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 78 transitions, 602 flow [2020-10-16 01:22:16,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 78 transitions, 597 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:22:16,646 INFO L241 Difference]: Finished difference. Result has 73 places, 74 transitions, 599 flow [2020-10-16 01:22:16,646 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=599, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2020-10-16 01:22:16,647 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2020-10-16 01:22:16,647 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 599 flow [2020-10-16 01:22:16,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:22:16,647 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:16,647 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] [2020-10-16 01:22:16,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:22:16,647 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:16,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:16,648 INFO L82 PathProgramCache]: Analyzing trace with hash 444052420, now seen corresponding path program 1 times [2020-10-16 01:22:16,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:16,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578796081] [2020-10-16 01:22:16,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:16,743 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:22:16,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578796081] [2020-10-16 01:22:16,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:16,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:22:16,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632663976] [2020-10-16 01:22:16,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:22:16,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:16,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:22:16,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:22:16,746 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 200 [2020-10-16 01:22:16,747 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 599 flow. Second operand 6 states. [2020-10-16 01:22:16,747 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:16,747 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 200 [2020-10-16 01:22:16,747 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:16,972 INFO L129 PetriNetUnfolder]: 306/754 cut-off events. [2020-10-16 01:22:16,973 INFO L130 PetriNetUnfolder]: For 5205/10803 co-relation queries the response was YES. [2020-10-16 01:22:16,981 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3868 conditions, 754 events. 306/754 cut-off events. For 5205/10803 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5240 event pairs, 12 based on Foata normal form. 607/1284 useless extension candidates. Maximal degree in co-relation 3837. Up to 477 conditions per place. [2020-10-16 01:22:16,988 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 6 selfloop transitions, 28 changer transitions 4/84 dead transitions. [2020-10-16 01:22:16,989 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 84 transitions, 770 flow [2020-10-16 01:22:16,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:22:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:22:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1534 transitions. [2020-10-16 01:22:16,994 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8522222222222222 [2020-10-16 01:22:16,994 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1534 transitions. [2020-10-16 01:22:16,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1534 transitions. [2020-10-16 01:22:16,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:16,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1534 transitions. [2020-10-16 01:22:16,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:22:17,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:22:17,002 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:22:17,003 INFO L185 Difference]: Start difference. First operand has 73 places, 74 transitions, 599 flow. Second operand 9 states and 1534 transitions. [2020-10-16 01:22:17,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 84 transitions, 770 flow [2020-10-16 01:22:17,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 84 transitions, 684 flow, removed 22 selfloop flow, removed 6 redundant places. [2020-10-16 01:22:17,020 INFO L241 Difference]: Finished difference. Result has 78 places, 80 transitions, 660 flow [2020-10-16 01:22:17,020 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=660, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2020-10-16 01:22:17,020 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 35 predicate places. [2020-10-16 01:22:17,020 INFO L481 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 660 flow [2020-10-16 01:22:17,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:22:17,021 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:17,021 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:17,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:22:17,021 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:17,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:17,021 INFO L82 PathProgramCache]: Analyzing trace with hash 467397314, now seen corresponding path program 1 times [2020-10-16 01:22:17,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:17,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125964441] [2020-10-16 01:22:17,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:17,079 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:22:17,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125964441] [2020-10-16 01:22:17,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:17,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:22:17,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393679977] [2020-10-16 01:22:17,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:22:17,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:17,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:22:17,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:22:17,082 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 200 [2020-10-16 01:22:17,083 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 660 flow. Second operand 4 states. [2020-10-16 01:22:17,083 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:17,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 200 [2020-10-16 01:22:17,083 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:17,309 INFO L129 PetriNetUnfolder]: 580/1440 cut-off events. [2020-10-16 01:22:17,310 INFO L130 PetriNetUnfolder]: For 8357/10476 co-relation queries the response was YES. [2020-10-16 01:22:17,326 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6538 conditions, 1440 events. 580/1440 cut-off events. For 8357/10476 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 11639 event pairs, 25 based on Foata normal form. 84/1410 useless extension candidates. Maximal degree in co-relation 6506. Up to 574 conditions per place. [2020-10-16 01:22:17,339 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 4 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2020-10-16 01:22:17,339 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 82 transitions, 690 flow [2020-10-16 01:22:17,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:22:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:22:17,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 699 transitions. [2020-10-16 01:22:17,343 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.87375 [2020-10-16 01:22:17,343 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 699 transitions. [2020-10-16 01:22:17,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 699 transitions. [2020-10-16 01:22:17,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:17,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 699 transitions. [2020-10-16 01:22:17,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:22:17,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:22:17,347 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:22:17,347 INFO L185 Difference]: Start difference. First operand has 78 places, 80 transitions, 660 flow. Second operand 4 states and 699 transitions. [2020-10-16 01:22:17,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 82 transitions, 690 flow [2020-10-16 01:22:17,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 82 transitions, 593 flow, removed 34 selfloop flow, removed 4 redundant places. [2020-10-16 01:22:17,430 INFO L241 Difference]: Finished difference. Result has 79 places, 81 transitions, 576 flow [2020-10-16 01:22:17,431 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=576, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2020-10-16 01:22:17,431 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2020-10-16 01:22:17,431 INFO L481 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 576 flow [2020-10-16 01:22:17,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:22:17,431 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:17,432 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:17,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:22:17,432 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:17,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:17,432 INFO L82 PathProgramCache]: Analyzing trace with hash -497981158, now seen corresponding path program 2 times [2020-10-16 01:22:17,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:17,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125905511] [2020-10-16 01:22:17,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:17,545 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:22:17,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125905511] [2020-10-16 01:22:17,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:17,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:22:17,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798982577] [2020-10-16 01:22:17,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:22:17,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:17,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:22:17,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:22:17,549 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 200 [2020-10-16 01:22:17,550 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 576 flow. Second operand 7 states. [2020-10-16 01:22:17,550 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:17,550 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 200 [2020-10-16 01:22:17,551 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:17,929 INFO L129 PetriNetUnfolder]: 557/1383 cut-off events. [2020-10-16 01:22:17,929 INFO L130 PetriNetUnfolder]: For 7891/12233 co-relation queries the response was YES. [2020-10-16 01:22:17,943 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5804 conditions, 1383 events. 557/1383 cut-off events. For 7891/12233 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 11277 event pairs, 15 based on Foata normal form. 899/2170 useless extension candidates. Maximal degree in co-relation 5770. Up to 340 conditions per place. [2020-10-16 01:22:17,953 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 2 selfloop transitions, 33 changer transitions 4/86 dead transitions. [2020-10-16 01:22:17,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 86 transitions, 710 flow [2020-10-16 01:22:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 01:22:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 01:22:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1867 transitions. [2020-10-16 01:22:17,959 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8486363636363636 [2020-10-16 01:22:17,959 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1867 transitions. [2020-10-16 01:22:17,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1867 transitions. [2020-10-16 01:22:17,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:17,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1867 transitions. [2020-10-16 01:22:17,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 01:22:17,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 01:22:17,968 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 01:22:17,968 INFO L185 Difference]: Start difference. First operand has 79 places, 81 transitions, 576 flow. Second operand 11 states and 1867 transitions. [2020-10-16 01:22:17,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 86 transitions, 710 flow [2020-10-16 01:22:18,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 668 flow, removed 12 selfloop flow, removed 3 redundant places. [2020-10-16 01:22:18,019 INFO L241 Difference]: Finished difference. Result has 89 places, 82 transitions, 628 flow [2020-10-16 01:22:18,019 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=628, PETRI_PLACES=89, PETRI_TRANSITIONS=82} [2020-10-16 01:22:18,019 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places. [2020-10-16 01:22:18,019 INFO L481 AbstractCegarLoop]: Abstraction has has 89 places, 82 transitions, 628 flow [2020-10-16 01:22:18,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:22:18,020 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:18,020 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:18,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:22:18,020 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:18,020 INFO L82 PathProgramCache]: Analyzing trace with hash -2023766046, now seen corresponding path program 1 times [2020-10-16 01:22:18,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:18,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230147977] [2020-10-16 01:22:18,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:18,078 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:22:18,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230147977] [2020-10-16 01:22:18,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:18,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:22:18,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84824576] [2020-10-16 01:22:18,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:22:18,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:18,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:22:18,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:22:18,081 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 200 [2020-10-16 01:22:18,082 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 82 transitions, 628 flow. Second operand 4 states. [2020-10-16 01:22:18,082 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:18,082 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 200 [2020-10-16 01:22:18,082 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:18,371 INFO L129 PetriNetUnfolder]: 949/2303 cut-off events. [2020-10-16 01:22:18,371 INFO L130 PetriNetUnfolder]: For 9723/10826 co-relation queries the response was YES. [2020-10-16 01:22:18,394 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9618 conditions, 2303 events. 949/2303 cut-off events. For 9723/10826 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 20902 event pairs, 24 based on Foata normal form. 92/2191 useless extension candidates. Maximal degree in co-relation 9582. Up to 600 conditions per place. [2020-10-16 01:22:18,402 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 3 selfloop transitions, 2 changer transitions 5/83 dead transitions. [2020-10-16 01:22:18,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 83 transitions, 640 flow [2020-10-16 01:22:18,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:22:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:22:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 686 transitions. [2020-10-16 01:22:18,405 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8575 [2020-10-16 01:22:18,405 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 686 transitions. [2020-10-16 01:22:18,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 686 transitions. [2020-10-16 01:22:18,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:18,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 686 transitions. [2020-10-16 01:22:18,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:22:18,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:22:18,409 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:22:18,409 INFO L185 Difference]: Start difference. First operand has 89 places, 82 transitions, 628 flow. Second operand 4 states and 686 transitions. [2020-10-16 01:22:18,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 83 transitions, 640 flow [2020-10-16 01:22:18,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 83 transitions, 529 flow, removed 25 selfloop flow, removed 10 redundant places. [2020-10-16 01:22:18,545 INFO L241 Difference]: Finished difference. Result has 83 places, 78 transitions, 489 flow [2020-10-16 01:22:18,546 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=489, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2020-10-16 01:22:18,546 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2020-10-16 01:22:18,546 INFO L481 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 489 flow [2020-10-16 01:22:18,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:22:18,546 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:18,546 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:18,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:22:18,546 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:18,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:18,547 INFO L82 PathProgramCache]: Analyzing trace with hash 208932922, now seen corresponding path program 2 times [2020-10-16 01:22:18,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:18,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238600834] [2020-10-16 01:22:18,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:18,605 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:22:18,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238600834] [2020-10-16 01:22:18,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:18,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:22:18,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687672687] [2020-10-16 01:22:18,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:22:18,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:18,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:22:18,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:22:18,609 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 200 [2020-10-16 01:22:18,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 489 flow. Second operand 3 states. [2020-10-16 01:22:18,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:18,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 200 [2020-10-16 01:22:18,610 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:19,317 INFO L129 PetriNetUnfolder]: 1608/3804 cut-off events. [2020-10-16 01:22:19,317 INFO L130 PetriNetUnfolder]: For 8821/9937 co-relation queries the response was YES. [2020-10-16 01:22:19,359 INFO L80 FinitePrefix]: Finished finitePrefix Result has 13566 conditions, 3804 events. 1608/3804 cut-off events. For 8821/9937 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 37871 event pairs, 57 based on Foata normal form. 126/3561 useless extension candidates. Maximal degree in co-relation 13532. Up to 1050 conditions per place. [2020-10-16 01:22:19,379 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 3 selfloop transitions, 2 changer transitions 15/80 dead transitions. [2020-10-16 01:22:19,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 80 transitions, 516 flow [2020-10-16 01:22:19,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:22:19,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:22:19,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2020-10-16 01:22:19,384 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2020-10-16 01:22:19,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 530 transitions. [2020-10-16 01:22:19,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 530 transitions. [2020-10-16 01:22:19,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:19,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 530 transitions. [2020-10-16 01:22:19,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:22:19,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:22:19,389 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:22:19,389 INFO L185 Difference]: Start difference. First operand has 83 places, 78 transitions, 489 flow. Second operand 3 states and 530 transitions. [2020-10-16 01:22:19,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 80 transitions, 516 flow [2020-10-16 01:22:19,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 80 transitions, 513 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:22:19,822 INFO L241 Difference]: Finished difference. Result has 85 places, 65 transitions, 408 flow [2020-10-16 01:22:19,822 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2020-10-16 01:22:19,822 INFO L342 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2020-10-16 01:22:19,823 INFO L481 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 408 flow [2020-10-16 01:22:19,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:22:19,823 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:19,823 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:19,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:22:19,823 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:19,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:19,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1042074806, now seen corresponding path program 3 times [2020-10-16 01:22:19,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:19,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203758522] [2020-10-16 01:22:19,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:22:19,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:22:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:22:19,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:22:19,961 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:22:19,961 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:22:19,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 01:22:19,963 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 01:22:19,982 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1154] [1154] L3-->L858: Formula: (let ((.cse7 (= (mod ~x$w_buff1_used~0_In-311159835 256) 0)) (.cse6 (= (mod ~x$r_buff1_thd0~0_In-311159835 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In-311159835 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In-311159835 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and .cse0 .cse1 (= ~x$w_buff0_used~0_Out-311159835 0)) (and (= ~x$w_buff0_used~0_Out-311159835 ~x$w_buff0_used~0_In-311159835) .cse2)) (= ~x$r_buff0_thd0~0_In-311159835 ~x$r_buff0_thd0~0_Out-311159835) (= ~x$r_buff1_thd0~0_Out-311159835 ~x$r_buff1_thd0~0_In-311159835) (or (and (= ~x~0_Out-311159835 ~x$w_buff0~0_In-311159835) .cse0 .cse1) (and (or (and .cse3 (= ~x~0_In-311159835 ~x~0_Out-311159835)) (and .cse4 (= ~x~0_Out-311159835 ~x$w_buff1~0_In-311159835) .cse5)) .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-311159835 0)) (or (and .cse3 (= ~x$w_buff1_used~0_In-311159835 ~x$w_buff1_used~0_Out-311159835)) (and .cse4 (= ~x$w_buff1_used~0_Out-311159835 0) .cse5))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-311159835, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-311159835, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-311159835, ~x$w_buff1~0=~x$w_buff1~0_In-311159835, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-311159835, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-311159835, ~x~0=~x~0_In-311159835, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-311159835} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-311159835, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-311159835, ~x$w_buff1~0=~x$w_buff1~0_In-311159835, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-311159835|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-311159835, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-311159835, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-311159835|, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-311159835|, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-311159835|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-311159835, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-311159835|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-311159835|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-311159835, ~x~0=~x~0_Out-311159835} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ~x~0, ULTIMATE.start_main_#t~ite33, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2020-10-16 01:22:19,995 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:22:19,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:19,999 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:22:20,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,000 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:22:20,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,000 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:22:20,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,000 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:22:20,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,001 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:22:20,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,001 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:22:20,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,002 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:22:20,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,002 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:22:20,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,003 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:22:20,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,003 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:22:20,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,004 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:22:20,004 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,005 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:22:20,005 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,005 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:22:20,005 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,006 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:22:20,006 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,006 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:22:20,006 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,006 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:22:20,006 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,007 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:22:20,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,007 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:22:20,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,007 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:22:20,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,012 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:22:20,012 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,013 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:22:20,013 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,013 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:22:20,013 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,014 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:22:20,014 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,018 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:22:20,018 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,019 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:22:20,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,019 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:22:20,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,020 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:22:20,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,020 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:22:20,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,021 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:22:20,021 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,021 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:22:20,021 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,022 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:22:20,022 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,022 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:22:20,022 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,022 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:22:20,023 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,023 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:22:20,023 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,023 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:22:20,024 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,024 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:22:20,024 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:20,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:22:20 BasicIcfg [2020-10-16 01:22:20,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:22:20,117 INFO L168 Benchmark]: Toolchain (without parser) took 22610.45 ms. Allocated memory was 245.4 MB in the beginning and 787.0 MB in the end (delta: 541.6 MB). Free memory was 200.4 MB in the beginning and 474.3 MB in the end (delta: -273.9 MB). Peak memory consumption was 267.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:22:20,118 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 245.4 MB. Free memory was 223.4 MB in the beginning and 222.6 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-16 01:22:20,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.35 ms. Allocated memory was 245.4 MB in the beginning and 296.7 MB in the end (delta: 51.4 MB). Free memory was 200.4 MB in the beginning and 246.9 MB in the end (delta: -46.6 MB). Peak memory consumption was 33.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:22:20,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.81 ms. Allocated memory is still 296.7 MB. Free memory was 246.9 MB in the beginning and 244.4 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:22:20,120 INFO L168 Benchmark]: Boogie Preprocessor took 60.15 ms. Allocated memory is still 296.7 MB. Free memory was 244.4 MB in the beginning and 241.9 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:22:20,121 INFO L168 Benchmark]: RCFGBuilder took 2400.36 ms. Allocated memory was 296.7 MB in the beginning and 351.3 MB in the end (delta: 54.5 MB). Free memory was 241.1 MB in the beginning and 149.9 MB in the end (delta: 91.2 MB). Peak memory consumption was 145.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:22:20,122 INFO L168 Benchmark]: TraceAbstraction took 19295.33 ms. Allocated memory was 351.3 MB in the beginning and 787.0 MB in the end (delta: 435.7 MB). Free memory was 149.9 MB in the beginning and 474.3 MB in the end (delta: -324.4 MB). Peak memory consumption was 111.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:22:20,127 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.48 ms. Allocated memory is still 245.4 MB. Free memory was 223.4 MB in the beginning and 222.6 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 780.35 ms. Allocated memory was 245.4 MB in the beginning and 296.7 MB in the end (delta: 51.4 MB). Free memory was 200.4 MB in the beginning and 246.9 MB in the end (delta: -46.6 MB). Peak memory consumption was 33.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 65.81 ms. Allocated memory is still 296.7 MB. Free memory was 246.9 MB in the beginning and 244.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 60.15 ms. Allocated memory is still 296.7 MB. Free memory was 244.4 MB in the beginning and 241.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2400.36 ms. Allocated memory was 296.7 MB in the beginning and 351.3 MB in the end (delta: 54.5 MB). Free memory was 241.1 MB in the beginning and 149.9 MB in the end (delta: 91.2 MB). Peak memory consumption was 145.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 19295.33 ms. Allocated memory was 351.3 MB in the beginning and 787.0 MB in the end (delta: 435.7 MB). Free memory was 149.9 MB in the beginning and 474.3 MB in the end (delta: -324.4 MB). Peak memory consumption was 111.3 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1802 VarBasedMoverChecksPositive, 109 VarBasedMoverChecksNegative, 21 SemBasedMoverChecksPositive, 88 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.6s, 231 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.7s, 119 PlacesBefore, 43 PlacesAfterwards, 108 TransitionsBefore, 30 TransitionsAfterwards, 2706 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, 7733 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L708] 0 _Bool main$tmp_guard0; [L709] 0 _Bool main$tmp_guard1; [L711] 0 int x = 0; [L712] 0 _Bool x$flush_delayed; [L713] 0 int x$mem_tmp; [L714] 0 _Bool x$r_buff0_thd0; [L715] 0 _Bool x$r_buff0_thd1; [L716] 0 _Bool x$r_buff0_thd2; [L717] 0 _Bool x$r_buff0_thd3; [L718] 0 _Bool x$r_buff0_thd4; [L719] 0 _Bool x$r_buff1_thd0; [L720] 0 _Bool x$r_buff1_thd1; [L721] 0 _Bool x$r_buff1_thd2; [L722] 0 _Bool x$r_buff1_thd3; [L723] 0 _Bool x$r_buff1_thd4; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L840] 0 pthread_t t741; [L841] FCALL, FORK 0 pthread_create(&t741, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L842] 0 pthread_t t742; [L843] FCALL, FORK 0 pthread_create(&t742, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L759] 2 x$w_buff1 = x$w_buff0 [L760] 2 x$w_buff0 = 2 [L761] 2 x$w_buff1_used = x$w_buff0_used [L762] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L764] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L765] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L766] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L767] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L768] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L769] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L844] 0 pthread_t t743; [L845] FCALL, FORK 0 pthread_create(&t743, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L846] 0 pthread_t t744; [L847] FCALL, FORK 0 pthread_create(&t744, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L789] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L812] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L815] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L795] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L795] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L795] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L799] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L749] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L818] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L818] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L819] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L819] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L820] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L820] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L821] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L821] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L822] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L822] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L754] 1 return 0; [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L802] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 3 return 0; [L825] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 4 return 0; [L849] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L860] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L861] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L862] 0 x$flush_delayed = weak$$choice2 [L863] 0 x$mem_tmp = x [L864] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L864] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L865] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L865] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L866] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L866] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L866] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L867] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L867] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L867] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L867] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L867] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L868] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L868] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L869] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L870] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L872] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L872] 0 x = x$flush_delayed ? x$mem_tmp : x [L873] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 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: 18.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.8s, HoareTripleCheckerStatistics: 67 SDtfs, 39 SDslu, 19 SDs, 0 SdLazy, 332 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=660occurred in iteration=11, 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, 0.9s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 19434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...