/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-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:05:27,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:05:27,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:05:27,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:05:27,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:05:27,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:05:27,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:05:27,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:05:27,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:05:27,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:05:27,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:05:27,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:05:27,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:05:27,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:05:27,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:05:27,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:05:27,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:05:27,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:05:27,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:05:27,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:05:27,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:05:27,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:05:27,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:05:27,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:05:27,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:05:27,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:05:27,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:05:27,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:05:27,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:05:27,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:05:27,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:05:27,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:05:27,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:05:27,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:05:27,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:05:27,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:05:27,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:05:27,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:05:27,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:05:27,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:05:27,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:05:27,459 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-SemanticLooper.epf [2020-10-16 05:05:27,505 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:05:27,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:05:27,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:05:27,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:05:27,508 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:05:27,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:05:27,508 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:05:27,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:05:27,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:05:27,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:05:27,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:05:27,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:05:27,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:05:27,511 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:05:27,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:05:27,511 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:05:27,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:05:27,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:05:27,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:05:27,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:05:27,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:05:27,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:05:27,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:05:27,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:05:27,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:05:27,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:05:27,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:05:27,514 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:05:27,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:05:27,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:05:27,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:05:27,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:05:27,814 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:05:27,814 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:05:27,815 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2020-10-16 05:05:27,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3f6725b/949c3d61bfc7413aabf1a47545129196/FLAGd388f58a7 [2020-10-16 05:05:28,416 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:05:28,417 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2020-10-16 05:05:28,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3f6725b/949c3d61bfc7413aabf1a47545129196/FLAGd388f58a7 [2020-10-16 05:05:28,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3f6725b/949c3d61bfc7413aabf1a47545129196 [2020-10-16 05:05:28,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:05:28,785 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:05:28,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:05:28,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:05:28,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:05:28,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:05:28" (1/1) ... [2020-10-16 05:05:28,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@520d4173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:05:28, skipping insertion in model container [2020-10-16 05:05:28,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:05:28" (1/1) ... [2020-10-16 05:05:28,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:05:28,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:05:29,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:05:29,405 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:05:29,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:05:29,552 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:05:29,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:05:29 WrapperNode [2020-10-16 05:05:29,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:05:29,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:05:29,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:05:29,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:05:29,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:05:29" (1/1) ... [2020-10-16 05:05:29,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:05:29" (1/1) ... [2020-10-16 05:05:29,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:05:29,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:05:29,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:05:29,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:05:29,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:05:29" (1/1) ... [2020-10-16 05:05:29,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:05:29" (1/1) ... [2020-10-16 05:05:29,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:05:29" (1/1) ... [2020-10-16 05:05:29,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:05:29" (1/1) ... [2020-10-16 05:05:29,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:05:29" (1/1) ... [2020-10-16 05:05:29,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:05:29" (1/1) ... [2020-10-16 05:05:29,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:05:29" (1/1) ... [2020-10-16 05:05:29,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:05:29,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:05:29,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:05:29,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:05:29,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:05:29" (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 05:05:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:05:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:05:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:05:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:05:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:05:29,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:05:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:05:29,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:05:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 05:05:29,750 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 05:05:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:05:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:05:29,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:05:29,752 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 05:05:31,788 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:05:31,788 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 05:05:31,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:05:31 BoogieIcfgContainer [2020-10-16 05:05:31,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:05:31,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:05:31,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:05:31,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:05:31,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:05:28" (1/3) ... [2020-10-16 05:05:31,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542073f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:05:31, skipping insertion in model container [2020-10-16 05:05:31,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:05:29" (2/3) ... [2020-10-16 05:05:31,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542073f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:05:31, skipping insertion in model container [2020-10-16 05:05:31,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:05:31" (3/3) ... [2020-10-16 05:05:31,800 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc.i [2020-10-16 05:05:31,812 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:05:31,820 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 05:05:31,821 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:05:31,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,853 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,854 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,854 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,854 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,858 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,859 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,862 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,862 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,871 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,872 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,873 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,877 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,878 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,882 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,882 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:05:31,905 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 05:05:31,930 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:05:31,931 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:05:31,931 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:05:31,931 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:05:31,931 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:05:31,931 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:05:31,932 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:05:31,932 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:05:31,947 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-16 05:05:31,998 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-16 05:05:31,998 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:05:32,004 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 05:05:32,004 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 90 transitions, 195 flow [2020-10-16 05:05:32,012 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 87 transitions, 183 flow [2020-10-16 05:05:32,015 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:05:32,018 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 87 transitions, 183 flow [2020-10-16 05:05:32,022 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 87 transitions, 183 flow [2020-10-16 05:05:32,023 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 95 places, 87 transitions, 183 flow [2020-10-16 05:05:32,096 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-16 05:05:32,097 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:05:32,098 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 05:05:32,100 INFO L117 LiptonReduction]: Number of co-enabled transitions 1560 [2020-10-16 05:05:32,909 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 05:05:33,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:05:33,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:33,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:05:33,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:33,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:33,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:33,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:33,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:33,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:33,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:33,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:33,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:33,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:33,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:33,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:33,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:33,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:33,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:33,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:33,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:33,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:33,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:33,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:33,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:33,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:33,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:05:33,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:33,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 05:05:33,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:05:33,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:05:33,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:33,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:33,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:33,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:33,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:33,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:05:33,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:05:33,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:05:33,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:05:33,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:33,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:05:33,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:33,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:33,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:33,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:33,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:33,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:33,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:05:33,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:05:33,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:05:33,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:05:33,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:33,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:33,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 05:05:33,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:05:33,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:05:33,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,137 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 05:05:34,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:34,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:34,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:34,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:34,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:34,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:34,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:34,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:34,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:34,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:34,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:05:34,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:05:34,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:05:34,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:05:34,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:34,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 05:05:34,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:05:34,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:05:34,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:05:34,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:34,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:05:34,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:34,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:05:34,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:34,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 05:05:34,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:34,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:05:34,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:34,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-16 05:05:34,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:34,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:05:34,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:34,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:05:34,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:05:34,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:05:34,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:05:34,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:34,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:05:34,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:34,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:05:34,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:34,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:05:34,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:34,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 05:05:34,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:34,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:34,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:34,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:34,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:34,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:34,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:34,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:34,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:34,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:34,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:34,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:05:34,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:05:34,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:05:34,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:05:34,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:34,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:34,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 05:05:34,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:05:34,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:05:34,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:05:35,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:35,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 05:05:35,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:05:35,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:05:35,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:35,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:35,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:35,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:35,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:35,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:35,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:35,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:35,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:35,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:35,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:05:35,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:05:35,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:05:35,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:05:35,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:35,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 05:05:35,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:05:35,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:05:35,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:35,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:35,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:35,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:35,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:35,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:35,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:35,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:35,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:05:35,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:05:35,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:05:35,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:05:35,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:05:35,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:05:35,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:35,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:05:35,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:35,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:35,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:36,578 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-10-16 05:05:36,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-16 05:05:36,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:36,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:36,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:37,540 WARN L193 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 107 [2020-10-16 05:05:37,950 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 05:05:38,064 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-16 05:05:39,265 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 243 DAG size of output: 203 [2020-10-16 05:05:39,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 05:05:39,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:39,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:05:39,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:05:40,443 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-10-16 05:05:40,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:40,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:40,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:40,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:40,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:40,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:40,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:05:40,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:40,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:40,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:40,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:40,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:40,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:05:40,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:05:40,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:05:40,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:05:40,821 INFO L132 LiptonReduction]: Checked pairs total: 3946 [2020-10-16 05:05:40,821 INFO L134 LiptonReduction]: Total number of compositions: 78 [2020-10-16 05:05:40,824 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8812 [2020-10-16 05:05:40,830 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2020-10-16 05:05:40,831 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:05:40,831 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:40,832 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 05:05:40,832 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1035167, now seen corresponding path program 1 times [2020-10-16 05:05:40,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:40,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780113108] [2020-10-16 05:05:40,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:41,062 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 05:05:41,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780113108] [2020-10-16 05:05:41,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:41,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:05:41,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5941802] [2020-10-16 05:05:41,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:05:41,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:41,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:05:41,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:05:41,095 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2020-10-16 05:05:41,128 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states. [2020-10-16 05:05:41,128 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:41,128 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2020-10-16 05:05:41,130 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:41,250 INFO L129 PetriNetUnfolder]: 69/141 cut-off events. [2020-10-16 05:05:41,250 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:05:41,251 INFO L80 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 141 events. 69/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 620 event pairs, 54 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 259. Up to 89 conditions per place. [2020-10-16 05:05:41,253 INFO L132 encePairwiseOnDemand]: 165/168 looper letters, 9 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2020-10-16 05:05:41,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 87 flow [2020-10-16 05:05:41,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:05:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:05:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2020-10-16 05:05:41,273 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8313492063492064 [2020-10-16 05:05:41,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2020-10-16 05:05:41,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2020-10-16 05:05:41,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:41,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2020-10-16 05:05:41,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:05:41,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:05:41,293 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:05:41,295 INFO L185 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 419 transitions. [2020-10-16 05:05:41,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 87 flow [2020-10-16 05:05:41,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 05:05:41,301 INFO L241 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2020-10-16 05:05:41,304 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2020-10-16 05:05:41,305 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2020-10-16 05:05:41,306 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2020-10-16 05:05:41,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:05:41,306 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:41,306 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:05:41,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:05:41,307 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:41,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:41,307 INFO L82 PathProgramCache]: Analyzing trace with hash 793045883, now seen corresponding path program 1 times [2020-10-16 05:05:41,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:41,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251240483] [2020-10-16 05:05:41,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:41,465 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 05:05:41,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251240483] [2020-10-16 05:05:41,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:41,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:05:41,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98155815] [2020-10-16 05:05:41,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:05:41,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:41,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:05:41,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:05:41,472 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 168 [2020-10-16 05:05:41,473 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states. [2020-10-16 05:05:41,473 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:41,473 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 168 [2020-10-16 05:05:41,474 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:41,507 INFO L129 PetriNetUnfolder]: 12/62 cut-off events. [2020-10-16 05:05:41,508 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:05:41,509 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 62 events. 12/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 208 event pairs, 6 based on Foata normal form. 1/59 useless extension candidates. Maximal degree in co-relation 90. Up to 25 conditions per place. [2020-10-16 05:05:41,510 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 5 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2020-10-16 05:05:41,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 23 transitions, 72 flow [2020-10-16 05:05:41,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:05:41,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:05:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2020-10-16 05:05:41,516 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8630952380952381 [2020-10-16 05:05:41,516 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2020-10-16 05:05:41,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2020-10-16 05:05:41,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:41,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2020-10-16 05:05:41,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:05:41,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:05:41,522 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:05:41,522 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 435 transitions. [2020-10-16 05:05:41,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 23 transitions, 72 flow [2020-10-16 05:05:41,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 23 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:05:41,523 INFO L241 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2020-10-16 05:05:41,524 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2020-10-16 05:05:41,524 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2020-10-16 05:05:41,525 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2020-10-16 05:05:41,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:05:41,525 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:41,525 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:05:41,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:05:41,525 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:41,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:41,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1657178972, now seen corresponding path program 1 times [2020-10-16 05:05:41,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:41,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364910669] [2020-10-16 05:05:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:05:41,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364910669] [2020-10-16 05:05:41,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:41,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:05:41,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826784576] [2020-10-16 05:05:41,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:05:41,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:41,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:05:41,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:05:41,683 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 168 [2020-10-16 05:05:41,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand 3 states. [2020-10-16 05:05:41,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:41,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 168 [2020-10-16 05:05:41,684 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:41,765 INFO L129 PetriNetUnfolder]: 112/236 cut-off events. [2020-10-16 05:05:41,765 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-16 05:05:41,767 INFO L80 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 236 events. 112/236 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1104 event pairs, 56 based on Foata normal form. 2/222 useless extension candidates. Maximal degree in co-relation 455. Up to 164 conditions per place. [2020-10-16 05:05:41,769 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 9 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2020-10-16 05:05:41,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 97 flow [2020-10-16 05:05:41,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:05:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:05:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2020-10-16 05:05:41,772 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7817460317460317 [2020-10-16 05:05:41,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2020-10-16 05:05:41,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2020-10-16 05:05:41,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:41,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2020-10-16 05:05:41,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:05:41,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:05:41,775 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:05:41,775 INFO L185 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 3 states and 394 transitions. [2020-10-16 05:05:41,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 97 flow [2020-10-16 05:05:41,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:05:41,776 INFO L241 Difference]: Finished difference. Result has 32 places, 24 transitions, 81 flow [2020-10-16 05:05:41,777 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2020-10-16 05:05:41,777 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2020-10-16 05:05:41,777 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 81 flow [2020-10-16 05:05:41,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:05:41,777 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:41,777 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:05:41,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:05:41,778 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:41,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:41,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1907850104, now seen corresponding path program 1 times [2020-10-16 05:05:41,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:41,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995931031] [2020-10-16 05:05:41,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:41,874 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 05:05:41,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995931031] [2020-10-16 05:05:41,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:41,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:05:41,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265540131] [2020-10-16 05:05:41,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:05:41,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:41,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:05:41,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:05:41,879 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 168 [2020-10-16 05:05:41,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 81 flow. Second operand 4 states. [2020-10-16 05:05:41,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:41,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 168 [2020-10-16 05:05:41,880 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:42,002 INFO L129 PetriNetUnfolder]: 165/302 cut-off events. [2020-10-16 05:05:42,002 INFO L130 PetriNetUnfolder]: For 130/133 co-relation queries the response was YES. [2020-10-16 05:05:42,003 INFO L80 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 302 events. 165/302 cut-off events. For 130/133 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1306 event pairs, 55 based on Foata normal form. 8/284 useless extension candidates. Maximal degree in co-relation 709. Up to 236 conditions per place. [2020-10-16 05:05:42,006 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 10 selfloop transitions, 7 changer transitions 0/30 dead transitions. [2020-10-16 05:05:42,006 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 129 flow [2020-10-16 05:05:42,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:05:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:05:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2020-10-16 05:05:42,010 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7529761904761905 [2020-10-16 05:05:42,010 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 506 transitions. [2020-10-16 05:05:42,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 506 transitions. [2020-10-16 05:05:42,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:42,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 506 transitions. [2020-10-16 05:05:42,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:05:42,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:05:42,013 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:05:42,013 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 81 flow. Second operand 4 states and 506 transitions. [2020-10-16 05:05:42,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 129 flow [2020-10-16 05:05:42,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:05:42,016 INFO L241 Difference]: Finished difference. Result has 35 places, 28 transitions, 117 flow [2020-10-16 05:05:42,016 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2020-10-16 05:05:42,016 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2020-10-16 05:05:42,016 INFO L481 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 117 flow [2020-10-16 05:05:42,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:05:42,016 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:42,017 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:05:42,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:05:42,017 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:42,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:42,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1906408604, now seen corresponding path program 2 times [2020-10-16 05:05:42,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:42,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281470747] [2020-10-16 05:05:42,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:42,077 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 05:05:42,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281470747] [2020-10-16 05:05:42,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:42,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:05:42,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235241706] [2020-10-16 05:05:42,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:05:42,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:42,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:05:42,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:05:42,081 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 168 [2020-10-16 05:05:42,081 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 117 flow. Second operand 4 states. [2020-10-16 05:05:42,081 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:42,082 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 168 [2020-10-16 05:05:42,082 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:42,207 INFO L129 PetriNetUnfolder]: 96/195 cut-off events. [2020-10-16 05:05:42,207 INFO L130 PetriNetUnfolder]: For 113/161 co-relation queries the response was YES. [2020-10-16 05:05:42,208 INFO L80 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 195 events. 96/195 cut-off events. For 113/161 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 815 event pairs, 21 based on Foata normal form. 12/193 useless extension candidates. Maximal degree in co-relation 567. Up to 122 conditions per place. [2020-10-16 05:05:42,210 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 14 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2020-10-16 05:05:42,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 175 flow [2020-10-16 05:05:42,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:05:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:05:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2020-10-16 05:05:42,213 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7797619047619048 [2020-10-16 05:05:42,214 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2020-10-16 05:05:42,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2020-10-16 05:05:42,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:42,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2020-10-16 05:05:42,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:05:42,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:05:42,217 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:05:42,217 INFO L185 Difference]: Start difference. First operand has 35 places, 28 transitions, 117 flow. Second operand 4 states and 524 transitions. [2020-10-16 05:05:42,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 175 flow [2020-10-16 05:05:42,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 05:05:42,220 INFO L241 Difference]: Finished difference. Result has 37 places, 28 transitions, 121 flow [2020-10-16 05:05:42,220 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2020-10-16 05:05:42,221 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2020-10-16 05:05:42,221 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 121 flow [2020-10-16 05:05:42,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:05:42,221 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:42,221 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:05:42,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:05:42,221 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:42,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:42,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1867324486, now seen corresponding path program 1 times [2020-10-16 05:05:42,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:42,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878687554] [2020-10-16 05:05:42,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:42,277 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 05:05:42,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878687554] [2020-10-16 05:05:42,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:42,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:05:42,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120665959] [2020-10-16 05:05:42,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:05:42,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:42,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:05:42,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:05:42,280 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 168 [2020-10-16 05:05:42,281 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 121 flow. Second operand 4 states. [2020-10-16 05:05:42,281 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:42,281 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 168 [2020-10-16 05:05:42,281 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:42,403 INFO L129 PetriNetUnfolder]: 177/339 cut-off events. [2020-10-16 05:05:42,403 INFO L130 PetriNetUnfolder]: For 379/438 co-relation queries the response was YES. [2020-10-16 05:05:42,404 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 339 events. 177/339 cut-off events. For 379/438 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1580 event pairs, 62 based on Foata normal form. 12/340 useless extension candidates. Maximal degree in co-relation 1015. Up to 256 conditions per place. [2020-10-16 05:05:42,407 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 21 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2020-10-16 05:05:42,407 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 220 flow [2020-10-16 05:05:42,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:05:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:05:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2020-10-16 05:05:42,410 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7514880952380952 [2020-10-16 05:05:42,411 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2020-10-16 05:05:42,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2020-10-16 05:05:42,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:42,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2020-10-16 05:05:42,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:05:42,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:05:42,414 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:05:42,414 INFO L185 Difference]: Start difference. First operand has 37 places, 28 transitions, 121 flow. Second operand 4 states and 505 transitions. [2020-10-16 05:05:42,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 220 flow [2020-10-16 05:05:42,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 208 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 05:05:42,417 INFO L241 Difference]: Finished difference. Result has 40 places, 33 transitions, 166 flow [2020-10-16 05:05:42,418 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2020-10-16 05:05:42,418 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2020-10-16 05:05:42,418 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 166 flow [2020-10-16 05:05:42,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:05:42,418 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:42,418 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:05:42,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:05:42,419 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:42,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:42,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1907115466, now seen corresponding path program 2 times [2020-10-16 05:05:42,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:42,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533701753] [2020-10-16 05:05:42,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:42,490 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 05:05:42,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533701753] [2020-10-16 05:05:42,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:42,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:05:42,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332247293] [2020-10-16 05:05:42,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:05:42,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:42,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:05:42,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:05:42,493 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 168 [2020-10-16 05:05:42,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 166 flow. Second operand 4 states. [2020-10-16 05:05:42,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:42,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 168 [2020-10-16 05:05:42,494 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:42,602 INFO L129 PetriNetUnfolder]: 183/348 cut-off events. [2020-10-16 05:05:42,603 INFO L130 PetriNetUnfolder]: For 748/786 co-relation queries the response was YES. [2020-10-16 05:05:42,604 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 348 events. 183/348 cut-off events. For 748/786 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1624 event pairs, 53 based on Foata normal form. 14/342 useless extension candidates. Maximal degree in co-relation 1085. Up to 234 conditions per place. [2020-10-16 05:05:42,607 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 13 selfloop transitions, 12 changer transitions 0/43 dead transitions. [2020-10-16 05:05:42,608 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 260 flow [2020-10-16 05:05:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:05:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:05:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2020-10-16 05:05:42,611 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7529761904761905 [2020-10-16 05:05:42,611 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 506 transitions. [2020-10-16 05:05:42,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 506 transitions. [2020-10-16 05:05:42,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:42,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 506 transitions. [2020-10-16 05:05:42,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:05:42,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:05:42,614 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:05:42,614 INFO L185 Difference]: Start difference. First operand has 40 places, 33 transitions, 166 flow. Second operand 4 states and 506 transitions. [2020-10-16 05:05:42,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 260 flow [2020-10-16 05:05:42,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 05:05:42,619 INFO L241 Difference]: Finished difference. Result has 45 places, 40 transitions, 255 flow [2020-10-16 05:05:42,619 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2020-10-16 05:05:42,619 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2020-10-16 05:05:42,619 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 255 flow [2020-10-16 05:05:42,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:05:42,620 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:42,620 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:05:42,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:05:42,620 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:42,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:42,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1569843266, now seen corresponding path program 1 times [2020-10-16 05:05:42,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:42,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150273268] [2020-10-16 05:05:42,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05: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 05:05:42,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150273268] [2020-10-16 05:05:42,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:42,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:05:42,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960216524] [2020-10-16 05:05:42,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:05:42,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:42,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:05:42,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:05:42,666 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 168 [2020-10-16 05:05:42,667 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 255 flow. Second operand 4 states. [2020-10-16 05:05:42,667 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:42,667 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 168 [2020-10-16 05:05:42,667 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:42,749 INFO L129 PetriNetUnfolder]: 123/313 cut-off events. [2020-10-16 05:05:42,749 INFO L130 PetriNetUnfolder]: For 1029/1102 co-relation queries the response was YES. [2020-10-16 05:05:42,751 INFO L80 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 313 events. 123/313 cut-off events. For 1029/1102 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1791 event pairs, 30 based on Foata normal form. 26/326 useless extension candidates. Maximal degree in co-relation 939. Up to 154 conditions per place. [2020-10-16 05:05:42,754 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 5 selfloop transitions, 7 changer transitions 7/44 dead transitions. [2020-10-16 05:05:42,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 305 flow [2020-10-16 05:05:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:05:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:05:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2020-10-16 05:05:42,758 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8377976190476191 [2020-10-16 05:05:42,758 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2020-10-16 05:05:42,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2020-10-16 05:05:42,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:42,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2020-10-16 05:05:42,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:05:42,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:05:42,763 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:05:42,763 INFO L185 Difference]: Start difference. First operand has 45 places, 40 transitions, 255 flow. Second operand 4 states and 563 transitions. [2020-10-16 05:05:42,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 305 flow [2020-10-16 05:05:42,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 297 flow, removed 4 selfloop flow, removed 0 redundant places. [2020-10-16 05:05:42,768 INFO L241 Difference]: Finished difference. Result has 49 places, 35 transitions, 227 flow [2020-10-16 05:05:42,768 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2020-10-16 05:05:42,769 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2020-10-16 05:05:42,769 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 227 flow [2020-10-16 05:05:42,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:05:42,769 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:42,769 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:05:42,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:05:42,770 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:42,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:42,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1796340298, now seen corresponding path program 1 times [2020-10-16 05:05:42,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:42,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234789860] [2020-10-16 05:05:42,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:42,827 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 05:05:42,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234789860] [2020-10-16 05:05:42,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:42,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:05:42,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967564869] [2020-10-16 05:05:42,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:05:42,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:42,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:05:42,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:05:42,831 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 168 [2020-10-16 05:05:42,832 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 227 flow. Second operand 4 states. [2020-10-16 05:05:42,832 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:42,832 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 168 [2020-10-16 05:05:42,832 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:43,003 INFO L129 PetriNetUnfolder]: 138/276 cut-off events. [2020-10-16 05:05:43,004 INFO L130 PetriNetUnfolder]: For 1045/1077 co-relation queries the response was YES. [2020-10-16 05:05:43,005 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 276 events. 138/276 cut-off events. For 1045/1077 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1218 event pairs, 49 based on Foata normal form. 4/268 useless extension candidates. Maximal degree in co-relation 1066. Up to 168 conditions per place. [2020-10-16 05:05:43,008 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 16 selfloop transitions, 10 changer transitions 0/43 dead transitions. [2020-10-16 05:05:43,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 325 flow [2020-10-16 05:05:43,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:05:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:05:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2020-10-16 05:05:43,012 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7886904761904762 [2020-10-16 05:05:43,012 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2020-10-16 05:05:43,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2020-10-16 05:05:43,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:43,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2020-10-16 05:05:43,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:05:43,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:05:43,017 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:05:43,017 INFO L185 Difference]: Start difference. First operand has 49 places, 35 transitions, 227 flow. Second operand 4 states and 530 transitions. [2020-10-16 05:05:43,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 325 flow [2020-10-16 05:05:43,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 296 flow, removed 5 selfloop flow, removed 5 redundant places. [2020-10-16 05:05:43,023 INFO L241 Difference]: Finished difference. Result has 48 places, 39 transitions, 251 flow [2020-10-16 05:05:43,023 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2020-10-16 05:05:43,024 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2020-10-16 05:05:43,024 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 251 flow [2020-10-16 05:05:43,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:05:43,024 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:43,024 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:05:43,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:05:43,025 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:43,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:43,025 INFO L82 PathProgramCache]: Analyzing trace with hash 841293948, now seen corresponding path program 2 times [2020-10-16 05:05:43,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:43,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234577149] [2020-10-16 05:05:43,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:43,095 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 05:05:43,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234577149] [2020-10-16 05:05:43,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:43,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:05:43,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668380272] [2020-10-16 05:05:43,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:05:43,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:43,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:05:43,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:05:43,098 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 168 [2020-10-16 05:05:43,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 251 flow. Second operand 5 states. [2020-10-16 05:05:43,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:43,099 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 168 [2020-10-16 05:05:43,099 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:43,203 INFO L129 PetriNetUnfolder]: 130/267 cut-off events. [2020-10-16 05:05:43,204 INFO L130 PetriNetUnfolder]: For 989/1032 co-relation queries the response was YES. [2020-10-16 05:05:43,205 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 267 events. 130/267 cut-off events. For 989/1032 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1231 event pairs, 30 based on Foata normal form. 7/262 useless extension candidates. Maximal degree in co-relation 1082. Up to 164 conditions per place. [2020-10-16 05:05:43,208 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 15 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2020-10-16 05:05:43,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 319 flow [2020-10-16 05:05:43,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:05:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:05:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2020-10-16 05:05:43,211 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7872023809523809 [2020-10-16 05:05:43,211 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2020-10-16 05:05:43,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2020-10-16 05:05:43,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:43,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2020-10-16 05:05:43,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:05:43,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:05:43,214 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:05:43,215 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 251 flow. Second operand 4 states and 529 transitions. [2020-10-16 05:05:43,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 319 flow [2020-10-16 05:05:43,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 305 flow, removed 4 selfloop flow, removed 1 redundant places. [2020-10-16 05:05:43,219 INFO L241 Difference]: Finished difference. Result has 51 places, 39 transitions, 268 flow [2020-10-16 05:05:43,219 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2020-10-16 05:05:43,219 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2020-10-16 05:05:43,219 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 268 flow [2020-10-16 05:05:43,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:05:43,220 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:43,220 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:05:43,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 05:05:43,220 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:43,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:43,220 INFO L82 PathProgramCache]: Analyzing trace with hash -507143276, now seen corresponding path program 1 times [2020-10-16 05:05:43,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:43,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304501174] [2020-10-16 05:05:43,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:43,257 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 05:05:43,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304501174] [2020-10-16 05:05:43,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:43,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:05:43,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671045420] [2020-10-16 05:05:43,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:05:43,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:43,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:05:43,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:05:43,260 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 168 [2020-10-16 05:05:43,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 268 flow. Second operand 3 states. [2020-10-16 05:05:43,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:43,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 168 [2020-10-16 05:05:43,261 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:43,336 INFO L129 PetriNetUnfolder]: 154/357 cut-off events. [2020-10-16 05:05:43,336 INFO L130 PetriNetUnfolder]: For 1532/1583 co-relation queries the response was YES. [2020-10-16 05:05:43,338 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 357 events. 154/357 cut-off events. For 1532/1583 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2000 event pairs, 66 based on Foata normal form. 18/360 useless extension candidates. Maximal degree in co-relation 1247. Up to 188 conditions per place. [2020-10-16 05:05:43,341 INFO L132 encePairwiseOnDemand]: 165/168 looper letters, 9 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2020-10-16 05:05:43,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 41 transitions, 308 flow [2020-10-16 05:05:43,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:05:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:05:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2020-10-16 05:05:43,344 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2020-10-16 05:05:43,344 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2020-10-16 05:05:43,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2020-10-16 05:05:43,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:43,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2020-10-16 05:05:43,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:05:43,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:05:43,347 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:05:43,347 INFO L185 Difference]: Start difference. First operand has 51 places, 39 transitions, 268 flow. Second operand 3 states and 434 transitions. [2020-10-16 05:05:43,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 41 transitions, 308 flow [2020-10-16 05:05:43,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 41 transitions, 286 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 05:05:43,351 INFO L241 Difference]: Finished difference. Result has 51 places, 39 transitions, 257 flow [2020-10-16 05:05:43,352 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2020-10-16 05:05:43,352 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2020-10-16 05:05:43,352 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 257 flow [2020-10-16 05:05:43,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:05:43,352 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:43,352 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:05:43,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 05:05:43,353 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash -505528796, now seen corresponding path program 1 times [2020-10-16 05:05:43,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:43,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473824518] [2020-10-16 05:05:43,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:43,473 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 05:05:43,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473824518] [2020-10-16 05:05:43,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:43,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:05:43,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972300187] [2020-10-16 05:05:43,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:05:43,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:43,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:05:43,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:05:43,479 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 168 [2020-10-16 05:05:43,480 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 257 flow. Second operand 6 states. [2020-10-16 05:05:43,480 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:43,480 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 168 [2020-10-16 05:05:43,480 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:43,644 INFO L129 PetriNetUnfolder]: 148/314 cut-off events. [2020-10-16 05:05:43,645 INFO L130 PetriNetUnfolder]: For 1054/1107 co-relation queries the response was YES. [2020-10-16 05:05:43,646 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 314 events. 148/314 cut-off events. For 1054/1107 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1561 event pairs, 26 based on Foata normal form. 12/319 useless extension candidates. Maximal degree in co-relation 1242. Up to 195 conditions per place. [2020-10-16 05:05:43,649 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 17 selfloop transitions, 10 changer transitions 0/44 dead transitions. [2020-10-16 05:05:43,649 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 341 flow [2020-10-16 05:05:43,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:05:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:05:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2020-10-16 05:05:43,652 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7157738095238095 [2020-10-16 05:05:43,652 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2020-10-16 05:05:43,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2020-10-16 05:05:43,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:43,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2020-10-16 05:05:43,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:05:43,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:05:43,655 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:05:43,655 INFO L185 Difference]: Start difference. First operand has 51 places, 39 transitions, 257 flow. Second operand 4 states and 481 transitions. [2020-10-16 05:05:43,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 341 flow [2020-10-16 05:05:43,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 336 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 05:05:43,659 INFO L241 Difference]: Finished difference. Result has 54 places, 41 transitions, 296 flow [2020-10-16 05:05:43,660 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2020-10-16 05:05:43,660 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2020-10-16 05:05:43,660 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 296 flow [2020-10-16 05:05:43,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:05:43,660 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:43,661 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:05:43,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 05:05:43,661 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:43,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash -505500710, now seen corresponding path program 2 times [2020-10-16 05:05:43,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:43,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084461583] [2020-10-16 05:05:43,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:43,722 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 05:05:43,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084461583] [2020-10-16 05:05:43,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:43,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:05:43,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850464130] [2020-10-16 05:05:43,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:05:43,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:43,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:05:43,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:05:43,726 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 168 [2020-10-16 05:05:43,727 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 296 flow. Second operand 5 states. [2020-10-16 05:05:43,727 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:43,727 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 168 [2020-10-16 05:05:43,727 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:43,895 INFO L129 PetriNetUnfolder]: 157/343 cut-off events. [2020-10-16 05:05:43,895 INFO L130 PetriNetUnfolder]: For 1363/1411 co-relation queries the response was YES. [2020-10-16 05:05:43,898 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 343 events. 157/343 cut-off events. For 1363/1411 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1794 event pairs, 51 based on Foata normal form. 8/342 useless extension candidates. Maximal degree in co-relation 1434. Up to 209 conditions per place. [2020-10-16 05:05:43,901 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 19 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2020-10-16 05:05:43,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 386 flow [2020-10-16 05:05:43,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:05:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:05:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 522 transitions. [2020-10-16 05:05:43,905 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7767857142857143 [2020-10-16 05:05:43,905 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 522 transitions. [2020-10-16 05:05:43,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 522 transitions. [2020-10-16 05:05:43,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:43,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 522 transitions. [2020-10-16 05:05:43,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:05:43,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:05:43,909 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:05:43,909 INFO L185 Difference]: Start difference. First operand has 54 places, 41 transitions, 296 flow. Second operand 4 states and 522 transitions. [2020-10-16 05:05:43,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 386 flow [2020-10-16 05:05:43,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:05:43,915 INFO L241 Difference]: Finished difference. Result has 56 places, 44 transitions, 341 flow [2020-10-16 05:05:43,916 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=341, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2020-10-16 05:05:43,916 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2020-10-16 05:05:43,916 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 341 flow [2020-10-16 05:05:43,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:05:43,916 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:43,917 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:05:43,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 05:05:43,917 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:43,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:43,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1458427429, now seen corresponding path program 1 times [2020-10-16 05:05:43,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:43,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689367924] [2020-10-16 05:05:43,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:43,967 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 05:05:43,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689367924] [2020-10-16 05:05:43,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:43,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:05:43,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95277030] [2020-10-16 05:05:43,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:05:43,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:43,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:05:43,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:05:43,970 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 168 [2020-10-16 05:05:43,971 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 341 flow. Second operand 4 states. [2020-10-16 05:05:43,971 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:43,971 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 168 [2020-10-16 05:05:43,971 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:44,088 INFO L129 PetriNetUnfolder]: 225/519 cut-off events. [2020-10-16 05:05:44,088 INFO L130 PetriNetUnfolder]: For 1911/1961 co-relation queries the response was YES. [2020-10-16 05:05:44,091 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2064 conditions, 519 events. 225/519 cut-off events. For 1911/1961 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3227 event pairs, 78 based on Foata normal form. 22/532 useless extension candidates. Maximal degree in co-relation 2037. Up to 263 conditions per place. [2020-10-16 05:05:44,094 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 7 selfloop transitions, 3 changer transitions 3/47 dead transitions. [2020-10-16 05:05:44,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 387 flow [2020-10-16 05:05:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:05:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:05:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 699 transitions. [2020-10-16 05:05:44,097 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8321428571428572 [2020-10-16 05:05:44,097 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 699 transitions. [2020-10-16 05:05:44,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 699 transitions. [2020-10-16 05:05:44,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:44,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 699 transitions. [2020-10-16 05:05:44,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:05:44,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:05:44,101 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:05:44,101 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 341 flow. Second operand 5 states and 699 transitions. [2020-10-16 05:05:44,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 387 flow [2020-10-16 05:05:44,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 47 transitions, 370 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 05:05:44,110 INFO L241 Difference]: Finished difference. Result has 60 places, 44 transitions, 339 flow [2020-10-16 05:05:44,110 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2020-10-16 05:05:44,110 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2020-10-16 05:05:44,110 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 339 flow [2020-10-16 05:05:44,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:05:44,111 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:44,111 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:05:44,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 05:05:44,111 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:44,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1459971229, now seen corresponding path program 2 times [2020-10-16 05:05:44,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:44,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542376988] [2020-10-16 05:05:44,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:44,237 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 05:05:44,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542376988] [2020-10-16 05:05:44,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:44,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:05:44,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91925827] [2020-10-16 05:05:44,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:05:44,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:44,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:05:44,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:05:44,244 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168 [2020-10-16 05:05:44,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 339 flow. Second operand 4 states. [2020-10-16 05:05:44,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:44,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168 [2020-10-16 05:05:44,245 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:44,429 INFO L129 PetriNetUnfolder]: 238/549 cut-off events. [2020-10-16 05:05:44,429 INFO L130 PetriNetUnfolder]: For 1744/1890 co-relation queries the response was YES. [2020-10-16 05:05:44,433 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 549 events. 238/549 cut-off events. For 1744/1890 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3453 event pairs, 85 based on Foata normal form. 132/649 useless extension candidates. Maximal degree in co-relation 1889. Up to 258 conditions per place. [2020-10-16 05:05:44,436 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 10 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2020-10-16 05:05:44,436 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 395 flow [2020-10-16 05:05:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:05:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:05:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2020-10-16 05:05:44,440 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8071428571428572 [2020-10-16 05:05:44,441 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2020-10-16 05:05:44,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2020-10-16 05:05:44,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:44,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2020-10-16 05:05:44,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:05:44,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:05:44,445 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:05:44,445 INFO L185 Difference]: Start difference. First operand has 60 places, 44 transitions, 339 flow. Second operand 5 states and 678 transitions. [2020-10-16 05:05:44,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 395 flow [2020-10-16 05:05:44,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 387 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 05:05:44,452 INFO L241 Difference]: Finished difference. Result has 62 places, 51 transitions, 399 flow [2020-10-16 05:05:44,453 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=399, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2020-10-16 05:05:44,453 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 30 predicate places. [2020-10-16 05:05:44,453 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 399 flow [2020-10-16 05:05:44,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:05:44,453 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:44,453 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:05:44,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 05:05:44,454 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:44,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:44,454 INFO L82 PathProgramCache]: Analyzing trace with hash -84670818, now seen corresponding path program 1 times [2020-10-16 05:05:44,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:44,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425505009] [2020-10-16 05:05:44,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:44,596 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 05:05:44,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425505009] [2020-10-16 05:05:44,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:44,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:05:44,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669180014] [2020-10-16 05:05:44,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:05:44,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:44,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:05:44,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:05:44,599 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168 [2020-10-16 05:05:44,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 399 flow. Second operand 5 states. [2020-10-16 05:05:44,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:44,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168 [2020-10-16 05:05:44,600 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:44,723 INFO L129 PetriNetUnfolder]: 123/366 cut-off events. [2020-10-16 05:05:44,723 INFO L130 PetriNetUnfolder]: For 1661/2130 co-relation queries the response was YES. [2020-10-16 05:05:44,726 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 366 events. 123/366 cut-off events. For 1661/2130 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2370 event pairs, 16 based on Foata normal form. 258/610 useless extension candidates. Maximal degree in co-relation 1530. Up to 195 conditions per place. [2020-10-16 05:05:44,729 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 5 selfloop transitions, 15 changer transitions 3/59 dead transitions. [2020-10-16 05:05:44,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 59 transitions, 485 flow [2020-10-16 05:05:44,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:05:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:05:44,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 949 transitions. [2020-10-16 05:05:44,733 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8069727891156463 [2020-10-16 05:05:44,734 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 949 transitions. [2020-10-16 05:05:44,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 949 transitions. [2020-10-16 05:05:44,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:44,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 949 transitions. [2020-10-16 05:05:44,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:05:44,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:05:44,740 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:05:44,740 INFO L185 Difference]: Start difference. First operand has 62 places, 51 transitions, 399 flow. Second operand 7 states and 949 transitions. [2020-10-16 05:05:44,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 59 transitions, 485 flow [2020-10-16 05:05:44,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 59 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:05:44,747 INFO L241 Difference]: Finished difference. Result has 70 places, 56 transitions, 476 flow [2020-10-16 05:05:44,747 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=476, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2020-10-16 05:05:44,747 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2020-10-16 05:05:44,748 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 476 flow [2020-10-16 05:05:44,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:05:44,748 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:44,748 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 05:05:44,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 05:05:44,748 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:44,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:44,749 INFO L82 PathProgramCache]: Analyzing trace with hash 958291401, now seen corresponding path program 1 times [2020-10-16 05:05:44,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:44,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091681963] [2020-10-16 05:05:44,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:44,842 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 05:05:44,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091681963] [2020-10-16 05:05:44,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:44,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:05:44,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016033822] [2020-10-16 05:05:44,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:05:44,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:44,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:05:44,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:05:44,845 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168 [2020-10-16 05:05:44,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 476 flow. Second operand 6 states. [2020-10-16 05:05:44,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:44,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168 [2020-10-16 05:05:44,846 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:44,985 INFO L129 PetriNetUnfolder]: 93/305 cut-off events. [2020-10-16 05:05:44,985 INFO L130 PetriNetUnfolder]: For 2256/2923 co-relation queries the response was YES. [2020-10-16 05:05:44,987 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 305 events. 93/305 cut-off events. For 2256/2923 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2032 event pairs, 4 based on Foata normal form. 211/504 useless extension candidates. Maximal degree in co-relation 1490. Up to 175 conditions per place. [2020-10-16 05:05:44,989 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 2 selfloop transitions, 19 changer transitions 14/60 dead transitions. [2020-10-16 05:05:44,989 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 60 transitions, 554 flow [2020-10-16 05:05:44,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:05:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:05:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1214 transitions. [2020-10-16 05:05:44,994 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8029100529100529 [2020-10-16 05:05:44,994 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1214 transitions. [2020-10-16 05:05:44,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1214 transitions. [2020-10-16 05:05:44,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:44,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1214 transitions. [2020-10-16 05:05:44,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:05:45,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:05:45,000 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:05:45,000 INFO L185 Difference]: Start difference. First operand has 70 places, 56 transitions, 476 flow. Second operand 9 states and 1214 transitions. [2020-10-16 05:05:45,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 60 transitions, 554 flow [2020-10-16 05:05:45,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 60 transitions, 479 flow, removed 24 selfloop flow, removed 5 redundant places. [2020-10-16 05:05:45,009 INFO L241 Difference]: Finished difference. Result has 76 places, 46 transitions, 377 flow [2020-10-16 05:05:45,009 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=377, PETRI_PLACES=76, PETRI_TRANSITIONS=46} [2020-10-16 05:05:45,009 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2020-10-16 05:05:45,009 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 46 transitions, 377 flow [2020-10-16 05:05:45,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:05:45,010 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:45,010 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 05:05:45,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 05:05:45,010 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:45,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:45,010 INFO L82 PathProgramCache]: Analyzing trace with hash 542492762, now seen corresponding path program 1 times [2020-10-16 05:05:45,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:45,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720349090] [2020-10-16 05:05:45,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:45,141 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 05:05:45,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720349090] [2020-10-16 05:05:45,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:45,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:05:45,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286463792] [2020-10-16 05:05:45,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:05:45,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:45,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:05:45,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:05:45,144 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 168 [2020-10-16 05:05:45,144 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 46 transitions, 377 flow. Second operand 6 states. [2020-10-16 05:05:45,145 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:45,145 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 168 [2020-10-16 05:05:45,145 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:45,285 INFO L129 PetriNetUnfolder]: 51/178 cut-off events. [2020-10-16 05:05:45,286 INFO L130 PetriNetUnfolder]: For 1096/1179 co-relation queries the response was YES. [2020-10-16 05:05:45,287 INFO L80 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 178 events. 51/178 cut-off events. For 1096/1179 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 994 event pairs, 1 based on Foata normal form. 27/195 useless extension candidates. Maximal degree in co-relation 776. Up to 55 conditions per place. [2020-10-16 05:05:45,288 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 5 selfloop transitions, 14 changer transitions 2/49 dead transitions. [2020-10-16 05:05:45,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 49 transitions, 457 flow [2020-10-16 05:05:45,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:05:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:05:45,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 736 transitions. [2020-10-16 05:05:45,292 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7301587301587301 [2020-10-16 05:05:45,292 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 736 transitions. [2020-10-16 05:05:45,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 736 transitions. [2020-10-16 05:05:45,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:45,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 736 transitions. [2020-10-16 05:05:45,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:05:45,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:05:45,297 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:05:45,297 INFO L185 Difference]: Start difference. First operand has 76 places, 46 transitions, 377 flow. Second operand 6 states and 736 transitions. [2020-10-16 05:05:45,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 49 transitions, 457 flow [2020-10-16 05:05:45,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 49 transitions, 366 flow, removed 18 selfloop flow, removed 18 redundant places. [2020-10-16 05:05:45,303 INFO L241 Difference]: Finished difference. Result has 61 places, 47 transitions, 345 flow [2020-10-16 05:05:45,304 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2020-10-16 05:05:45,304 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2020-10-16 05:05:45,304 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 345 flow [2020-10-16 05:05:45,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:05:45,304 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:45,304 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 05:05:45,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 05:05:45,305 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:45,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:45,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1778316156, now seen corresponding path program 2 times [2020-10-16 05:05:45,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:45,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983032013] [2020-10-16 05:05:45,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:05:45,517 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 05:05:45,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983032013] [2020-10-16 05:05:45,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:05:45,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:05:45,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162926320] [2020-10-16 05:05:45,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:05:45,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:05:45,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:05:45,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:05:45,521 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 168 [2020-10-16 05:05:45,522 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 345 flow. Second operand 8 states. [2020-10-16 05:05:45,522 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:05:45,522 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 168 [2020-10-16 05:05:45,522 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:05:45,806 INFO L129 PetriNetUnfolder]: 72/251 cut-off events. [2020-10-16 05:05:45,806 INFO L130 PetriNetUnfolder]: For 817/888 co-relation queries the response was YES. [2020-10-16 05:05:45,807 INFO L80 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 251 events. 72/251 cut-off events. For 817/888 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 1613 event pairs, 2 based on Foata normal form. 34/270 useless extension candidates. Maximal degree in co-relation 941. Up to 90 conditions per place. [2020-10-16 05:05:45,809 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 15 selfloop transitions, 7 changer transitions 8/58 dead transitions. [2020-10-16 05:05:45,809 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 58 transitions, 500 flow [2020-10-16 05:05:45,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:05:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:05:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 884 transitions. [2020-10-16 05:05:45,814 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7517006802721088 [2020-10-16 05:05:45,815 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 884 transitions. [2020-10-16 05:05:45,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 884 transitions. [2020-10-16 05:05:45,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:05:45,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 884 transitions. [2020-10-16 05:05:45,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:05:45,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:05:45,823 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:05:45,823 INFO L185 Difference]: Start difference. First operand has 61 places, 47 transitions, 345 flow. Second operand 7 states and 884 transitions. [2020-10-16 05:05:45,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 58 transitions, 500 flow [2020-10-16 05:05:45,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 465 flow, removed 8 selfloop flow, removed 4 redundant places. [2020-10-16 05:05:45,833 INFO L241 Difference]: Finished difference. Result has 66 places, 46 transitions, 328 flow [2020-10-16 05:05:45,833 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=328, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2020-10-16 05:05:45,833 INFO L342 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2020-10-16 05:05:45,833 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 328 flow [2020-10-16 05:05:45,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:05:45,834 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:05:45,834 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 05:05:45,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 05:05:45,834 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:05:45,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:05:45,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1265657942, now seen corresponding path program 3 times [2020-10-16 05:05:45,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:05:45,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311297587] [2020-10-16 05:05:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:05:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:05:45,885 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:05:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:05:45,941 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:05:45,979 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:05:45,979 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:05:45,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 05:05:45,980 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 05:05:45,994 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L2-->L818: Formula: (let ((.cse8 (= (mod ~y$r_buff1_thd0~0_In-914929540 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-914929540 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In-914929540 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In-914929540 256) 0))) (let ((.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse5 (or .cse6 .cse7))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-914929540 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-914929540|) (or (and .cse0 (= ~y$w_buff1_used~0_Out-914929540 0) .cse1) (and .cse2 (= ~y$w_buff1_used~0_Out-914929540 ~y$w_buff1_used~0_In-914929540))) (= ~y$r_buff1_thd0~0_Out-914929540 ~y$r_buff1_thd0~0_In-914929540) (or (and (= ~y$w_buff0_used~0_Out-914929540 0) .cse3 .cse4) (and (= ~y$w_buff0_used~0_In-914929540 ~y$w_buff0_used~0_Out-914929540) .cse5)) (= ~y$r_buff0_thd0~0_Out-914929540 ~y$r_buff0_thd0~0_In-914929540) (or (and .cse3 (= ~y~0_Out-914929540 ~y$w_buff0~0_In-914929540) .cse4) (and (or (and (= ~y~0_In-914929540 ~y~0_Out-914929540) .cse2) (and (= ~y~0_Out-914929540 ~y$w_buff1~0_In-914929540) .cse0 .cse1)) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-914929540 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-914929540|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-914929540, ~y$w_buff1~0=~y$w_buff1~0_In-914929540, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-914929540, ~y$w_buff0~0=~y$w_buff0~0_In-914929540, ~y~0=~y~0_In-914929540, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-914929540, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-914929540} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-914929540|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-914929540, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-914929540|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-914929540|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-914929540|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-914929540|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-914929540|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-914929540|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-914929540, ~y$w_buff1~0=~y$w_buff1~0_In-914929540, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-914929540, ~y$w_buff0~0=~y$w_buff0~0_In-914929540, ~y~0=~y~0_Out-914929540, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-914929540, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-914929540} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~y$w_buff0_used~0, ~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, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 05:05:46,000 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,003 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,003 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,004 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,004 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,004 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,004 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,004 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,004 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,005 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,005 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,005 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,006 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,006 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,006 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,006 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,007 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,007 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,008 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 05:05:46,008 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,008 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 05:05:46,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,009 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 05:05:46,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,009 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 05:05:46,010 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,010 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 05:05:46,010 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,011 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 05:05:46,012 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,012 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,012 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,012 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,012 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,013 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,013 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,013 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,013 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,013 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,013 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,014 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,014 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,014 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,014 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,014 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:05:46,014 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,015 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 05:05:46,015 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,015 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 05:05:46,015 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,015 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 05:05:46,015 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,015 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 05:05:46,016 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,016 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 05:05:46,016 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,017 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 05:05:46,017 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:05:46,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:05:46 BasicIcfg [2020-10-16 05:05:46,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:05:46,082 INFO L168 Benchmark]: Toolchain (without parser) took 17297.24 ms. Allocated memory was 254.3 MB in the beginning and 645.4 MB in the end (delta: 391.1 MB). Free memory was 208.3 MB in the beginning and 242.8 MB in the end (delta: -34.5 MB). Peak memory consumption was 356.6 MB. Max. memory is 14.2 GB. [2020-10-16 05:05:46,083 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 254.3 MB. Free memory is still 230.7 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:05:46,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.52 ms. Allocated memory was 254.3 MB in the beginning and 323.5 MB in the end (delta: 69.2 MB). Free memory was 208.3 MB in the beginning and 274.2 MB in the end (delta: -65.9 MB). Peak memory consumption was 29.8 MB. Max. memory is 14.2 GB. [2020-10-16 05:05:46,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.41 ms. Allocated memory is still 323.5 MB. Free memory was 274.2 MB in the beginning and 269.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 05:05:46,087 INFO L168 Benchmark]: Boogie Preprocessor took 41.35 ms. Allocated memory is still 323.5 MB. Free memory was 269.2 MB in the beginning and 266.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 05:05:46,090 INFO L168 Benchmark]: RCFGBuilder took 2125.28 ms. Allocated memory was 323.5 MB in the beginning and 362.3 MB in the end (delta: 38.8 MB). Free memory was 266.7 MB in the beginning and 193.5 MB in the end (delta: 73.2 MB). Peak memory consumption was 112.0 MB. Max. memory is 14.2 GB. [2020-10-16 05:05:46,091 INFO L168 Benchmark]: TraceAbstraction took 14287.92 ms. Allocated memory was 362.3 MB in the beginning and 645.4 MB in the end (delta: 283.1 MB). Free memory was 190.3 MB in the beginning and 242.8 MB in the end (delta: -52.5 MB). Peak memory consumption was 230.6 MB. Max. memory is 14.2 GB. [2020-10-16 05:05:46,098 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.24 ms. Allocated memory is still 254.3 MB. Free memory is still 230.7 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 767.52 ms. Allocated memory was 254.3 MB in the beginning and 323.5 MB in the end (delta: 69.2 MB). Free memory was 208.3 MB in the beginning and 274.2 MB in the end (delta: -65.9 MB). Peak memory consumption was 29.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 69.41 ms. Allocated memory is still 323.5 MB. Free memory was 274.2 MB in the beginning and 269.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 41.35 ms. Allocated memory is still 323.5 MB. Free memory was 269.2 MB in the beginning and 266.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2125.28 ms. Allocated memory was 323.5 MB in the beginning and 362.3 MB in the end (delta: 38.8 MB). Free memory was 266.7 MB in the beginning and 193.5 MB in the end (delta: 73.2 MB). Peak memory consumption was 112.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 14287.92 ms. Allocated memory was 362.3 MB in the beginning and 645.4 MB in the end (delta: 283.1 MB). Free memory was 190.3 MB in the beginning and 242.8 MB in the end (delta: -52.5 MB). Peak memory consumption was 230.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 896 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 73 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.7s, 95 PlacesBefore, 32 PlacesAfterwards, 87 TransitionsBefore, 22 TransitionsAfterwards, 1560 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 3946 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L802] 0 pthread_t t2177; [L803] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L728] 1 y$w_buff1 = y$w_buff0 [L729] 1 y$w_buff0 = 2 [L730] 1 y$w_buff1_used = y$w_buff0_used [L731] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L733] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L734] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L735] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L736] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L737] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 pthread_t t2178; [L805] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 pthread_t t2179; [L807] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L745] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L746] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [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 [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L780] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L752] 1 return 0; [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 3 return 0; [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L827] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 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) [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L830] 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) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 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: 14.0s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 81 SDtfs, 37 SDslu, 22 SDs, 0 SdLazy, 394 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=476occurred in iteration=16, 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.2s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 22158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...