/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/safe011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:03:37,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:03:37,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:03:37,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:03:37,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:03:37,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:03:37,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:03:37,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:03:37,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:03:37,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:03:37,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:03:37,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:03:37,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:03:37,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:03:37,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:03:37,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:03:37,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:03:37,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:03:37,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:03:37,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:03:37,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:03:37,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:03:37,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:03:37,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:03:37,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:03:37,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:03:37,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:03:37,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:03:37,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:03:37,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:03:37,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:03:37,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:03:37,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:03:37,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:03:37,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:03:37,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:03:37,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:03:37,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:03:37,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:03:37,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:03:37,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:03:37,171 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:03:37,195 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:03:37,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:03:37,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:03:37,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:03:37,197 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:03:37,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:03:37,197 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:03:37,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:03:37,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:03:37,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:03:37,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:03:37,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:03:37,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:03:37,199 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:03:37,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:03:37,199 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:03:37,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:03:37,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:03:37,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:03:37,200 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:03:37,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:03:37,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:03:37,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:03:37,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:03:37,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:03:37,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:03:37,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:03:37,202 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:03:37,202 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:03:37,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:03:37,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:03:37,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:03:37,525 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:03:37,525 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:03:37,526 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2020-10-16 05:03:37,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2ac3be4/e69cadfb26e741329513608c73b3f128/FLAG8d8fe21ec [2020-10-16 05:03:38,168 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:03:38,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2020-10-16 05:03:38,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2ac3be4/e69cadfb26e741329513608c73b3f128/FLAG8d8fe21ec [2020-10-16 05:03:38,435 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2ac3be4/e69cadfb26e741329513608c73b3f128 [2020-10-16 05:03:38,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:03:38,448 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:03:38,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:03:38,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:03:38,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:03:38,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:03:38" (1/1) ... [2020-10-16 05:03:38,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77674f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:38, skipping insertion in model container [2020-10-16 05:03:38,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:03:38" (1/1) ... [2020-10-16 05:03:38,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:03:38,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:03:39,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:03:39,071 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:03:39,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:03:39,212 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:03:39,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:39 WrapperNode [2020-10-16 05:03:39,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:03:39,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:03:39,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:03:39,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:03:39,223 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:03:39" (1/1) ... [2020-10-16 05:03:39,244 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:03:39" (1/1) ... [2020-10-16 05:03:39,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:03:39,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:03:39,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:03:39,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:03:39,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:39" (1/1) ... [2020-10-16 05:03:39,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:39" (1/1) ... [2020-10-16 05:03:39,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:39" (1/1) ... [2020-10-16 05:03:39,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:39" (1/1) ... [2020-10-16 05:03:39,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:39" (1/1) ... [2020-10-16 05:03:39,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:39" (1/1) ... [2020-10-16 05:03:39,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:39" (1/1) ... [2020-10-16 05:03:39,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:03:39,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:03:39,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:03:39,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:03:39,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:39" (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:03:39,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:03:39,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:03:39,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:03:39,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:03:39,444 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:03:39,445 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:03:39,446 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:03:39,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:03:39,447 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 05:03:39,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 05:03:39,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:03:39,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:03:39,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:03:39,453 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:03:41,649 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:03:41,650 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 05:03:41,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:03:41 BoogieIcfgContainer [2020-10-16 05:03:41,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:03:41,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:03:41,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:03:41,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:03:41,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:03:38" (1/3) ... [2020-10-16 05:03:41,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c22416a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:03:41, skipping insertion in model container [2020-10-16 05:03:41,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:39" (2/3) ... [2020-10-16 05:03:41,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c22416a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:03:41, skipping insertion in model container [2020-10-16 05:03:41,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:03:41" (3/3) ... [2020-10-16 05:03:41,662 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc.i [2020-10-16 05:03:41,675 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:03:41,683 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 05:03:41,684 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:03:41,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,718 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,718 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,722 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,723 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,726 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,726 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,734 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,735 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,744 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,744 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,744 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,746 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,746 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:41,767 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 05:03:41,789 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:03:41,789 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:03:41,790 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:03:41,790 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:03:41,790 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:03:41,790 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:03:41,790 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:03:41,791 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:03:41,805 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 05:03:41,853 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 05:03:41,853 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:03:41,859 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 05:03:41,859 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 05:03:41,866 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 89 transitions, 187 flow [2020-10-16 05:03:41,869 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:03:41,872 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 89 transitions, 187 flow [2020-10-16 05:03:41,875 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 89 transitions, 187 flow [2020-10-16 05:03:41,875 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 97 places, 89 transitions, 187 flow [2020-10-16 05:03:41,931 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 05:03:41,932 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:03:41,933 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 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/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 05:03:41,935 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650 [2020-10-16 05:03:42,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:03:42,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:03:42,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:42,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:03:42,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:42,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:03:42,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:42,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:03:42,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:42,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:42,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:42,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:42,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:42,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:42,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:42,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:42,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:42,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:42,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:42,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:42,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:03:42,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:42,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:03:42,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:42,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:03:42,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:42,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:03:42,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:42,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:42,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:42,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:42,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:42,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:42,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:42,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:42,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:03:42,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:42,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:03:42,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:42,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:03:42,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:42,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:03:42,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:43,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:43,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:43,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:43,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:43,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:43,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:43,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:43,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:43,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:43,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:43,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:43,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:43,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:43,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:43,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:43,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:43,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:43,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:43,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:03:43,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:43,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:03:43,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:43,134 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:03:43,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:03:43,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:03:43,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:03:43,139 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:03:43,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:03:43,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:03:43,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:43,143 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:03:43,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:43,145 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:03:43,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:43,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:03:43,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:43,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:03:43,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:43,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-16 05:03:43,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:03:43,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:03:43,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:44,425 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 05:03:44,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 05:03:44,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:44,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 05:03:44,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:45,262 WARN L193 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-16 05:03:45,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:03:45,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:45,673 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 05:03:46,186 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 05:03:46,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:03:46,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:46,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:46,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:46,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:46,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:46,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:46,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:46,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:47,236 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2020-10-16 05:03:47,536 INFO L132 LiptonReduction]: Checked pairs total: 4695 [2020-10-16 05:03:47,537 INFO L134 LiptonReduction]: Total number of compositions: 76 [2020-10-16 05:03:47,539 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5672 [2020-10-16 05:03:47,545 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2020-10-16 05:03:47,545 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:03:47,545 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:47,546 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 05:03:47,546 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:03:47,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:47,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1041180, now seen corresponding path program 1 times [2020-10-16 05:03:47,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:47,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530715278] [2020-10-16 05:03:47,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:47,744 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:03:47,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530715278] [2020-10-16 05:03:47,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:47,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:03:47,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612098473] [2020-10-16 05:03:47,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:03:47,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:47,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:03:47,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:03:47,775 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 168 [2020-10-16 05:03:47,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states. [2020-10-16 05:03:47,777 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:47,777 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 168 [2020-10-16 05:03:47,779 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:47,878 INFO L129 PetriNetUnfolder]: 49/134 cut-off events. [2020-10-16 05:03:47,879 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:03:47,879 INFO L80 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 134 events. 49/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 602 event pairs, 38 based on Foata normal form. 11/127 useless extension candidates. Maximal degree in co-relation 220. Up to 65 conditions per place. [2020-10-16 05:03:47,882 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 9 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2020-10-16 05:03:47,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 85 flow [2020-10-16 05:03:47,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:03:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:03:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2020-10-16 05:03:47,900 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8432539682539683 [2020-10-16 05:03:47,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2020-10-16 05:03:47,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2020-10-16 05:03:47,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:47,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2020-10-16 05:03:47,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:03:47,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:03:47,920 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:03:47,922 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 425 transitions. [2020-10-16 05:03:47,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 85 flow [2020-10-16 05:03:47,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 05:03:47,928 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2020-10-16 05:03:47,931 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2020-10-16 05:03:47,931 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 05:03:47,932 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2020-10-16 05:03:47,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:03:47,932 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:47,932 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:47,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:03:47,933 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:03:47,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:47,933 INFO L82 PathProgramCache]: Analyzing trace with hash 626468161, now seen corresponding path program 1 times [2020-10-16 05:03:47,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:47,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199208319] [2020-10-16 05:03:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:48,094 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:03:48,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199208319] [2020-10-16 05:03:48,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:48,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:03:48,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195315803] [2020-10-16 05:03:48,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:03:48,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:48,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:03:48,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:03:48,100 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 168 [2020-10-16 05:03:48,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand 4 states. [2020-10-16 05:03:48,101 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:48,101 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 168 [2020-10-16 05:03:48,101 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:48,283 INFO L129 PetriNetUnfolder]: 243/435 cut-off events. [2020-10-16 05:03:48,284 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-10-16 05:03:48,285 INFO L80 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 435 events. 243/435 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2265 event pairs, 137 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 851. Up to 239 conditions per place. [2020-10-16 05:03:48,288 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 11 selfloop transitions, 3 changer transitions 13/39 dead transitions. [2020-10-16 05:03:48,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 148 flow [2020-10-16 05:03:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:03:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:03:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2020-10-16 05:03:48,293 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.736904761904762 [2020-10-16 05:03:48,294 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2020-10-16 05:03:48,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2020-10-16 05:03:48,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:48,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2020-10-16 05:03:48,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:03:48,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:03:48,299 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:03:48,300 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 619 transitions. [2020-10-16 05:03:48,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 148 flow [2020-10-16 05:03:48,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:03:48,302 INFO L241 Difference]: Finished difference. Result has 37 places, 24 transitions, 77 flow [2020-10-16 05:03:48,302 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2020-10-16 05:03:48,303 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 05:03:48,303 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 77 flow [2020-10-16 05:03:48,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:03:48,303 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:48,303 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:48,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:03:48,304 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:03:48,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:48,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2055192665, now seen corresponding path program 1 times [2020-10-16 05:03:48,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:48,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911251841] [2020-10-16 05:03:48,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:48,390 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:03:48,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911251841] [2020-10-16 05:03:48,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:48,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:03:48,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251462005] [2020-10-16 05:03:48,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:03:48,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:48,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:03:48,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:03:48,394 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 168 [2020-10-16 05:03:48,395 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 77 flow. Second operand 4 states. [2020-10-16 05:03:48,395 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:48,395 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 168 [2020-10-16 05:03:48,395 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:48,432 INFO L129 PetriNetUnfolder]: 9/59 cut-off events. [2020-10-16 05:03:48,433 INFO L130 PetriNetUnfolder]: For 33/48 co-relation queries the response was YES. [2020-10-16 05:03:48,433 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 59 events. 9/59 cut-off events. For 33/48 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 186 event pairs, 2 based on Foata normal form. 4/60 useless extension candidates. Maximal degree in co-relation 118. Up to 18 conditions per place. [2020-10-16 05:03:48,434 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 4 selfloop transitions, 4 changer transitions 5/31 dead transitions. [2020-10-16 05:03:48,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 131 flow [2020-10-16 05:03:48,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:03:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:03:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2020-10-16 05:03:48,437 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8261904761904761 [2020-10-16 05:03:48,437 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2020-10-16 05:03:48,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2020-10-16 05:03:48,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:48,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2020-10-16 05:03:48,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:03:48,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:03:48,442 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:03:48,442 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 77 flow. Second operand 5 states and 694 transitions. [2020-10-16 05:03:48,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 131 flow [2020-10-16 05:03:48,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 126 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 05:03:48,444 INFO L241 Difference]: Finished difference. Result has 39 places, 26 transitions, 106 flow [2020-10-16 05:03:48,445 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2020-10-16 05:03:48,445 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2020-10-16 05:03:48,445 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 106 flow [2020-10-16 05:03:48,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:03:48,445 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:48,445 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:48,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:03:48,446 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:03:48,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:48,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2054338336, now seen corresponding path program 1 times [2020-10-16 05:03:48,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:48,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991219804] [2020-10-16 05:03:48,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:48,562 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:03:48,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991219804] [2020-10-16 05:03:48,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:48,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:03:48,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659012605] [2020-10-16 05:03:48,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:03:48,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:48,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:03:48,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:03:48,567 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 168 [2020-10-16 05:03:48,568 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 106 flow. Second operand 4 states. [2020-10-16 05:03:48,569 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:48,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 168 [2020-10-16 05:03:48,570 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:48,787 INFO L129 PetriNetUnfolder]: 201/417 cut-off events. [2020-10-16 05:03:48,787 INFO L130 PetriNetUnfolder]: For 468/480 co-relation queries the response was YES. [2020-10-16 05:03:48,790 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 417 events. 201/417 cut-off events. For 468/480 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2278 event pairs, 111 based on Foata normal form. 20/419 useless extension candidates. Maximal degree in co-relation 1034. Up to 264 conditions per place. [2020-10-16 05:03:48,793 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 11 selfloop transitions, 4 changer transitions 9/40 dead transitions. [2020-10-16 05:03:48,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 200 flow [2020-10-16 05:03:48,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:03:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:03:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2020-10-16 05:03:48,797 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.736904761904762 [2020-10-16 05:03:48,797 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2020-10-16 05:03:48,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2020-10-16 05:03:48,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:48,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2020-10-16 05:03:48,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:03:48,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:03:48,801 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:03:48,802 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 106 flow. Second operand 5 states and 619 transitions. [2020-10-16 05:03:48,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 200 flow [2020-10-16 05:03:48,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 192 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 05:03:48,806 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow [2020-10-16 05:03:48,806 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2020-10-16 05:03:48,807 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2020-10-16 05:03:48,807 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow [2020-10-16 05:03:48,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:03:48,807 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:48,807 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:48,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:03:48,808 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:03:48,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:48,808 INFO L82 PathProgramCache]: Analyzing trace with hash 740293516, now seen corresponding path program 1 times [2020-10-16 05:03:48,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:48,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268032071] [2020-10-16 05:03:48,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:48,920 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:03:48,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268032071] [2020-10-16 05:03:48,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:48,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:03:48,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955296134] [2020-10-16 05:03:48,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:03:48,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:48,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:03:48,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:03:48,924 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 168 [2020-10-16 05:03:48,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand 4 states. [2020-10-16 05:03:48,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:48,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 168 [2020-10-16 05:03:48,925 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:48,959 INFO L129 PetriNetUnfolder]: 13/74 cut-off events. [2020-10-16 05:03:48,960 INFO L130 PetriNetUnfolder]: For 173/217 co-relation queries the response was YES. [2020-10-16 05:03:48,960 INFO L80 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 74 events. 13/74 cut-off events. For 173/217 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 272 event pairs, 3 based on Foata normal form. 5/74 useless extension candidates. Maximal degree in co-relation 196. Up to 22 conditions per place. [2020-10-16 05:03:48,961 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 2 selfloop transitions, 3 changer transitions 2/31 dead transitions. [2020-10-16 05:03:48,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 166 flow [2020-10-16 05:03:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:03:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:03:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2020-10-16 05:03:48,964 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.825 [2020-10-16 05:03:48,964 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2020-10-16 05:03:48,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2020-10-16 05:03:48,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:48,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2020-10-16 05:03:48,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:03:48,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:03:48,968 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:03:48,969 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 5 states and 693 transitions. [2020-10-16 05:03:48,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 166 flow [2020-10-16 05:03:48,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 154 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 05:03:48,971 INFO L241 Difference]: Finished difference. Result has 45 places, 29 transitions, 143 flow [2020-10-16 05:03:48,972 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2020-10-16 05:03:48,972 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2020-10-16 05:03:48,972 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 143 flow [2020-10-16 05:03:48,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:03:48,972 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:48,972 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:48,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:03:48,973 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:03:48,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:48,973 INFO L82 PathProgramCache]: Analyzing trace with hash 740095550, now seen corresponding path program 1 times [2020-10-16 05:03:48,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:48,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171111632] [2020-10-16 05:03:48,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:49,040 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:03:49,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171111632] [2020-10-16 05:03:49,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:49,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:03:49,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748464455] [2020-10-16 05:03:49,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:03:49,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:49,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:03:49,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:03:49,044 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 168 [2020-10-16 05:03:49,045 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 143 flow. Second operand 5 states. [2020-10-16 05:03:49,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:49,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 168 [2020-10-16 05:03:49,045 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:49,273 INFO L129 PetriNetUnfolder]: 251/488 cut-off events. [2020-10-16 05:03:49,274 INFO L130 PetriNetUnfolder]: For 1226/1246 co-relation queries the response was YES. [2020-10-16 05:03:49,276 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 488 events. 251/488 cut-off events. For 1226/1246 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2566 event pairs, 142 based on Foata normal form. 27/493 useless extension candidates. Maximal degree in co-relation 1472. Up to 316 conditions per place. [2020-10-16 05:03:49,280 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 15 selfloop transitions, 9 changer transitions 12/51 dead transitions. [2020-10-16 05:03:49,280 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 316 flow [2020-10-16 05:03:49,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:03:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:03:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2020-10-16 05:03:49,284 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2020-10-16 05:03:49,285 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2020-10-16 05:03:49,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2020-10-16 05:03:49,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:49,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2020-10-16 05:03:49,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:03:49,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:03:49,291 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:03:49,291 INFO L185 Difference]: Start difference. First operand has 45 places, 29 transitions, 143 flow. Second operand 7 states and 840 transitions. [2020-10-16 05:03:49,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 316 flow [2020-10-16 05:03:49,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 292 flow, removed 8 selfloop flow, removed 5 redundant places. [2020-10-16 05:03:49,295 INFO L241 Difference]: Finished difference. Result has 49 places, 34 transitions, 204 flow [2020-10-16 05:03:49,296 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=204, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2020-10-16 05:03:49,296 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2020-10-16 05:03:49,296 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 204 flow [2020-10-16 05:03:49,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:03:49,296 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:49,296 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:49,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:03:49,297 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:03:49,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:49,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1505037470, now seen corresponding path program 1 times [2020-10-16 05:03:49,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:49,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851188874] [2020-10-16 05:03:49,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:49,344 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:03:49,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851188874] [2020-10-16 05:03:49,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:49,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:03:49,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578842020] [2020-10-16 05:03:49,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:03:49,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:49,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:03:49,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:03:49,347 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 168 [2020-10-16 05:03:49,348 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 204 flow. Second operand 4 states. [2020-10-16 05:03:49,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:49,348 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 168 [2020-10-16 05:03:49,348 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:49,390 INFO L129 PetriNetUnfolder]: 18/100 cut-off events. [2020-10-16 05:03:49,390 INFO L130 PetriNetUnfolder]: For 494/613 co-relation queries the response was YES. [2020-10-16 05:03:49,391 INFO L80 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 100 events. 18/100 cut-off events. For 494/613 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 435 event pairs, 5 based on Foata normal form. 5/100 useless extension candidates. Maximal degree in co-relation 333. Up to 28 conditions per place. [2020-10-16 05:03:49,392 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 6 selfloop transitions, 3 changer transitions 2/37 dead transitions. [2020-10-16 05:03:49,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 37 transitions, 262 flow [2020-10-16 05:03:49,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:03:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:03:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2020-10-16 05:03:49,395 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8226190476190476 [2020-10-16 05:03:49,396 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2020-10-16 05:03:49,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2020-10-16 05:03:49,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:49,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2020-10-16 05:03:49,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:03:49,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:03:49,400 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:03:49,401 INFO L185 Difference]: Start difference. First operand has 49 places, 34 transitions, 204 flow. Second operand 5 states and 691 transitions. [2020-10-16 05:03:49,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 37 transitions, 262 flow [2020-10-16 05:03:49,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 37 transitions, 238 flow, removed 12 selfloop flow, removed 2 redundant places. [2020-10-16 05:03:49,404 INFO L241 Difference]: Finished difference. Result has 51 places, 34 transitions, 203 flow [2020-10-16 05:03:49,404 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2020-10-16 05:03:49,405 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2020-10-16 05:03:49,405 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 203 flow [2020-10-16 05:03:49,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:03:49,405 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:49,405 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:49,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:03:49,406 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:03:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash -405265146, now seen corresponding path program 1 times [2020-10-16 05:03:49,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:49,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045493734] [2020-10-16 05:03:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:49,587 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:03:49,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045493734] [2020-10-16 05:03:49,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:49,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:03:49,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585323588] [2020-10-16 05:03:49,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:03:49,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:49,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:03:49,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:03:49,590 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 168 [2020-10-16 05:03:49,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 203 flow. Second operand 7 states. [2020-10-16 05:03:49,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:49,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 168 [2020-10-16 05:03:49,591 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:49,936 INFO L129 PetriNetUnfolder]: 421/802 cut-off events. [2020-10-16 05:03:49,937 INFO L130 PetriNetUnfolder]: For 2816/2864 co-relation queries the response was YES. [2020-10-16 05:03:49,942 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2512 conditions, 802 events. 421/802 cut-off events. For 2816/2864 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4473 event pairs, 108 based on Foata normal form. 43/828 useless extension candidates. Maximal degree in co-relation 2487. Up to 557 conditions per place. [2020-10-16 05:03:49,947 INFO L132 encePairwiseOnDemand]: 160/168 looper letters, 26 selfloop transitions, 10 changer transitions 13/63 dead transitions. [2020-10-16 05:03:49,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 439 flow [2020-10-16 05:03:49,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:03:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:03:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 816 transitions. [2020-10-16 05:03:49,952 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6938775510204082 [2020-10-16 05:03:49,952 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 816 transitions. [2020-10-16 05:03:49,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 816 transitions. [2020-10-16 05:03:49,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:49,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 816 transitions. [2020-10-16 05:03:49,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:03:49,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:03:49,957 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:03:49,957 INFO L185 Difference]: Start difference. First operand has 51 places, 34 transitions, 203 flow. Second operand 7 states and 816 transitions. [2020-10-16 05:03:49,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 439 flow [2020-10-16 05:03:49,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 428 flow, removed 4 selfloop flow, removed 3 redundant places. [2020-10-16 05:03:49,964 INFO L241 Difference]: Finished difference. Result has 57 places, 43 transitions, 287 flow [2020-10-16 05:03:49,965 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=287, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2020-10-16 05:03:49,965 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2020-10-16 05:03:49,965 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 287 flow [2020-10-16 05:03:49,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:03:49,966 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:49,966 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:49,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:03:49,966 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:03:49,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash 260446048, now seen corresponding path program 1 times [2020-10-16 05:03:49,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:49,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626758717] [2020-10-16 05:03:49,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:50,049 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:03:50,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626758717] [2020-10-16 05:03:50,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:50,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:03:50,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735052769] [2020-10-16 05:03:50,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:03:50,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:50,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:03:50,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:03:50,052 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 168 [2020-10-16 05:03:50,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 287 flow. Second operand 4 states. [2020-10-16 05:03:50,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:50,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 168 [2020-10-16 05:03:50,053 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:50,304 INFO L129 PetriNetUnfolder]: 377/708 cut-off events. [2020-10-16 05:03:50,304 INFO L130 PetriNetUnfolder]: For 3869/3931 co-relation queries the response was YES. [2020-10-16 05:03:50,309 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2828 conditions, 708 events. 377/708 cut-off events. For 3869/3931 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3744 event pairs, 132 based on Foata normal form. 33/702 useless extension candidates. Maximal degree in co-relation 2799. Up to 494 conditions per place. [2020-10-16 05:03:50,315 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 19 selfloop transitions, 11 changer transitions 9/62 dead transitions. [2020-10-16 05:03:50,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 493 flow [2020-10-16 05:03:50,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:03:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:03:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2020-10-16 05:03:50,318 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7607142857142857 [2020-10-16 05:03:50,319 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 639 transitions. [2020-10-16 05:03:50,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 639 transitions. [2020-10-16 05:03:50,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:50,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 639 transitions. [2020-10-16 05:03:50,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:03:50,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:03:50,323 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:03:50,323 INFO L185 Difference]: Start difference. First operand has 57 places, 43 transitions, 287 flow. Second operand 5 states and 639 transitions. [2020-10-16 05:03:50,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 493 flow [2020-10-16 05:03:50,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 485 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 05:03:50,333 INFO L241 Difference]: Finished difference. Result has 59 places, 50 transitions, 385 flow [2020-10-16 05:03:50,334 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=385, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2020-10-16 05:03:50,334 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2020-10-16 05:03:50,334 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 385 flow [2020-10-16 05:03:50,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:03:50,334 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:50,335 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:50,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:03:50,335 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:03:50,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:50,335 INFO L82 PathProgramCache]: Analyzing trace with hash 931348766, now seen corresponding path program 1 times [2020-10-16 05:03:50,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:50,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582413110] [2020-10-16 05:03:50,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:50,549 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:03:50,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582413110] [2020-10-16 05:03:50,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:50,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:03:50,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421243821] [2020-10-16 05:03:50,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:03:50,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:50,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:03:50,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:03:50,552 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 168 [2020-10-16 05:03:50,553 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 385 flow. Second operand 6 states. [2020-10-16 05:03:50,553 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:50,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 168 [2020-10-16 05:03:50,553 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:50,832 INFO L129 PetriNetUnfolder]: 352/697 cut-off events. [2020-10-16 05:03:50,832 INFO L130 PetriNetUnfolder]: For 4177/4217 co-relation queries the response was YES. [2020-10-16 05:03:50,838 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2919 conditions, 697 events. 352/697 cut-off events. For 4177/4217 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3889 event pairs, 96 based on Foata normal form. 34/707 useless extension candidates. Maximal degree in co-relation 2887. Up to 434 conditions per place. [2020-10-16 05:03:50,844 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 15 selfloop transitions, 19 changer transitions 8/65 dead transitions. [2020-10-16 05:03:50,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 562 flow [2020-10-16 05:03:50,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:03:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:03:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 741 transitions. [2020-10-16 05:03:50,848 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7351190476190477 [2020-10-16 05:03:50,848 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 741 transitions. [2020-10-16 05:03:50,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 741 transitions. [2020-10-16 05:03:50,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:50,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 741 transitions. [2020-10-16 05:03:50,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:03:50,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:03:50,854 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:03:50,855 INFO L185 Difference]: Start difference. First operand has 59 places, 50 transitions, 385 flow. Second operand 6 states and 741 transitions. [2020-10-16 05:03:50,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 562 flow [2020-10-16 05:03:50,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 65 transitions, 547 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 05:03:50,864 INFO L241 Difference]: Finished difference. Result has 63 places, 54 transitions, 466 flow [2020-10-16 05:03:50,864 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2020-10-16 05:03:50,864 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2020-10-16 05:03:50,865 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 466 flow [2020-10-16 05:03:50,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:03:50,865 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:50,865 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:50,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 05:03:50,865 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:03:50,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:50,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1502253067, now seen corresponding path program 1 times [2020-10-16 05:03:50,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:50,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965250962] [2020-10-16 05:03:50,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:50,938 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:03:50,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965250962] [2020-10-16 05:03:50,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:50,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:03:50,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232276525] [2020-10-16 05:03:50,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:03:50,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:50,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:03:50,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:03:50,941 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 168 [2020-10-16 05:03:50,941 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 466 flow. Second operand 6 states. [2020-10-16 05:03:50,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:50,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 168 [2020-10-16 05:03:50,942 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:51,254 INFO L129 PetriNetUnfolder]: 408/815 cut-off events. [2020-10-16 05:03:51,254 INFO L130 PetriNetUnfolder]: For 6456/6520 co-relation queries the response was YES. [2020-10-16 05:03:51,260 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3995 conditions, 815 events. 408/815 cut-off events. For 6456/6520 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4876 event pairs, 59 based on Foata normal form. 56/850 useless extension candidates. Maximal degree in co-relation 3960. Up to 337 conditions per place. [2020-10-16 05:03:51,265 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 25 selfloop transitions, 14 changer transitions 17/76 dead transitions. [2020-10-16 05:03:51,265 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 76 transitions, 738 flow [2020-10-16 05:03:51,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:03:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:03:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2020-10-16 05:03:51,269 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2020-10-16 05:03:51,269 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2020-10-16 05:03:51,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2020-10-16 05:03:51,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:51,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2020-10-16 05:03:51,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:03:51,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:03:51,275 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:03:51,275 INFO L185 Difference]: Start difference. First operand has 63 places, 54 transitions, 466 flow. Second operand 7 states and 840 transitions. [2020-10-16 05:03:51,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 76 transitions, 738 flow [2020-10-16 05:03:51,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 693 flow, removed 10 selfloop flow, removed 4 redundant places. [2020-10-16 05:03:51,286 INFO L241 Difference]: Finished difference. Result has 67 places, 51 transitions, 440 flow [2020-10-16 05:03:51,286 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2020-10-16 05:03:51,287 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2020-10-16 05:03:51,287 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 440 flow [2020-10-16 05:03:51,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:03:51,287 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:51,287 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:51,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 05:03:51,288 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:03:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:51,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1851370913, now seen corresponding path program 1 times [2020-10-16 05:03:51,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:51,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135229952] [2020-10-16 05:03:51,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:51,400 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:03:51,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135229952] [2020-10-16 05:03:51,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:51,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:03:51,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401278786] [2020-10-16 05:03:51,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:03:51,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:51,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:03:51,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:03:51,403 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 168 [2020-10-16 05:03:51,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 440 flow. Second operand 6 states. [2020-10-16 05:03:51,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:51,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 168 [2020-10-16 05:03:51,404 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:51,787 INFO L129 PetriNetUnfolder]: 337/709 cut-off events. [2020-10-16 05:03:51,787 INFO L130 PetriNetUnfolder]: For 5230/5282 co-relation queries the response was YES. [2020-10-16 05:03:51,792 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3324 conditions, 709 events. 337/709 cut-off events. For 5230/5282 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4246 event pairs, 129 based on Foata normal form. 28/706 useless extension candidates. Maximal degree in co-relation 3287. Up to 438 conditions per place. [2020-10-16 05:03:51,797 INFO L132 encePairwiseOnDemand]: 160/168 looper letters, 20 selfloop transitions, 16 changer transitions 10/71 dead transitions. [2020-10-16 05:03:51,797 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 71 transitions, 724 flow [2020-10-16 05:03:51,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:03:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:03:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 879 transitions. [2020-10-16 05:03:51,801 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7474489795918368 [2020-10-16 05:03:51,801 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 879 transitions. [2020-10-16 05:03:51,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 879 transitions. [2020-10-16 05:03:51,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:51,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 879 transitions. [2020-10-16 05:03:51,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:03:51,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:03:51,807 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:03:51,807 INFO L185 Difference]: Start difference. First operand has 67 places, 51 transitions, 440 flow. Second operand 7 states and 879 transitions. [2020-10-16 05:03:51,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 71 transitions, 724 flow [2020-10-16 05:03:51,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 71 transitions, 678 flow, removed 16 selfloop flow, removed 6 redundant places. [2020-10-16 05:03:51,819 INFO L241 Difference]: Finished difference. Result has 69 places, 56 transitions, 506 flow [2020-10-16 05:03:51,819 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=506, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2020-10-16 05:03:51,819 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2020-10-16 05:03:51,820 INFO L481 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 506 flow [2020-10-16 05:03:51,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:03:51,820 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:51,820 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:51,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 05:03:51,820 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:03:51,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:51,821 INFO L82 PathProgramCache]: Analyzing trace with hash 244893855, now seen corresponding path program 2 times [2020-10-16 05:03:51,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:51,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243737138] [2020-10-16 05:03:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:51,900 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:03:51,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243737138] [2020-10-16 05:03:51,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:51,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:03:51,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132195369] [2020-10-16 05:03:51,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:03:51,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:51,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:03:51,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:03:51,903 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 168 [2020-10-16 05:03:51,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 506 flow. Second operand 6 states. [2020-10-16 05:03:51,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:51,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 168 [2020-10-16 05:03:51,904 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:52,159 INFO L129 PetriNetUnfolder]: 310/677 cut-off events. [2020-10-16 05:03:52,160 INFO L130 PetriNetUnfolder]: For 4902/4952 co-relation queries the response was YES. [2020-10-16 05:03:52,164 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3458 conditions, 677 events. 310/677 cut-off events. For 4902/4952 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4141 event pairs, 76 based on Foata normal form. 25/685 useless extension candidates. Maximal degree in co-relation 3421. Up to 413 conditions per place. [2020-10-16 05:03:52,168 INFO L132 encePairwiseOnDemand]: 160/168 looper letters, 18 selfloop transitions, 16 changer transitions 7/66 dead transitions. [2020-10-16 05:03:52,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 698 flow [2020-10-16 05:03:52,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:03:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:03:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 764 transitions. [2020-10-16 05:03:52,172 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7579365079365079 [2020-10-16 05:03:52,172 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 764 transitions. [2020-10-16 05:03:52,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 764 transitions. [2020-10-16 05:03:52,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:52,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 764 transitions. [2020-10-16 05:03:52,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:03:52,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:03:52,178 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:03:52,178 INFO L185 Difference]: Start difference. First operand has 69 places, 56 transitions, 506 flow. Second operand 6 states and 764 transitions. [2020-10-16 05:03:52,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 698 flow [2020-10-16 05:03:52,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 663 flow, removed 12 selfloop flow, removed 3 redundant places. [2020-10-16 05:03:52,190 INFO L241 Difference]: Finished difference. Result has 71 places, 56 transitions, 526 flow [2020-10-16 05:03:52,191 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=526, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2020-10-16 05:03:52,191 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 37 predicate places. [2020-10-16 05:03:52,191 INFO L481 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 526 flow [2020-10-16 05:03:52,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:03:52,191 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:52,191 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:52,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 05:03:52,192 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:03:52,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:52,192 INFO L82 PathProgramCache]: Analyzing trace with hash 581418221, now seen corresponding path program 1 times [2020-10-16 05:03:52,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:52,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943029226] [2020-10-16 05:03:52,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:52,450 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:03:52,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943029226] [2020-10-16 05:03:52,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:52,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:03:52,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23405453] [2020-10-16 05:03:52,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:03:52,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:52,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:03:52,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:03:52,454 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 168 [2020-10-16 05:03:52,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 526 flow. Second operand 7 states. [2020-10-16 05:03:52,455 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:52,455 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 168 [2020-10-16 05:03:52,455 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:52,843 INFO L129 PetriNetUnfolder]: 281/651 cut-off events. [2020-10-16 05:03:52,843 INFO L130 PetriNetUnfolder]: For 4884/4934 co-relation queries the response was YES. [2020-10-16 05:03:52,847 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3275 conditions, 651 events. 281/651 cut-off events. For 4884/4934 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4169 event pairs, 40 based on Foata normal form. 40/675 useless extension candidates. Maximal degree in co-relation 3236. Up to 260 conditions per place. [2020-10-16 05:03:52,851 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 23 selfloop transitions, 18 changer transitions 9/75 dead transitions. [2020-10-16 05:03:52,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 75 transitions, 814 flow [2020-10-16 05:03:52,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:03:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:03:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 830 transitions. [2020-10-16 05:03:52,855 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.70578231292517 [2020-10-16 05:03:52,855 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 830 transitions. [2020-10-16 05:03:52,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 830 transitions. [2020-10-16 05:03:52,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:52,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 830 transitions. [2020-10-16 05:03:52,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:03:52,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:03:52,860 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:03:52,861 INFO L185 Difference]: Start difference. First operand has 71 places, 56 transitions, 526 flow. Second operand 7 states and 830 transitions. [2020-10-16 05:03:52,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 75 transitions, 814 flow [2020-10-16 05:03:52,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 75 transitions, 768 flow, removed 7 selfloop flow, removed 6 redundant places. [2020-10-16 05:03:52,872 INFO L241 Difference]: Finished difference. Result has 72 places, 58 transitions, 564 flow [2020-10-16 05:03:52,872 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=564, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2020-10-16 05:03:52,873 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 38 predicate places. [2020-10-16 05:03:52,873 INFO L481 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 564 flow [2020-10-16 05:03:52,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:03:52,873 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:52,873 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:52,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 05:03:52,873 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:03:52,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:52,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1076908951, now seen corresponding path program 1 times [2020-10-16 05:03:52,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:52,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538893770] [2020-10-16 05:03:52,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:52,927 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:03:52,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538893770] [2020-10-16 05:03:52,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:52,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:03:52,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491971622] [2020-10-16 05:03:52,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:03:52,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:52,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:03:52,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:03:52,930 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168 [2020-10-16 05:03:52,931 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 564 flow. Second operand 4 states. [2020-10-16 05:03:52,931 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:52,931 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168 [2020-10-16 05:03:52,931 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:53,135 INFO L129 PetriNetUnfolder]: 418/955 cut-off events. [2020-10-16 05:03:53,136 INFO L130 PetriNetUnfolder]: For 5686/5998 co-relation queries the response was YES. [2020-10-16 05:03:53,143 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3638 conditions, 955 events. 418/955 cut-off events. For 5686/5998 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 6785 event pairs, 175 based on Foata normal form. 194/1090 useless extension candidates. Maximal degree in co-relation 3599. Up to 458 conditions per place. [2020-10-16 05:03:53,147 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 9 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2020-10-16 05:03:53,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 68 transitions, 618 flow [2020-10-16 05:03:53,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:03:53,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:03:53,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2020-10-16 05:03:53,150 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8071428571428572 [2020-10-16 05:03:53,150 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2020-10-16 05:03:53,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2020-10-16 05:03:53,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:53,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2020-10-16 05:03:53,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:03:53,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:03:53,154 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:03:53,154 INFO L185 Difference]: Start difference. First operand has 72 places, 58 transitions, 564 flow. Second operand 5 states and 678 transitions. [2020-10-16 05:03:53,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 68 transitions, 618 flow [2020-10-16 05:03:53,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 593 flow, removed 5 selfloop flow, removed 3 redundant places. [2020-10-16 05:03:53,165 INFO L241 Difference]: Finished difference. Result has 74 places, 65 transitions, 603 flow [2020-10-16 05:03:53,166 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=603, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2020-10-16 05:03:53,166 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2020-10-16 05:03:53,166 INFO L481 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 603 flow [2020-10-16 05:03:53,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:03:53,166 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:53,166 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:03:53,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 05:03:53,167 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:03:53,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:53,167 INFO L82 PathProgramCache]: Analyzing trace with hash -548499960, now seen corresponding path program 1 times [2020-10-16 05:03:53,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:53,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635097355] [2020-10-16 05:03:53,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:53,227 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:03:53,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635097355] [2020-10-16 05:03:53,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:53,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:03:53,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383870193] [2020-10-16 05:03:53,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:03:53,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:53,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:03:53,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:03:53,230 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168 [2020-10-16 05:03:53,230 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 603 flow. Second operand 5 states. [2020-10-16 05:03:53,230 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:53,230 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168 [2020-10-16 05:03:53,230 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:53,389 INFO L129 PetriNetUnfolder]: 233/670 cut-off events. [2020-10-16 05:03:53,389 INFO L130 PetriNetUnfolder]: For 3436/4540 co-relation queries the response was YES. [2020-10-16 05:03:53,395 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3015 conditions, 670 events. 233/670 cut-off events. For 3436/4540 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5027 event pairs, 34 based on Foata normal form. 482/1116 useless extension candidates. Maximal degree in co-relation 2974. Up to 362 conditions per place. [2020-10-16 05:03:53,398 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 5 selfloop transitions, 15 changer transitions 3/74 dead transitions. [2020-10-16 05:03:53,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 697 flow [2020-10-16 05:03:53,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:03:53,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:03:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 949 transitions. [2020-10-16 05:03:53,401 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8069727891156463 [2020-10-16 05:03:53,402 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 949 transitions. [2020-10-16 05:03:53,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 949 transitions. [2020-10-16 05:03:53,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:53,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 949 transitions. [2020-10-16 05:03:53,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:03:53,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:03:53,407 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:03:53,407 INFO L185 Difference]: Start difference. First operand has 74 places, 65 transitions, 603 flow. Second operand 7 states and 949 transitions. [2020-10-16 05:03:53,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 697 flow [2020-10-16 05:03:53,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 74 transitions, 686 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 05:03:53,418 INFO L241 Difference]: Finished difference. Result has 81 places, 71 transitions, 681 flow [2020-10-16 05:03:53,419 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=681, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2020-10-16 05:03:53,419 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 47 predicate places. [2020-10-16 05:03:53,419 INFO L481 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 681 flow [2020-10-16 05:03:53,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:03:53,419 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:53,419 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:53,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 05:03:53,420 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:03:53,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2027002674, now seen corresponding path program 1 times [2020-10-16 05:03:53,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:53,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220693355] [2020-10-16 05:03:53,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:53,492 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:03:53,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220693355] [2020-10-16 05:03:53,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:53,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:03:53,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166131842] [2020-10-16 05:03:53,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:03:53,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:53,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:03:53,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:03:53,497 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 168 [2020-10-16 05:03:53,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 681 flow. Second operand 6 states. [2020-10-16 05:03:53,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:53,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 168 [2020-10-16 05:03:53,498 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:53,666 INFO L129 PetriNetUnfolder]: 181/562 cut-off events. [2020-10-16 05:03:53,667 INFO L130 PetriNetUnfolder]: For 3981/5392 co-relation queries the response was YES. [2020-10-16 05:03:53,672 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 562 events. 181/562 cut-off events. For 3981/5392 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 4277 event pairs, 10 based on Foata normal form. 474/1004 useless extension candidates. Maximal degree in co-relation 2923. Up to 325 conditions per place. [2020-10-16 05:03:53,674 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 2 selfloop transitions, 19 changer transitions 28/75 dead transitions. [2020-10-16 05:03:53,674 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 75 transitions, 759 flow [2020-10-16 05:03:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:03:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:03:53,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1214 transitions. [2020-10-16 05:03:53,678 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8029100529100529 [2020-10-16 05:03:53,678 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1214 transitions. [2020-10-16 05:03:53,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1214 transitions. [2020-10-16 05:03:53,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:53,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1214 transitions. [2020-10-16 05:03:53,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:03:53,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:03:53,684 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:03:53,684 INFO L185 Difference]: Start difference. First operand has 81 places, 71 transitions, 681 flow. Second operand 9 states and 1214 transitions. [2020-10-16 05:03:53,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 75 transitions, 759 flow [2020-10-16 05:03:53,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 75 transitions, 659 flow, removed 33 selfloop flow, removed 7 redundant places. [2020-10-16 05:03:53,700 INFO L241 Difference]: Finished difference. Result has 85 places, 47 transitions, 395 flow [2020-10-16 05:03:53,700 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=395, PETRI_PLACES=85, PETRI_TRANSITIONS=47} [2020-10-16 05:03:53,700 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2020-10-16 05:03:53,700 INFO L481 AbstractCegarLoop]: Abstraction has has 85 places, 47 transitions, 395 flow [2020-10-16 05:03:53,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:03:53,700 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:53,701 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:53,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 05:03:53,701 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:03:53,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:53,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1300703646, now seen corresponding path program 1 times [2020-10-16 05:03:53,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:53,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125950172] [2020-10-16 05:03:53,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:03:54,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125950172] [2020-10-16 05:03:54,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:54,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:03:54,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495022638] [2020-10-16 05:03:54,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:03:54,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:54,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:03:54,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:03:54,141 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 168 [2020-10-16 05:03:54,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 47 transitions, 395 flow. Second operand 9 states. [2020-10-16 05:03:54,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:54,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 168 [2020-10-16 05:03:54,142 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:54,358 INFO L129 PetriNetUnfolder]: 66/237 cut-off events. [2020-10-16 05:03:54,359 INFO L130 PetriNetUnfolder]: For 1248/1322 co-relation queries the response was YES. [2020-10-16 05:03:54,362 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 237 events. 66/237 cut-off events. For 1248/1322 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1458 event pairs, 2 based on Foata normal form. 22/249 useless extension candidates. Maximal degree in co-relation 1072. Up to 80 conditions per place. [2020-10-16 05:03:54,363 INFO L132 encePairwiseOnDemand]: 160/168 looper letters, 15 selfloop transitions, 7 changer transitions 9/60 dead transitions. [2020-10-16 05:03:54,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 60 transitions, 581 flow [2020-10-16 05:03:54,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:03:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:03:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 801 transitions. [2020-10-16 05:03:54,370 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6811224489795918 [2020-10-16 05:03:54,370 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 801 transitions. [2020-10-16 05:03:54,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 801 transitions. [2020-10-16 05:03:54,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:54,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 801 transitions. [2020-10-16 05:03:54,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:03:54,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:03:54,374 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:03:54,374 INFO L185 Difference]: Start difference. First operand has 85 places, 47 transitions, 395 flow. Second operand 7 states and 801 transitions. [2020-10-16 05:03:54,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 60 transitions, 581 flow [2020-10-16 05:03:54,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 426 flow, removed 45 selfloop flow, removed 24 redundant places. [2020-10-16 05:03:54,381 INFO L241 Difference]: Finished difference. Result has 67 places, 46 transitions, 304 flow [2020-10-16 05:03:54,381 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2020-10-16 05:03:54,382 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2020-10-16 05:03:54,382 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 304 flow [2020-10-16 05:03:54,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:03:54,382 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:54,382 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:54,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 05:03:54,382 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:03:54,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:54,383 INFO L82 PathProgramCache]: Analyzing trace with hash 322869444, now seen corresponding path program 2 times [2020-10-16 05:03:54,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:54,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188281010] [2020-10-16 05:03:54,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:03:54,452 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:03:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:03:54,527 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:03:54,591 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:03:54,592 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:03:54,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 05:03:54,624 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:03:54,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,628 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:03:54,628 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,629 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:03:54,629 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,630 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:03:54,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,630 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:03:54,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,631 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:03:54,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,632 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:03:54,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,632 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:03:54,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,633 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:03:54,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,633 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:03:54,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,634 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:03:54,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,635 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:03:54,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,635 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:03:54,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,636 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:03:54,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,636 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:03:54,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,636 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:03:54,637 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,637 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:03:54,637 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,637 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:03:54,638 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,638 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:03:54,638 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,644 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:03:54,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,645 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:03:54,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,646 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:03:54,646 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,646 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:03:54,646 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,647 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:03:54,647 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,647 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:03:54,647 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,647 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:03:54,648 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,648 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:03:54,648 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,648 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:03:54,648 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,649 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:03:54,649 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,649 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:03:54,649 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,650 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:03:54,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,650 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:03:54,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,651 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:03:54,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,652 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:03:54,652 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,652 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:03:54,652 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,653 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:03:54,653 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:54,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:03:54 BasicIcfg [2020-10-16 05:03:54,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:03:54,753 INFO L168 Benchmark]: Toolchain (without parser) took 16304.68 ms. Allocated memory was 249.0 MB in the beginning and 638.6 MB in the end (delta: 389.5 MB). Free memory was 204.2 MB in the beginning and 197.6 MB in the end (delta: 6.6 MB). Peak memory consumption was 396.1 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:54,753 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:03:54,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.12 ms. Allocated memory was 249.0 MB in the beginning and 305.1 MB in the end (delta: 56.1 MB). Free memory was 204.2 MB in the beginning and 255.9 MB in the end (delta: -51.7 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:54,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.04 ms. Allocated memory is still 305.1 MB. Free memory was 255.9 MB in the beginning and 250.8 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:03:54,755 INFO L168 Benchmark]: Boogie Preprocessor took 67.07 ms. Allocated memory is still 305.1 MB. Free memory was 250.8 MB in the beginning and 248.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:54,756 INFO L168 Benchmark]: RCFGBuilder took 2301.93 ms. Allocated memory was 305.1 MB in the beginning and 352.8 MB in the end (delta: 47.7 MB). Free memory was 248.3 MB in the beginning and 173.0 MB in the end (delta: 75.3 MB). Peak memory consumption was 123.0 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:54,757 INFO L168 Benchmark]: TraceAbstraction took 13097.38 ms. Allocated memory was 352.8 MB in the beginning and 638.6 MB in the end (delta: 285.7 MB). Free memory was 173.0 MB in the beginning and 197.6 MB in the end (delta: -24.6 MB). Peak memory consumption was 261.2 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:54,761 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.26 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 763.12 ms. Allocated memory was 249.0 MB in the beginning and 305.1 MB in the end (delta: 56.1 MB). Free memory was 204.2 MB in the beginning and 255.9 MB in the end (delta: -51.7 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 69.04 ms. Allocated memory is still 305.1 MB. Free memory was 255.9 MB in the beginning and 250.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 67.07 ms. Allocated memory is still 305.1 MB. Free memory was 250.8 MB in the beginning and 248.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2301.93 ms. Allocated memory was 305.1 MB in the beginning and 352.8 MB in the end (delta: 47.7 MB). Free memory was 248.3 MB in the beginning and 173.0 MB in the end (delta: 75.3 MB). Peak memory consumption was 123.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 13097.38 ms. Allocated memory was 352.8 MB in the beginning and 638.6 MB in the end (delta: 285.7 MB). Free memory was 173.0 MB in the beginning and 197.6 MB in the end (delta: -24.6 MB). Peak memory consumption was 261.2 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1049 VarBasedMoverChecksPositive, 56 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 109 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.6s, 97 PlacesBefore, 34 PlacesAfterwards, 89 TransitionsBefore, 25 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 4695 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; [L708] 0 int z = 0; [L709] 0 _Bool z$flush_delayed; [L710] 0 int z$mem_tmp; [L711] 0 _Bool z$r_buff0_thd0; [L712] 0 _Bool z$r_buff0_thd1; [L713] 0 _Bool z$r_buff0_thd2; [L714] 0 _Bool z$r_buff0_thd3; [L715] 0 _Bool z$r_buff1_thd0; [L716] 0 _Bool z$r_buff1_thd1; [L717] 0 _Bool z$r_buff1_thd2; [L718] 0 _Bool z$r_buff1_thd3; [L719] 0 _Bool z$read_delayed; [L720] 0 int *z$read_delayed_var; [L721] 0 int z$w_buff0; [L722] 0 _Bool z$w_buff0_used; [L723] 0 int z$w_buff1; [L724] 0 _Bool z$w_buff1_used; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2025; [L808] FCALL, FORK 0 pthread_create(&t2025, ((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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 0 pthread_t t2026; [L810] FCALL, FORK 0 pthread_create(&t2026, ((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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 0 pthread_t t2027; [L812] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 2 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L735] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L736] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L737] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L738] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L739] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L747] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L748] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L754] 1 return 0; [L765] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L765] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L768] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L769] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L789] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L818] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L818] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L819] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L822] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 z$flush_delayed = weak$$choice2 [L828] 0 z$mem_tmp = z [L829] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L829] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L830] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L830] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L831] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1 [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L831] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L832] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L833] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L834] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L834] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L834] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L835] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L837] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L837] 0 z = z$flush_delayed ? z$mem_tmp : z [L838] 0 z$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=1, 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=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 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: 12.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 107 SDtfs, 114 SDslu, 109 SDs, 0 SdLazy, 637 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=681occurred 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.7s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 34796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...