/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/mix029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:22:24,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:22:24,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:22:24,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:22:24,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:22:24,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:22:24,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:22:24,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:22:24,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:22:24,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:22:24,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:22:24,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:22:24,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:22:24,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:22:24,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:22:24,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:22:24,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:22:24,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:22:24,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:22:24,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:22:24,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:22:24,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:22:24,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:22:24,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:22:24,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:22:24,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:22:24,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:22:24,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:22:24,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:22:24,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:22:24,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:22:24,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:22:24,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:22:24,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:22:24,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:22:24,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:22:24,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:22:24,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:22:24,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:22:24,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:22:24,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:22:24,455 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:22:24,493 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:22:24,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:22:24,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:22:24,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:22:24,496 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:22:24,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:22:24,496 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:22:24,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:22:24,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:22:24,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:22:24,498 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:22:24,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:22:24,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:22:24,499 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:22:24,499 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:22:24,499 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:22:24,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:22:24,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:22:24,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:22:24,500 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:22:24,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:22:24,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:22:24,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:22:24,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:22:24,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:22:24,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:22:24,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:22:24,502 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:22:24,502 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:22:24,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:22:24,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:22:24,797 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:22:24,798 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:22:24,801 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:22:24,802 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt.i [2020-10-16 01:22:24,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae36ba6df/88f88fc7cdbf4774a8e6f2e9a1845710/FLAG730d3c289 [2020-10-16 01:22:25,428 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:22:25,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt.i [2020-10-16 01:22:25,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae36ba6df/88f88fc7cdbf4774a8e6f2e9a1845710/FLAG730d3c289 [2020-10-16 01:22:25,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae36ba6df/88f88fc7cdbf4774a8e6f2e9a1845710 [2020-10-16 01:22:25,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:22:25,631 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:22:25,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:22:25,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:22:25,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:22:25,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:22:25" (1/1) ... [2020-10-16 01:22:25,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b60800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:25, skipping insertion in model container [2020-10-16 01:22:25,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:22:25" (1/1) ... [2020-10-16 01:22:25,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:22:25,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:22:26,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:22:26,169 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:22:26,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:22:26,364 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:22:26,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:26 WrapperNode [2020-10-16 01:22:26,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:22:26,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:22:26,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:22:26,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:22:26,375 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:22:26" (1/1) ... [2020-10-16 01:22:26,396 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:22:26" (1/1) ... [2020-10-16 01:22:26,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:22:26,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:22:26,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:22:26,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:22:26,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:26" (1/1) ... [2020-10-16 01:22:26,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:26" (1/1) ... [2020-10-16 01:22:26,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:26" (1/1) ... [2020-10-16 01:22:26,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:26" (1/1) ... [2020-10-16 01:22:26,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:26" (1/1) ... [2020-10-16 01:22:26,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:26" (1/1) ... [2020-10-16 01:22:26,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:26" (1/1) ... [2020-10-16 01:22:26,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:22:26,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:22:26,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:22:26,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:22:26,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:26" (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:22:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:22:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:22:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:22:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:22:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:22:26,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:22:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:22:26,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:22:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:22:26,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:22:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 01:22:26,556 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 01:22:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:22:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:22:26,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:22:26,559 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:28,810 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:22:28,811 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:22:28,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:22:28 BoogieIcfgContainer [2020-10-16 01:22:28,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:22:28,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:22:28,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:22:28,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:22:28,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:22:25" (1/3) ... [2020-10-16 01:22:28,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fc97dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:22:28, skipping insertion in model container [2020-10-16 01:22:28,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:26" (2/3) ... [2020-10-16 01:22:28,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fc97dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:22:28, skipping insertion in model container [2020-10-16 01:22:28,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:22:28" (3/3) ... [2020-10-16 01:22:28,822 INFO L111 eAbstractionObserver]: Analyzing ICFG mix029_power.opt.i [2020-10-16 01:22:28,833 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:22:28,841 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:22:28,843 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:22:28,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,876 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,876 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,877 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,878 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,879 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,883 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,883 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,883 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,884 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,887 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,888 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,888 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,888 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,888 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,889 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,889 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,889 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,889 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,890 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,890 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,894 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,894 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,895 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,895 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,895 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,895 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,896 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,896 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,896 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,896 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,900 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,900 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,907 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,908 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,909 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,909 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,909 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,909 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,910 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,910 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,912 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,913 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,913 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:22:28,932 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 01:22:28,955 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:22:28,955 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:22:28,955 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:22:28,955 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:22:28,956 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:22:28,956 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:22:28,956 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:22:28,956 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:22:28,971 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-16 01:22:29,059 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-16 01:22:29,059 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:22:29,068 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 01:22:29,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 111 transitions, 242 flow [2020-10-16 01:22:29,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 107 transitions, 226 flow [2020-10-16 01:22:29,079 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:22:29,082 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 107 transitions, 226 flow [2020-10-16 01:22:29,085 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 107 transitions, 226 flow [2020-10-16 01:22:29,086 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 226 flow [2020-10-16 01:22:29,115 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-16 01:22:29,116 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:22:29,117 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 01:22:29,121 INFO L117 LiptonReduction]: Number of co-enabled transitions 2572 [2020-10-16 01:22:29,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:29,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:29,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:29,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:29,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:29,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:29,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:29,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:29,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:29,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:22:29,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:22:29,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:22:29,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:29,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:29,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:29,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:22:29,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:22:29,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:29,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:29,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:29,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:22:29,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:22:29,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:29,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:29,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:29,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:29,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:29,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:22:29,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:22:29,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:22:29,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:29,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:29,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:29,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:22:29,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:22:29,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:29,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:29,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:29,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:29,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:29,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:22:29,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:22:29,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:22:29,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:29,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:29,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:29,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:30,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:30,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:30,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:30,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:30,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:30,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:30,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:30,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:30,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:30,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:30,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:30,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:30,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:30,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:30,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:30,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:30,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:30,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,728 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:22:30,873 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 01:22:30,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:30,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:30,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-16 01:22:30,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:30,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:30,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:30,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:30,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:31,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:31,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:31,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:31,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:31,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:31,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:31,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:31,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:31,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:31,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:31,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:31,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:31,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:31,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:31,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:31,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:31,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:31,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:31,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:31,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:31,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:22:31,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:31,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:22:31,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:31,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:22:31,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:31,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:31,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:31,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:31,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:31,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:31,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:22:31,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:22:31,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:32,432 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-16 01:22:32,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-16 01:22:32,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:32,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:32,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,302 WARN L193 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-10-16 01:22:33,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:33,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:33,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:33,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:33,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-16 01:22:33,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:33,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:33,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:33,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:33,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:33,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:33,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:33,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:33,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:33,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:33,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:33,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:22:33,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:22:33,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 01:22:33,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 01:22:33,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 01:22:33,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:33,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:22:33,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 01:22:33,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,753 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 01:22:33,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:33,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:33,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 01:22:33,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:33,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:33,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:33,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:33,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:33,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:33,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:33,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:33,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:33,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:33,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:33,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:33,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:33,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:33,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:34,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 01:22:34,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:34,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 01:22:34,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 01:22:34,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:34,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 01:22:34,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:34,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:34,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:34,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:34,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:34,780 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:22:34,887 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:22:35,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:35,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:35,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:35,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:35,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:35,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:35,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 01:22:35,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:35,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:35,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:35,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:35,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:35,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:35,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:35,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:35,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:35,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 01:22:35,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:35,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:35,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:35,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 01:22:35,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:36,431 WARN L193 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 110 [2020-10-16 01:22:36,724 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 01:22:37,160 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 01:22:37,897 WARN L193 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 137 [2020-10-16 01:22:38,222 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 01:22:38,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:22:38,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:38,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:22:38,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:38,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:38,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:38,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:38,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:38,365 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:38,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:38,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:38,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:38,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:38,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:38,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:38,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:38,382 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:38,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:38,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:38,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:38,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:22:38,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:38,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:38,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:38,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:38,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:38,442 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:38,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:38,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:38,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:38,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:38,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:38,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:38,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:38,457 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:38,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:38,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:38,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:38,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:22:38,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:38,756 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-16 01:22:38,881 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-16 01:22:38,975 INFO L132 LiptonReduction]: Checked pairs total: 7754 [2020-10-16 01:22:38,975 INFO L134 LiptonReduction]: Total number of compositions: 91 [2020-10-16 01:22:38,991 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9914 [2020-10-16 01:22:39,001 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2020-10-16 01:22:39,001 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:22:39,001 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:39,002 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:39,003 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:39,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:39,009 INFO L82 PathProgramCache]: Analyzing trace with hash 51217074, now seen corresponding path program 1 times [2020-10-16 01:22:39,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:39,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411852761] [2020-10-16 01:22:39,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:39,265 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:39,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411852761] [2020-10-16 01:22:39,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:39,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:22:39,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992241200] [2020-10-16 01:22:39,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:22:39,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:39,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:22:39,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:22:39,290 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 202 [2020-10-16 01:22:39,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states. [2020-10-16 01:22:39,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:39,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 202 [2020-10-16 01:22:39,295 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:39,414 INFO L129 PetriNetUnfolder]: 69/146 cut-off events. [2020-10-16 01:22:39,414 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:22:39,415 INFO L80 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 146 events. 69/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 610 event pairs, 39 based on Foata normal form. 11/139 useless extension candidates. Maximal degree in co-relation 266. Up to 89 conditions per place. [2020-10-16 01:22:39,418 INFO L132 encePairwiseOnDemand]: 198/202 looper letters, 9 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2020-10-16 01:22:39,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 104 flow [2020-10-16 01:22:39,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:22:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:22:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2020-10-16 01:22:39,438 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.858085808580858 [2020-10-16 01:22:39,439 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2020-10-16 01:22:39,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2020-10-16 01:22:39,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:39,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2020-10-16 01:22:39,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:22:39,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:22:39,459 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:22:39,462 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 520 transitions. [2020-10-16 01:22:39,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 104 flow [2020-10-16 01:22:39,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 01:22:39,469 INFO L241 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2020-10-16 01:22:39,472 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2020-10-16 01:22:39,473 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2020-10-16 01:22:39,473 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2020-10-16 01:22:39,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:22:39,473 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:39,474 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:39,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:22:39,474 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:39,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash -386244637, now seen corresponding path program 1 times [2020-10-16 01:22:39,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:39,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995724215] [2020-10-16 01:22:39,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:39,661 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:39,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995724215] [2020-10-16 01:22:39,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:39,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:22:39,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229387618] [2020-10-16 01:22:39,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:22:39,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:39,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:22:39,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:22:39,666 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2020-10-16 01:22:39,667 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states. [2020-10-16 01:22:39,667 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:39,667 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2020-10-16 01:22:39,667 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:39,706 INFO L129 PetriNetUnfolder]: 24/78 cut-off events. [2020-10-16 01:22:39,707 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-16 01:22:39,707 INFO L80 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 78 events. 24/78 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 227 event pairs, 9 based on Foata normal form. 2/77 useless extension candidates. Maximal degree in co-relation 138. Up to 45 conditions per place. [2020-10-16 01:22:39,708 INFO L132 encePairwiseOnDemand]: 198/202 looper letters, 8 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2020-10-16 01:22:39,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 98 flow [2020-10-16 01:22:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:22:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:22:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2020-10-16 01:22:39,712 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8118811881188119 [2020-10-16 01:22:39,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2020-10-16 01:22:39,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2020-10-16 01:22:39,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:39,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2020-10-16 01:22:39,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:22:39,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:22:39,716 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:22:39,717 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 492 transitions. [2020-10-16 01:22:39,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 98 flow [2020-10-16 01:22:39,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:22:39,719 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2020-10-16 01:22:39,719 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2020-10-16 01:22:39,720 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2020-10-16 01:22:39,720 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 81 flow [2020-10-16 01:22:39,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:22:39,720 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:39,720 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:39,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:22:39,721 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:39,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:39,721 INFO L82 PathProgramCache]: Analyzing trace with hash 910702066, now seen corresponding path program 1 times [2020-10-16 01:22:39,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:39,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477771190] [2020-10-16 01:22:39,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:39,816 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:39,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477771190] [2020-10-16 01:22:39,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:39,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:22:39,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626758717] [2020-10-16 01:22:39,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:22:39,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:39,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:22:39,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:22:39,851 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 202 [2020-10-16 01:22:39,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 81 flow. Second operand 3 states. [2020-10-16 01:22:39,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:39,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 202 [2020-10-16 01:22:39,852 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:39,936 INFO L129 PetriNetUnfolder]: 104/217 cut-off events. [2020-10-16 01:22:39,936 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2020-10-16 01:22:39,938 INFO L80 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 217 events. 104/217 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 963 event pairs, 49 based on Foata normal form. 2/205 useless extension candidates. Maximal degree in co-relation 428. Up to 158 conditions per place. [2020-10-16 01:22:39,940 INFO L132 encePairwiseOnDemand]: 198/202 looper letters, 9 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2020-10-16 01:22:39,940 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 113 flow [2020-10-16 01:22:39,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:22:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:22:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2020-10-16 01:22:39,943 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8036303630363036 [2020-10-16 01:22:39,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2020-10-16 01:22:39,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2020-10-16 01:22:39,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:39,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2020-10-16 01:22:39,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:22:39,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:22:39,947 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:22:39,948 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 81 flow. Second operand 3 states and 487 transitions. [2020-10-16 01:22:39,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 113 flow [2020-10-16 01:22:39,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:22:39,949 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 97 flow [2020-10-16 01:22:39,951 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2020-10-16 01:22:39,951 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2020-10-16 01:22:39,951 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 97 flow [2020-10-16 01:22:39,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:22:39,952 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:39,952 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:39,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:22:39,952 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:39,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1652038367, now seen corresponding path program 1 times [2020-10-16 01:22:39,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:39,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045322134] [2020-10-16 01:22:39,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:22:40,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045322134] [2020-10-16 01:22:40,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:40,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:22:40,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050602152] [2020-10-16 01:22:40,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:22:40,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:40,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:22:40,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:22:40,076 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 202 [2020-10-16 01:22:40,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 97 flow. Second operand 5 states. [2020-10-16 01:22:40,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:40,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 202 [2020-10-16 01:22:40,077 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:40,277 INFO L129 PetriNetUnfolder]: 191/380 cut-off events. [2020-10-16 01:22:40,278 INFO L130 PetriNetUnfolder]: For 138/150 co-relation queries the response was YES. [2020-10-16 01:22:40,280 INFO L80 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 380 events. 191/380 cut-off events. For 138/150 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1861 event pairs, 95 based on Foata normal form. 5/369 useless extension candidates. Maximal degree in co-relation 848. Up to 274 conditions per place. [2020-10-16 01:22:40,284 INFO L132 encePairwiseOnDemand]: 194/202 looper letters, 11 selfloop transitions, 12 changer transitions 0/43 dead transitions. [2020-10-16 01:22:40,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 177 flow [2020-10-16 01:22:40,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:22:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:22:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 788 transitions. [2020-10-16 01:22:40,288 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7801980198019802 [2020-10-16 01:22:40,288 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 788 transitions. [2020-10-16 01:22:40,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 788 transitions. [2020-10-16 01:22:40,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:40,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 788 transitions. [2020-10-16 01:22:40,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:22:40,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:22:40,293 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:22:40,293 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 97 flow. Second operand 5 states and 788 transitions. [2020-10-16 01:22:40,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 177 flow [2020-10-16 01:22:40,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:22:40,295 INFO L241 Difference]: Finished difference. Result has 47 places, 42 transitions, 182 flow [2020-10-16 01:22:40,296 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2020-10-16 01:22:40,296 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2020-10-16 01:22:40,296 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 182 flow [2020-10-16 01:22:40,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:22:40,296 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:40,296 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:40,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:22:40,297 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:40,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:40,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1813916897, now seen corresponding path program 2 times [2020-10-16 01:22:40,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:40,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9250912] [2020-10-16 01:22:40,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:40,336 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:40,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9250912] [2020-10-16 01:22:40,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:40,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:22:40,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826935598] [2020-10-16 01:22:40,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:22:40,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:40,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:22:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:22:40,339 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 202 [2020-10-16 01:22:40,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 182 flow. Second operand 3 states. [2020-10-16 01:22:40,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:40,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 202 [2020-10-16 01:22:40,340 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:40,401 INFO L129 PetriNetUnfolder]: 77/264 cut-off events. [2020-10-16 01:22:40,401 INFO L130 PetriNetUnfolder]: For 403/498 co-relation queries the response was YES. [2020-10-16 01:22:40,403 INFO L80 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 264 events. 77/264 cut-off events. For 403/498 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1642 event pairs, 20 based on Foata normal form. 16/262 useless extension candidates. Maximal degree in co-relation 681. Up to 94 conditions per place. [2020-10-16 01:22:40,405 INFO L132 encePairwiseOnDemand]: 199/202 looper letters, 11 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2020-10-16 01:22:40,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 230 flow [2020-10-16 01:22:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:22:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:22:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2020-10-16 01:22:40,408 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8894389438943895 [2020-10-16 01:22:40,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 539 transitions. [2020-10-16 01:22:40,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 539 transitions. [2020-10-16 01:22:40,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:40,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 539 transitions. [2020-10-16 01:22:40,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:22:40,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:22:40,411 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:22:40,412 INFO L185 Difference]: Start difference. First operand has 47 places, 42 transitions, 182 flow. Second operand 3 states and 539 transitions. [2020-10-16 01:22:40,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 230 flow [2020-10-16 01:22:40,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 222 flow, removed 4 selfloop flow, removed 0 redundant places. [2020-10-16 01:22:40,415 INFO L241 Difference]: Finished difference. Result has 50 places, 42 transitions, 189 flow [2020-10-16 01:22:40,416 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2020-10-16 01:22:40,416 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2020-10-16 01:22:40,416 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 189 flow [2020-10-16 01:22:40,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:22:40,416 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:40,416 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:40,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:22:40,417 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:40,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:40,417 INFO L82 PathProgramCache]: Analyzing trace with hash -396799867, now seen corresponding path program 1 times [2020-10-16 01:22:40,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:40,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885107118] [2020-10-16 01:22:40,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:40,502 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:40,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885107118] [2020-10-16 01:22:40,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:40,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:22:40,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829775504] [2020-10-16 01:22:40,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:22:40,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:40,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:22:40,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:22:40,507 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 202 [2020-10-16 01:22:40,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 189 flow. Second operand 5 states. [2020-10-16 01:22:40,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:40,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 202 [2020-10-16 01:22:40,508 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:40,663 INFO L129 PetriNetUnfolder]: 186/416 cut-off events. [2020-10-16 01:22:40,664 INFO L130 PetriNetUnfolder]: For 733/793 co-relation queries the response was YES. [2020-10-16 01:22:40,666 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 416 events. 186/416 cut-off events. For 733/793 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2342 event pairs, 96 based on Foata normal form. 17/393 useless extension candidates. Maximal degree in co-relation 1203. Up to 263 conditions per place. [2020-10-16 01:22:40,669 INFO L132 encePairwiseOnDemand]: 196/202 looper letters, 15 selfloop transitions, 11 changer transitions 0/51 dead transitions. [2020-10-16 01:22:40,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 279 flow [2020-10-16 01:22:40,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:22:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:22:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2020-10-16 01:22:40,674 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7945544554455446 [2020-10-16 01:22:40,674 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 642 transitions. [2020-10-16 01:22:40,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 642 transitions. [2020-10-16 01:22:40,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:40,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 642 transitions. [2020-10-16 01:22:40,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:22:40,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:22:40,678 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:22:40,679 INFO L185 Difference]: Start difference. First operand has 50 places, 42 transitions, 189 flow. Second operand 4 states and 642 transitions. [2020-10-16 01:22:40,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 279 flow [2020-10-16 01:22:40,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 274 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:22:40,683 INFO L241 Difference]: Finished difference. Result has 54 places, 48 transitions, 258 flow [2020-10-16 01:22:40,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2020-10-16 01:22:40,684 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2020-10-16 01:22:40,684 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 258 flow [2020-10-16 01:22:40,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:22:40,684 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:40,685 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:40,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:22:40,685 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:40,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:40,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1497503110, now seen corresponding path program 1 times [2020-10-16 01:22:40,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:40,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478992594] [2020-10-16 01:22:40,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:40,732 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:40,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478992594] [2020-10-16 01:22:40,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:40,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:22:40,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969587511] [2020-10-16 01:22:40,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:22:40,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:40,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:22:40,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:22:40,738 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 202 [2020-10-16 01:22:40,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 258 flow. Second operand 3 states. [2020-10-16 01:22:40,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:40,740 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 202 [2020-10-16 01:22:40,740 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:40,826 INFO L129 PetriNetUnfolder]: 96/294 cut-off events. [2020-10-16 01:22:40,826 INFO L130 PetriNetUnfolder]: For 1247/1298 co-relation queries the response was YES. [2020-10-16 01:22:40,829 INFO L80 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 294 events. 96/294 cut-off events. For 1247/1298 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1783 event pairs, 40 based on Foata normal form. 9/283 useless extension candidates. Maximal degree in co-relation 927. Up to 108 conditions per place. [2020-10-16 01:22:40,832 INFO L132 encePairwiseOnDemand]: 199/202 looper letters, 1 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2020-10-16 01:22:40,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 272 flow [2020-10-16 01:22:40,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:22:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:22:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2020-10-16 01:22:40,835 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9075907590759076 [2020-10-16 01:22:40,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 550 transitions. [2020-10-16 01:22:40,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 550 transitions. [2020-10-16 01:22:40,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:40,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 550 transitions. [2020-10-16 01:22:40,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:22:40,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:22:40,838 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:22:40,838 INFO L185 Difference]: Start difference. First operand has 54 places, 48 transitions, 258 flow. Second operand 3 states and 550 transitions. [2020-10-16 01:22:40,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 272 flow [2020-10-16 01:22:40,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 266 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:22:40,847 INFO L241 Difference]: Finished difference. Result has 56 places, 48 transitions, 272 flow [2020-10-16 01:22:40,848 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2020-10-16 01:22:40,848 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2020-10-16 01:22:40,848 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 272 flow [2020-10-16 01:22:40,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:22:40,849 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:40,849 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:40,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:22:40,849 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:40,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:40,850 INFO L82 PathProgramCache]: Analyzing trace with hash 965409150, now seen corresponding path program 1 times [2020-10-16 01:22:40,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:40,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565094130] [2020-10-16 01:22:40,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:41,081 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:41,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565094130] [2020-10-16 01:22:41,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:41,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:22:41,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645788229] [2020-10-16 01:22:41,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:22:41,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:41,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:22:41,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:22:41,087 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 202 [2020-10-16 01:22:41,088 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 272 flow. Second operand 7 states. [2020-10-16 01:22:41,088 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:41,088 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 202 [2020-10-16 01:22:41,088 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:41,355 INFO L129 PetriNetUnfolder]: 166/392 cut-off events. [2020-10-16 01:22:41,356 INFO L130 PetriNetUnfolder]: For 1052/1105 co-relation queries the response was YES. [2020-10-16 01:22:41,357 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 392 events. 166/392 cut-off events. For 1052/1105 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2235 event pairs, 19 based on Foata normal form. 15/384 useless extension candidates. Maximal degree in co-relation 1360. Up to 184 conditions per place. [2020-10-16 01:22:41,360 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 16 selfloop transitions, 16 changer transitions 0/57 dead transitions. [2020-10-16 01:22:41,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 380 flow [2020-10-16 01:22:41,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:22:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:22:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 797 transitions. [2020-10-16 01:22:41,364 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7891089108910891 [2020-10-16 01:22:41,365 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 797 transitions. [2020-10-16 01:22:41,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 797 transitions. [2020-10-16 01:22:41,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:41,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 797 transitions. [2020-10-16 01:22:41,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:22:41,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:22:41,369 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:22:41,369 INFO L185 Difference]: Start difference. First operand has 56 places, 48 transitions, 272 flow. Second operand 5 states and 797 transitions. [2020-10-16 01:22:41,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 380 flow [2020-10-16 01:22:41,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:22:41,375 INFO L241 Difference]: Finished difference. Result has 60 places, 51 transitions, 333 flow [2020-10-16 01:22:41,375 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2020-10-16 01:22:41,376 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2020-10-16 01:22:41,376 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 333 flow [2020-10-16 01:22:41,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:22:41,376 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:41,376 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:41,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:22:41,376 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:41,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:41,377 INFO L82 PathProgramCache]: Analyzing trace with hash -157216220, now seen corresponding path program 1 times [2020-10-16 01:22:41,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:41,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467436749] [2020-10-16 01:22:41,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:41,503 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:41,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467436749] [2020-10-16 01:22:41,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:41,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:22:41,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331082522] [2020-10-16 01:22:41,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:22:41,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:41,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:22:41,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:22:41,506 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 202 [2020-10-16 01:22:41,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 333 flow. Second operand 4 states. [2020-10-16 01:22:41,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:41,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 202 [2020-10-16 01:22:41,507 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:41,753 INFO L129 PetriNetUnfolder]: 639/1250 cut-off events. [2020-10-16 01:22:41,753 INFO L130 PetriNetUnfolder]: For 2790/2983 co-relation queries the response was YES. [2020-10-16 01:22:41,764 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3735 conditions, 1250 events. 639/1250 cut-off events. For 2790/2983 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 8968 event pairs, 282 based on Foata normal form. 110/1208 useless extension candidates. Maximal degree in co-relation 3710. Up to 680 conditions per place. [2020-10-16 01:22:41,776 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 12 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2020-10-16 01:22:41,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 403 flow [2020-10-16 01:22:41,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:22:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:22:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 862 transitions. [2020-10-16 01:22:41,780 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8534653465346534 [2020-10-16 01:22:41,780 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 862 transitions. [2020-10-16 01:22:41,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 862 transitions. [2020-10-16 01:22:41,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:41,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 862 transitions. [2020-10-16 01:22:41,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:22:41,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:22:41,785 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:22:41,785 INFO L185 Difference]: Start difference. First operand has 60 places, 51 transitions, 333 flow. Second operand 5 states and 862 transitions. [2020-10-16 01:22:41,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 403 flow [2020-10-16 01:22:41,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 378 flow, removed 5 selfloop flow, removed 2 redundant places. [2020-10-16 01:22:41,793 INFO L241 Difference]: Finished difference. Result has 65 places, 60 transitions, 391 flow [2020-10-16 01:22:41,793 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2020-10-16 01:22:41,794 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2020-10-16 01:22:41,794 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 391 flow [2020-10-16 01:22:41,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:22:41,794 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:41,794 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:41,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:22:41,794 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:41,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:41,795 INFO L82 PathProgramCache]: Analyzing trace with hash 461416102, now seen corresponding path program 1 times [2020-10-16 01:22:41,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:41,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442858678] [2020-10-16 01:22:41,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:41,882 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:41,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442858678] [2020-10-16 01:22:41,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:41,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:22:41,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908719977] [2020-10-16 01:22:41,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:22:41,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:41,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:22:41,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:22:41,886 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 202 [2020-10-16 01:22:41,887 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 391 flow. Second operand 5 states. [2020-10-16 01:22:41,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:41,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 202 [2020-10-16 01:22:41,887 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:42,129 INFO L129 PetriNetUnfolder]: 468/1010 cut-off events. [2020-10-16 01:22:42,129 INFO L130 PetriNetUnfolder]: For 3119/4401 co-relation queries the response was YES. [2020-10-16 01:22:42,139 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4100 conditions, 1010 events. 468/1010 cut-off events. For 3119/4401 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 7165 event pairs, 101 based on Foata normal form. 345/1270 useless extension candidates. Maximal degree in co-relation 4072. Up to 675 conditions per place. [2020-10-16 01:22:42,146 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 10 selfloop transitions, 19 changer transitions 0/70 dead transitions. [2020-10-16 01:22:42,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 495 flow [2020-10-16 01:22:42,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:22:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:22:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1207 transitions. [2020-10-16 01:22:42,151 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8536067892503536 [2020-10-16 01:22:42,151 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1207 transitions. [2020-10-16 01:22:42,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1207 transitions. [2020-10-16 01:22:42,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:42,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1207 transitions. [2020-10-16 01:22:42,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:22:42,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:22:42,157 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:22:42,158 INFO L185 Difference]: Start difference. First operand has 65 places, 60 transitions, 391 flow. Second operand 7 states and 1207 transitions. [2020-10-16 01:22:42,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 495 flow [2020-10-16 01:22:42,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 490 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:22:42,168 INFO L241 Difference]: Finished difference. Result has 73 places, 66 transitions, 490 flow [2020-10-16 01:22:42,169 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=490, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2020-10-16 01:22:42,169 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2020-10-16 01:22:42,169 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 490 flow [2020-10-16 01:22:42,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:22:42,169 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:42,170 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:42,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:22:42,170 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:42,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:42,170 INFO L82 PathProgramCache]: Analyzing trace with hash 878122867, now seen corresponding path program 1 times [2020-10-16 01:22:42,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:42,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604418948] [2020-10-16 01:22:42,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:42,261 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:42,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604418948] [2020-10-16 01:22:42,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:42,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:22:42,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448613823] [2020-10-16 01:22:42,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:22:42,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:42,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:22:42,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:22:42,265 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 202 [2020-10-16 01:22:42,266 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 490 flow. Second operand 6 states. [2020-10-16 01:22:42,266 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:42,266 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 202 [2020-10-16 01:22:42,267 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:42,524 INFO L129 PetriNetUnfolder]: 351/805 cut-off events. [2020-10-16 01:22:42,524 INFO L130 PetriNetUnfolder]: For 4686/7979 co-relation queries the response was YES. [2020-10-16 01:22:42,532 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4304 conditions, 805 events. 351/805 cut-off events. For 4686/7979 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 5669 event pairs, 19 based on Foata normal form. 511/1249 useless extension candidates. Maximal degree in co-relation 4272. Up to 616 conditions per place. [2020-10-16 01:22:42,538 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 6 selfloop transitions, 28 changer transitions 4/79 dead transitions. [2020-10-16 01:22:42,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 79 transitions, 692 flow [2020-10-16 01:22:42,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:22:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:22:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1552 transitions. [2020-10-16 01:22:42,544 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8536853685368537 [2020-10-16 01:22:42,544 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1552 transitions. [2020-10-16 01:22:42,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1552 transitions. [2020-10-16 01:22:42,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:42,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1552 transitions. [2020-10-16 01:22:42,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:22:42,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:22:42,551 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:22:42,552 INFO L185 Difference]: Start difference. First operand has 73 places, 66 transitions, 490 flow. Second operand 9 states and 1552 transitions. [2020-10-16 01:22:42,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 79 transitions, 692 flow [2020-10-16 01:22:42,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 79 transitions, 635 flow, removed 18 selfloop flow, removed 4 redundant places. [2020-10-16 01:22:42,568 INFO L241 Difference]: Finished difference. Result has 80 places, 75 transitions, 611 flow [2020-10-16 01:22:42,568 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=611, PETRI_PLACES=80, PETRI_TRANSITIONS=75} [2020-10-16 01:22:42,568 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2020-10-16 01:22:42,568 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 611 flow [2020-10-16 01:22:42,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:22:42,569 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:42,569 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] [2020-10-16 01:22:42,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:22:42,570 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:42,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:42,570 INFO L82 PathProgramCache]: Analyzing trace with hash -282285754, now seen corresponding path program 1 times [2020-10-16 01:22:42,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:42,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059239621] [2020-10-16 01:22:42,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:42,663 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:42,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059239621] [2020-10-16 01:22:42,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:42,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:22:42,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470228627] [2020-10-16 01:22:42,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:22:42,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:42,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:22:42,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:22:42,667 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 202 [2020-10-16 01:22:42,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 611 flow. Second operand 6 states. [2020-10-16 01:22:42,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:42,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 202 [2020-10-16 01:22:42,668 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:43,180 INFO L129 PetriNetUnfolder]: 801/1868 cut-off events. [2020-10-16 01:22:43,180 INFO L130 PetriNetUnfolder]: For 14322/16721 co-relation queries the response was YES. [2020-10-16 01:22:43,200 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8874 conditions, 1868 events. 801/1868 cut-off events. For 14322/16721 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 15899 event pairs, 23 based on Foata normal form. 140/1837 useless extension candidates. Maximal degree in co-relation 8840. Up to 856 conditions per place. [2020-10-16 01:22:43,215 INFO L132 encePairwiseOnDemand]: 197/202 looper letters, 43 selfloop transitions, 15 changer transitions 2/115 dead transitions. [2020-10-16 01:22:43,215 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 115 transitions, 1040 flow [2020-10-16 01:22:43,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:22:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:22:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1257 transitions. [2020-10-16 01:22:43,220 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7778465346534653 [2020-10-16 01:22:43,220 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1257 transitions. [2020-10-16 01:22:43,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1257 transitions. [2020-10-16 01:22:43,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:43,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1257 transitions. [2020-10-16 01:22:43,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:22:43,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:22:43,227 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:22:43,227 INFO L185 Difference]: Start difference. First operand has 80 places, 75 transitions, 611 flow. Second operand 8 states and 1257 transitions. [2020-10-16 01:22:43,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 115 transitions, 1040 flow [2020-10-16 01:22:43,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 115 transitions, 943 flow, removed 34 selfloop flow, removed 4 redundant places. [2020-10-16 01:22:43,393 INFO L241 Difference]: Finished difference. Result has 86 places, 84 transitions, 627 flow [2020-10-16 01:22:43,393 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=627, PETRI_PLACES=86, PETRI_TRANSITIONS=84} [2020-10-16 01:22:43,394 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2020-10-16 01:22:43,394 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 84 transitions, 627 flow [2020-10-16 01:22:43,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:22:43,394 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:43,394 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] [2020-10-16 01:22:43,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:22:43,395 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:43,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:43,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1021721192, now seen corresponding path program 2 times [2020-10-16 01:22:43,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:43,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855654256] [2020-10-16 01:22:43,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:43,544 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:43,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855654256] [2020-10-16 01:22:43,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:43,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:22:43,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268060855] [2020-10-16 01:22:43,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:22:43,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:43,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:22:43,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:22:43,548 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 202 [2020-10-16 01:22:43,549 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 84 transitions, 627 flow. Second operand 7 states. [2020-10-16 01:22:43,549 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:43,549 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 202 [2020-10-16 01:22:43,549 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:43,961 INFO L129 PetriNetUnfolder]: 673/1586 cut-off events. [2020-10-16 01:22:43,961 INFO L130 PetriNetUnfolder]: For 7091/9461 co-relation queries the response was YES. [2020-10-16 01:22:43,977 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6746 conditions, 1586 events. 673/1586 cut-off events. For 7091/9461 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 13366 event pairs, 27 based on Foata normal form. 771/2224 useless extension candidates. Maximal degree in co-relation 6708. Up to 435 conditions per place. [2020-10-16 01:22:43,982 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 2 selfloop transitions, 33 changer transitions 18/89 dead transitions. [2020-10-16 01:22:43,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 761 flow [2020-10-16 01:22:43,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 01:22:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 01:22:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1889 transitions. [2020-10-16 01:22:43,989 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8501350135013501 [2020-10-16 01:22:43,989 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1889 transitions. [2020-10-16 01:22:43,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1889 transitions. [2020-10-16 01:22:43,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:43,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1889 transitions. [2020-10-16 01:22:43,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 01:22:43,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 01:22:43,998 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 01:22:43,998 INFO L185 Difference]: Start difference. First operand has 86 places, 84 transitions, 627 flow. Second operand 11 states and 1889 transitions. [2020-10-16 01:22:43,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 761 flow [2020-10-16 01:22:44,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 89 transitions, 731 flow, removed 8 selfloop flow, removed 3 redundant places. [2020-10-16 01:22:44,066 INFO L241 Difference]: Finished difference. Result has 96 places, 71 transitions, 564 flow [2020-10-16 01:22:44,067 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=564, PETRI_PLACES=96, PETRI_TRANSITIONS=71} [2020-10-16 01:22:44,067 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2020-10-16 01:22:44,067 INFO L481 AbstractCegarLoop]: Abstraction has has 96 places, 71 transitions, 564 flow [2020-10-16 01:22:44,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:22:44,067 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:44,067 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] [2020-10-16 01:22:44,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:22:44,068 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:44,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:44,068 INFO L82 PathProgramCache]: Analyzing trace with hash -265586387, now seen corresponding path program 1 times [2020-10-16 01:22:44,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:44,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158996048] [2020-10-16 01:22:44,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:44,144 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:44,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158996048] [2020-10-16 01:22:44,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:44,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:22:44,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946716760] [2020-10-16 01:22:44,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:22:44,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:44,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:22:44,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:22:44,148 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 202 [2020-10-16 01:22:44,149 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 71 transitions, 564 flow. Second operand 4 states. [2020-10-16 01:22:44,149 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:44,149 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 202 [2020-10-16 01:22:44,149 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:44,374 INFO L129 PetriNetUnfolder]: 642/1498 cut-off events. [2020-10-16 01:22:44,375 INFO L130 PetriNetUnfolder]: For 5441/5839 co-relation queries the response was YES. [2020-10-16 01:22:44,387 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6403 conditions, 1498 events. 642/1498 cut-off events. For 5441/5839 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 12931 event pairs, 20 based on Foata normal form. 25/1344 useless extension candidates. Maximal degree in co-relation 6371. Up to 445 conditions per place. [2020-10-16 01:22:44,392 INFO L132 encePairwiseOnDemand]: 199/202 looper letters, 3 selfloop transitions, 2 changer transitions 8/72 dead transitions. [2020-10-16 01:22:44,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 72 transitions, 576 flow [2020-10-16 01:22:44,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:22:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:22:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 694 transitions. [2020-10-16 01:22:44,396 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8589108910891089 [2020-10-16 01:22:44,396 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 694 transitions. [2020-10-16 01:22:44,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 694 transitions. [2020-10-16 01:22:44,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:44,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 694 transitions. [2020-10-16 01:22:44,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:22:44,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:22:44,400 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:22:44,400 INFO L185 Difference]: Start difference. First operand has 96 places, 71 transitions, 564 flow. Second operand 4 states and 694 transitions. [2020-10-16 01:22:44,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 72 transitions, 576 flow [2020-10-16 01:22:44,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 448 flow, removed 28 selfloop flow, removed 16 redundant places. [2020-10-16 01:22:44,483 INFO L241 Difference]: Finished difference. Result has 81 places, 64 transitions, 398 flow [2020-10-16 01:22:44,483 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=398, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2020-10-16 01:22:44,483 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2020-10-16 01:22:44,483 INFO L481 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 398 flow [2020-10-16 01:22:44,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:22:44,483 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:44,484 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] [2020-10-16 01:22:44,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:22:44,484 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:44,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:44,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1106418271, now seen corresponding path program 2 times [2020-10-16 01:22:44,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:44,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55768883] [2020-10-16 01:22:44,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:44,651 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:44,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55768883] [2020-10-16 01:22:44,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:44,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:22:44,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975966432] [2020-10-16 01:22:44,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:22:44,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:44,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:22:44,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:22:44,655 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 202 [2020-10-16 01:22:44,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 64 transitions, 398 flow. Second operand 8 states. [2020-10-16 01:22:44,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:44,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 202 [2020-10-16 01:22:44,656 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:44,971 INFO L129 PetriNetUnfolder]: 531/1191 cut-off events. [2020-10-16 01:22:44,972 INFO L130 PetriNetUnfolder]: For 3102/3344 co-relation queries the response was YES. [2020-10-16 01:22:44,979 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4309 conditions, 1191 events. 531/1191 cut-off events. For 3102/3344 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 9438 event pairs, 2 based on Foata normal form. 46/1091 useless extension candidates. Maximal degree in co-relation 4277. Up to 360 conditions per place. [2020-10-16 01:22:44,982 INFO L132 encePairwiseOnDemand]: 196/202 looper letters, 8 selfloop transitions, 9 changer transitions 7/71 dead transitions. [2020-10-16 01:22:44,983 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 71 transitions, 506 flow [2020-10-16 01:22:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:22:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:22:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 894 transitions. [2020-10-16 01:22:44,986 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7376237623762376 [2020-10-16 01:22:44,987 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 894 transitions. [2020-10-16 01:22:44,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 894 transitions. [2020-10-16 01:22:44,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:44,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 894 transitions. [2020-10-16 01:22:44,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:22:44,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:22:44,992 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:22:44,992 INFO L185 Difference]: Start difference. First operand has 81 places, 64 transitions, 398 flow. Second operand 6 states and 894 transitions. [2020-10-16 01:22:44,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 71 transitions, 506 flow [2020-10-16 01:22:45,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 71 transitions, 483 flow, removed 6 selfloop flow, removed 6 redundant places. [2020-10-16 01:22:45,043 INFO L241 Difference]: Finished difference. Result has 80 places, 62 transitions, 397 flow [2020-10-16 01:22:45,043 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=397, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2020-10-16 01:22:45,043 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2020-10-16 01:22:45,044 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 397 flow [2020-10-16 01:22:45,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:22:45,044 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:45,044 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] [2020-10-16 01:22:45,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:22:45,044 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:45,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:45,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2140911155, now seen corresponding path program 3 times [2020-10-16 01:22:45,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:45,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290999716] [2020-10-16 01:22:45,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:22:45,080 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:22:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:22:45,115 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:22:45,153 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:22:45,153 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:22:45,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 01:22:45,155 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 01:22:45,169 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] L2-->L853: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In-1742682269 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In-1742682269 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-1742682269 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-1742682269 256) 0))) (let ((.cse3 (or .cse9 .cse8)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse2 (or .cse7 .cse6)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (= ~y$r_buff1_thd0~0_Out-1742682269 ~y$r_buff1_thd0~0_In-1742682269) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1742682269| ULTIMATE.start_assume_abort_if_not_~cond_Out-1742682269) (or (and .cse0 (= ~y$w_buff0~0_In-1742682269 ~y~0_Out-1742682269) .cse1) (and .cse2 (or (and .cse3 (= ~y~0_Out-1742682269 ~y~0_In-1742682269)) (and .cse4 (= ~y$w_buff1~0_In-1742682269 ~y~0_Out-1742682269) .cse5)))) (or (and .cse3 (= ~y$w_buff1_used~0_In-1742682269 ~y$w_buff1_used~0_Out-1742682269)) (and .cse4 (= ~y$w_buff1_used~0_Out-1742682269 0) .cse5)) (= ~y$r_buff0_thd0~0_Out-1742682269 ~y$r_buff0_thd0~0_In-1742682269) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1742682269 0)) (or (and .cse2 (= ~y$w_buff0_used~0_In-1742682269 ~y$w_buff0_used~0_Out-1742682269)) (and .cse0 .cse1 (= ~y$w_buff0_used~0_Out-1742682269 0)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1742682269|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1742682269, ~y$w_buff1~0=~y$w_buff1~0_In-1742682269, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1742682269, ~y$w_buff0~0=~y$w_buff0~0_In-1742682269, ~y~0=~y~0_In-1742682269, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1742682269, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1742682269} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1742682269, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1742682269|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1742682269|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1742682269|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1742682269|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1742682269|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1742682269|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1742682269|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1742682269, ~y$w_buff1~0=~y$w_buff1~0_In-1742682269, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1742682269, ~y$w_buff0~0=~y$w_buff0~0_In-1742682269, ~y~0=~y~0_Out-1742682269, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1742682269, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1742682269} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 01:22:45,176 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:45,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,179 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:45,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,179 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:45,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,179 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:45,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,180 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:45,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,180 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:45,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,180 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:45,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,181 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:45,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,181 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:45,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,181 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:45,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,182 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:45,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,182 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:45,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,183 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:45,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,183 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:45,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,183 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:45,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,184 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:45,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,184 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:45,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,185 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:45,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,186 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:45,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,186 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:45,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,186 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:45,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,187 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:45,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,187 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:45,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,187 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:45,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,188 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:45,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,188 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:45,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,188 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:45,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,189 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:45,189 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:45,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:22:45 BasicIcfg [2020-10-16 01:22:45,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:22:45,306 INFO L168 Benchmark]: Toolchain (without parser) took 19675.69 ms. Allocated memory was 253.2 MB in the beginning and 655.4 MB in the end (delta: 402.1 MB). Free memory was 208.4 MB in the beginning and 330.9 MB in the end (delta: -122.5 MB). Peak memory consumption was 279.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:22:45,307 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:22:45,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.23 ms. Allocated memory was 253.2 MB in the beginning and 321.9 MB in the end (delta: 68.7 MB). Free memory was 208.4 MB in the beginning and 272.2 MB in the end (delta: -63.8 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:22:45,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.08 ms. Allocated memory is still 321.9 MB. Free memory was 272.2 MB in the beginning and 269.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:22:45,310 INFO L168 Benchmark]: Boogie Preprocessor took 39.33 ms. Allocated memory is still 321.9 MB. Free memory was 269.7 MB in the beginning and 267.1 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:45,310 INFO L168 Benchmark]: RCFGBuilder took 2342.43 ms. Allocated memory was 321.9 MB in the beginning and 360.7 MB in the end (delta: 38.8 MB). Free memory was 267.1 MB in the beginning and 185.1 MB in the end (delta: 82.1 MB). Peak memory consumption was 120.9 MB. Max. memory is 14.2 GB. [2020-10-16 01:22:45,314 INFO L168 Benchmark]: TraceAbstraction took 16489.37 ms. Allocated memory was 360.7 MB in the beginning and 655.4 MB in the end (delta: 294.6 MB). Free memory was 185.1 MB in the beginning and 330.9 MB in the end (delta: -145.8 MB). Peak memory consumption was 148.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:22:45,319 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.36 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 733.23 ms. Allocated memory was 253.2 MB in the beginning and 321.9 MB in the end (delta: 68.7 MB). Free memory was 208.4 MB in the beginning and 272.2 MB in the end (delta: -63.8 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 65.08 ms. Allocated memory is still 321.9 MB. Free memory was 272.2 MB in the beginning and 269.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.33 ms. Allocated memory is still 321.9 MB. Free memory was 269.7 MB in the beginning and 267.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2342.43 ms. Allocated memory was 321.9 MB in the beginning and 360.7 MB in the end (delta: 38.8 MB). Free memory was 267.1 MB in the beginning and 185.1 MB in the end (delta: 82.1 MB). Peak memory consumption was 120.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 16489.37 ms. Allocated memory was 360.7 MB in the beginning and 655.4 MB in the end (delta: 294.6 MB). Free memory was 185.1 MB in the beginning and 330.9 MB in the end (delta: -145.8 MB). Peak memory consumption was 148.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1773 VarBasedMoverChecksPositive, 103 VarBasedMoverChecksNegative, 33 SemBasedMoverChecksPositive, 70 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 224 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.8s, 118 PlacesBefore, 42 PlacesAfterwards, 107 TransitionsBefore, 30 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 7754 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_p0_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; [L713] 0 int y = 0; [L714] 0 _Bool y$flush_delayed; [L715] 0 int y$mem_tmp; [L716] 0 _Bool y$r_buff0_thd0; [L717] 0 _Bool y$r_buff0_thd1; [L718] 0 _Bool y$r_buff0_thd2; [L719] 0 _Bool y$r_buff0_thd3; [L720] 0 _Bool y$r_buff0_thd4; [L721] 0 _Bool y$r_buff1_thd0; [L722] 0 _Bool y$r_buff1_thd1; [L723] 0 _Bool y$r_buff1_thd2; [L724] 0 _Bool y$r_buff1_thd3; [L725] 0 _Bool y$r_buff1_thd4; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L835] 0 pthread_t t773; [L836] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t774; [L838] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] 0 pthread_t t775; [L840] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L841] 0 pthread_t t776; [L842] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L784] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L804] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L807] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L810] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L739] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L813] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L813] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L814] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L814] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L815] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L816] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L817] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L817] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L757] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L794] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L820] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 4 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L856] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L857] 0 y$flush_delayed = weak$$choice2 [L858] 0 y$mem_tmp = y [L859] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L859] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L859] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L860] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L860] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L861] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L861] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L862] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L862] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L863] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L863] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L864] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L865] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L865] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L867] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L867] 0 y = y$flush_delayed ? y$mem_tmp : y [L868] 0 y$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_p0_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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 110 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: 16.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.0s, HoareTripleCheckerStatistics: 64 SDtfs, 52 SDslu, 24 SDs, 0 SdLazy, 401 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=627occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 32756 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...