/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:14:39,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:14:39,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:14:39,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:14:39,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:14:39,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:14:39,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:14:39,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:14:39,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:14:39,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:14:39,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:14:39,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:14:39,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:14:39,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:14:39,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:14:39,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:14:39,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:14:39,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:14:39,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:14:39,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:14:39,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:14:39,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:14:39,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:14:39,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:14:39,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:14:39,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:14:39,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:14:39,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:14:39,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:14:39,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:14:39,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:14:39,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:14:39,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:14:39,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:14:39,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:14:39,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:14:39,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:14:39,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:14:39,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:14:39,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:14:39,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:14:39,714 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-11 20:14:39,740 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:14:39,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:14:39,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:14:39,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:14:39,743 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:14:39,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:14:39,744 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:14:39,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:14:39,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:14:39,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:14:39,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:14:39,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:14:39,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:14:39,745 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:14:39,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:14:39,745 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:14:39,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:14:39,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:14:39,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:14:39,746 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:14:39,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:14:39,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:14:39,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:14:39,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:14:39,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:14:39,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:14:39,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:14:39,747 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:14:39,747 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 20:14:39,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:14:40,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:14:40,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:14:40,005 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:14:40,005 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:14:40,006 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2021-03-11 20:14:40,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/704275e42/417d9e970fd34fe7848d81e949adb5ab/FLAG549ba4142 [2021-03-11 20:14:40,460 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:14:40,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2021-03-11 20:14:40,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/704275e42/417d9e970fd34fe7848d81e949adb5ab/FLAG549ba4142 [2021-03-11 20:14:40,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/704275e42/417d9e970fd34fe7848d81e949adb5ab [2021-03-11 20:14:40,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:14:40,490 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:14:40,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:14:40,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:14:40,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:14:40,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:14:40" (1/1) ... [2021-03-11 20:14:40,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fb68e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:40, skipping insertion in model container [2021-03-11 20:14:40,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:14:40" (1/1) ... [2021-03-11 20:14:40,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:14:40,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:14:40,691 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i[949,962] [2021-03-11 20:14:40,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:14:40,854 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:14:40,863 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i[949,962] [2021-03-11 20:14:40,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:14:40,942 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:14:40,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:40 WrapperNode [2021-03-11 20:14:40,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:14:40,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:14:40,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:14:40,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:14:40,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:40" (1/1) ... [2021-03-11 20:14:40,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:40" (1/1) ... [2021-03-11 20:14:40,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:14:40,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:14:40,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:14:40,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:14:40,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:40" (1/1) ... [2021-03-11 20:14:40,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:40" (1/1) ... [2021-03-11 20:14:40,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:40" (1/1) ... [2021-03-11 20:14:40,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:40" (1/1) ... [2021-03-11 20:14:40,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:40" (1/1) ... [2021-03-11 20:14:40,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:40" (1/1) ... [2021-03-11 20:14:40,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:40" (1/1) ... [2021-03-11 20:14:40,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:14:40,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:14:40,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:14:40,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:14:40,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:14:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:14:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:14:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:14:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:14:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:14:41,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:14:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:14:41,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:14:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:14:41,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:14:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:14:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:14:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:14:41,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:14:41,047 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:14:42,109 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:14:42,110 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:14:42,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:14:42 BoogieIcfgContainer [2021-03-11 20:14:42,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:14:42,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:14:42,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:14:42,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:14:42,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:14:40" (1/3) ... [2021-03-11 20:14:42,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1115393f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:14:42, skipping insertion in model container [2021-03-11 20:14:42,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:14:40" (2/3) ... [2021-03-11 20:14:42,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1115393f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:14:42, skipping insertion in model container [2021-03-11 20:14:42,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:14:42" (3/3) ... [2021-03-11 20:14:42,115 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_tso.oepc.i [2021-03-11 20:14:42,119 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:14:42,121 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:14:42,121 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:14:42,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,140 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,140 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,141 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,141 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,141 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,142 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,142 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,142 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,145 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,145 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,145 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,148 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,148 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,149 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,149 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,151 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,151 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,151 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:14:42,152 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:14:42,163 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 20:14:42,174 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:14:42,174 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:14:42,174 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:14:42,174 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:14:42,174 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:14:42,174 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:14:42,174 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:14:42,174 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:14:42,185 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2021-03-11 20:14:42,231 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-11 20:14:42,231 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:14:42,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-11 20:14:42,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2021-03-11 20:14:42,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2021-03-11 20:14:42,238 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:14:42,260 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-11 20:14:42,263 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-11 20:14:42,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 195 flow [2021-03-11 20:14:42,284 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-11 20:14:42,285 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:14:42,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-11 20:14:42,288 INFO L116 LiptonReduction]: Number of co-enabled transitions 1578 [2021-03-11 20:14:44,849 WARN L205 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-03-11 20:14:45,118 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-11 20:14:46,296 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-11 20:14:46,801 WARN L205 SmtUtils]: Spent 503.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-11 20:14:47,957 WARN L205 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 189 [2021-03-11 20:14:48,478 WARN L205 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 186 [2021-03-11 20:14:49,764 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 313 DAG size of output: 269 [2021-03-11 20:14:50,331 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-11 20:14:51,006 WARN L205 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2021-03-11 20:14:51,380 WARN L205 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2021-03-11 20:14:52,959 WARN L205 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 280 DAG size of output: 279 [2021-03-11 20:14:53,731 WARN L205 SmtUtils]: Spent 770.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-03-11 20:14:53,989 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2021-03-11 20:14:54,249 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2021-03-11 20:14:54,780 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-11 20:14:54,903 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-11 20:14:55,150 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-11 20:14:55,272 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-11 20:14:55,275 INFO L131 LiptonReduction]: Checked pairs total: 4105 [2021-03-11 20:14:55,275 INFO L133 LiptonReduction]: Total number of compositions: 83 [2021-03-11 20:14:55,276 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13040 [2021-03-11 20:14:55,282 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-11 20:14:55,282 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:14:55,282 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:55,283 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:55,283 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:55,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:55,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1712401248, now seen corresponding path program 1 times [2021-03-11 20:14:55,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:55,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427464000] [2021-03-11 20:14:55,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:55,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:55,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:55,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427464000] [2021-03-11 20:14:55,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:55,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:14:55,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476320175] [2021-03-11 20:14:55,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:14:55,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:55,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:14:55,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:14:55,469 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 179 [2021-03-11 20:14:55,471 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:55,471 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:55,471 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 179 [2021-03-11 20:14:55,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:55,533 INFO L129 PetriNetUnfolder]: 23/76 cut-off events. [2021-03-11 20:14:55,534 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:14:55,535 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 76 events. 23/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 273 event pairs, 3 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 124. Up to 37 conditions per place. [2021-03-11 20:14:55,536 INFO L132 encePairwiseOnDemand]: 176/179 looper letters, 7 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2021-03-11 20:14:55,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 25 transitions, 81 flow [2021-03-11 20:14:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:14:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:14:55,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2021-03-11 20:14:55,549 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8547486033519553 [2021-03-11 20:14:55,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2021-03-11 20:14:55,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2021-03-11 20:14:55,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:55,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2021-03-11 20:14:55,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:55,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:55,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:55,563 INFO L185 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 459 transitions. [2021-03-11 20:14:55,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 25 transitions, 81 flow [2021-03-11 20:14:55,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 25 transitions, 78 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 20:14:55,566 INFO L241 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2021-03-11 20:14:55,567 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2021-03-11 20:14:55,568 INFO L335 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2021-03-11 20:14:55,568 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2021-03-11 20:14:55,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:55,568 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:55,568 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:55,568 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:14:55,568 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:55,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:55,569 INFO L82 PathProgramCache]: Analyzing trace with hash -645057063, now seen corresponding path program 1 times [2021-03-11 20:14:55,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:55,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751190664] [2021-03-11 20:14:55,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:55,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:55,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:55,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751190664] [2021-03-11 20:14:55,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:55,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:14:55,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316962562] [2021-03-11 20:14:55,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:14:55,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:55,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:14:55,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:14:55,696 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 179 [2021-03-11 20:14:55,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:55,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:55,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 179 [2021-03-11 20:14:55,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:55,707 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-11 20:14:55,707 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:14:55,708 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 32 events. 3/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 1 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 44. Up to 10 conditions per place. [2021-03-11 20:14:55,709 INFO L132 encePairwiseOnDemand]: 175/179 looper letters, 3 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2021-03-11 20:14:55,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 22 transitions, 66 flow [2021-03-11 20:14:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:14:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:14:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-11 20:14:55,710 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8566108007448789 [2021-03-11 20:14:55,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-11 20:14:55,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-11 20:14:55,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:55,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-11 20:14:55,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:55,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:55,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:55,720 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 460 transitions. [2021-03-11 20:14:55,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 22 transitions, 66 flow [2021-03-11 20:14:55,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 22 transitions, 62 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:14:55,721 INFO L241 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2021-03-11 20:14:55,721 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2021-03-11 20:14:55,722 INFO L335 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2021-03-11 20:14:55,722 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2021-03-11 20:14:55,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:55,722 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:55,722 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:55,722 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:14:55,722 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:55,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:55,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1478067224, now seen corresponding path program 1 times [2021-03-11 20:14:55,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:55,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497942114] [2021-03-11 20:14:55,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:55,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:55,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:14:55,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:55,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:14:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:55,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497942114] [2021-03-11 20:14:55,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:55,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:14:55,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936706933] [2021-03-11 20:14:55,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:14:55,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:55,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:14:55,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:14:55,826 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 179 [2021-03-11 20:14:55,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:55,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:55,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 179 [2021-03-11 20:14:55,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:55,886 INFO L129 PetriNetUnfolder]: 61/142 cut-off events. [2021-03-11 20:14:55,886 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-03-11 20:14:55,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 142 events. 61/142 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 596 event pairs, 37 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 275. Up to 97 conditions per place. [2021-03-11 20:14:55,889 INFO L132 encePairwiseOnDemand]: 175/179 looper letters, 7 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2021-03-11 20:14:55,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 91 flow [2021-03-11 20:14:55,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:14:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:14:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2021-03-11 20:14:55,891 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8026070763500931 [2021-03-11 20:14:55,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2021-03-11 20:14:55,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2021-03-11 20:14:55,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:55,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2021-03-11 20:14:55,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:55,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:55,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:55,893 INFO L185 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 3 states and 431 transitions. [2021-03-11 20:14:55,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 91 flow [2021-03-11 20:14:55,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 88 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:14:55,894 INFO L241 Difference]: Finished difference. Result has 32 places, 24 transitions, 81 flow [2021-03-11 20:14:55,894 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2021-03-11 20:14:55,894 INFO L335 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2021-03-11 20:14:55,894 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 81 flow [2021-03-11 20:14:55,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:55,894 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:55,895 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:55,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:14:55,895 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:55,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:55,895 INFO L82 PathProgramCache]: Analyzing trace with hash 370294510, now seen corresponding path program 1 times [2021-03-11 20:14:55,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:55,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860101565] [2021-03-11 20:14:55,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:55,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:55,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:14:55,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:55,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:14:56,001 INFO L142 QuantifierPusher]: treesize reduction 37, result has 48.6 percent of original size [2021-03-11 20:14:56,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-11 20:14:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:56,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860101565] [2021-03-11 20:14:56,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:56,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:14:56,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379303776] [2021-03-11 20:14:56,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:14:56,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:56,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:14:56,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:14:56,024 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 179 [2021-03-11 20:14:56,025 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:56,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 179 [2021-03-11 20:14:56,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:56,105 INFO L129 PetriNetUnfolder]: 55/136 cut-off events. [2021-03-11 20:14:56,105 INFO L130 PetriNetUnfolder]: For 55/57 co-relation queries the response was YES. [2021-03-11 20:14:56,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 136 events. 55/136 cut-off events. For 55/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 582 event pairs, 10 based on Foata normal form. 8/134 useless extension candidates. Maximal degree in co-relation 303. Up to 77 conditions per place. [2021-03-11 20:14:56,107 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 7 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2021-03-11 20:14:56,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 121 flow [2021-03-11 20:14:56,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:14:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:14:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions. [2021-03-11 20:14:56,108 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.797486033519553 [2021-03-11 20:14:56,108 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 571 transitions. [2021-03-11 20:14:56,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions. [2021-03-11 20:14:56,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:56,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions. [2021-03-11 20:14:56,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,111 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,111 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 81 flow. Second operand 4 states and 571 transitions. [2021-03-11 20:14:56,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 121 flow [2021-03-11 20:14:56,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:14:56,113 INFO L241 Difference]: Finished difference. Result has 36 places, 27 transitions, 118 flow [2021-03-11 20:14:56,113 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2021-03-11 20:14:56,113 INFO L335 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2021-03-11 20:14:56,113 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 118 flow [2021-03-11 20:14:56,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,114 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:56,114 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:56,114 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:14:56,114 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:56,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:56,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1424558537, now seen corresponding path program 1 times [2021-03-11 20:14:56,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:56,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987727934] [2021-03-11 20:14:56,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:56,196 INFO L142 QuantifierPusher]: treesize reduction 30, result has 34.8 percent of original size [2021-03-11 20:14:56,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:14:56,205 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-03-11 20:14:56,206 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-03-11 20:14:56,226 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-03-11 20:14:56,228 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-03-11 20:14:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:56,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987727934] [2021-03-11 20:14:56,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:56,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:14:56,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252264204] [2021-03-11 20:14:56,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:14:56,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:56,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:14:56,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:14:56,252 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 179 [2021-03-11 20:14:56,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:56,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 179 [2021-03-11 20:14:56,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:56,299 INFO L129 PetriNetUnfolder]: 49/116 cut-off events. [2021-03-11 20:14:56,300 INFO L130 PetriNetUnfolder]: For 100/110 co-relation queries the response was YES. [2021-03-11 20:14:56,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 116 events. 49/116 cut-off events. For 100/110 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 435 event pairs, 11 based on Foata normal form. 6/115 useless extension candidates. Maximal degree in co-relation 353. Up to 81 conditions per place. [2021-03-11 20:14:56,301 INFO L132 encePairwiseOnDemand]: 174/179 looper letters, 11 selfloop transitions, 5 changer transitions 0/31 dead transitions. [2021-03-11 20:14:56,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 164 flow [2021-03-11 20:14:56,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:14:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:14:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2021-03-11 20:14:56,303 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7793296089385475 [2021-03-11 20:14:56,303 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 558 transitions. [2021-03-11 20:14:56,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 558 transitions. [2021-03-11 20:14:56,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:56,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 558 transitions. [2021-03-11 20:14:56,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,306 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,306 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 118 flow. Second operand 4 states and 558 transitions. [2021-03-11 20:14:56,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 164 flow [2021-03-11 20:14:56,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 158 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-11 20:14:56,308 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 137 flow [2021-03-11 20:14:56,308 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-11 20:14:56,308 INFO L335 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2021-03-11 20:14:56,309 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 137 flow [2021-03-11 20:14:56,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,309 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:56,309 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:56,309 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:14:56,310 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:56,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:56,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1405709203, now seen corresponding path program 1 times [2021-03-11 20:14:56,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:56,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208342589] [2021-03-11 20:14:56,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:56,373 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-11 20:14:56,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:14:56,380 INFO L142 QuantifierPusher]: treesize reduction 30, result has 34.8 percent of original size [2021-03-11 20:14:56,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:14:56,390 INFO L142 QuantifierPusher]: treesize reduction 40, result has 57.4 percent of original size [2021-03-11 20:14:56,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-11 20:14:56,414 INFO L142 QuantifierPusher]: treesize reduction 21, result has 75.3 percent of original size [2021-03-11 20:14:56,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-03-11 20:14:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:56,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208342589] [2021-03-11 20:14:56,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:56,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:14:56,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382029180] [2021-03-11 20:14:56,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:14:56,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:56,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:14:56,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:14:56,440 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 179 [2021-03-11 20:14:56,441 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,441 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:56,441 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 179 [2021-03-11 20:14:56,441 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:56,504 INFO L129 PetriNetUnfolder]: 55/139 cut-off events. [2021-03-11 20:14:56,505 INFO L130 PetriNetUnfolder]: For 213/223 co-relation queries the response was YES. [2021-03-11 20:14:56,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 139 events. 55/139 cut-off events. For 213/223 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 602 event pairs, 5 based on Foata normal form. 8/139 useless extension candidates. Maximal degree in co-relation 427. Up to 74 conditions per place. [2021-03-11 20:14:56,506 INFO L132 encePairwiseOnDemand]: 172/179 looper letters, 10 selfloop transitions, 9 changer transitions 0/34 dead transitions. [2021-03-11 20:14:56,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 195 flow [2021-03-11 20:14:56,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:14:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:14:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2021-03-11 20:14:56,508 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7620111731843575 [2021-03-11 20:14:56,508 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2021-03-11 20:14:56,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2021-03-11 20:14:56,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:56,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2021-03-11 20:14:56,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,510 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,510 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 137 flow. Second operand 5 states and 682 transitions. [2021-03-11 20:14:56,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 195 flow [2021-03-11 20:14:56,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 186 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:14:56,514 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 163 flow [2021-03-11 20:14:56,514 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-03-11 20:14:56,514 INFO L335 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2021-03-11 20:14:56,514 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 163 flow [2021-03-11 20:14:56,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,515 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:56,515 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:56,515 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:14:56,515 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:56,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:56,515 INFO L82 PathProgramCache]: Analyzing trace with hash 595570501, now seen corresponding path program 2 times [2021-03-11 20:14:56,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:56,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424745227] [2021-03-11 20:14:56,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:56,571 INFO L142 QuantifierPusher]: treesize reduction 30, result has 34.8 percent of original size [2021-03-11 20:14:56,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:14:56,583 INFO L142 QuantifierPusher]: treesize reduction 30, result has 38.8 percent of original size [2021-03-11 20:14:56,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:14:56,601 INFO L142 QuantifierPusher]: treesize reduction 21, result has 77.2 percent of original size [2021-03-11 20:14:56,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 71 [2021-03-11 20:14:56,630 INFO L142 QuantifierPusher]: treesize reduction 21, result has 77.2 percent of original size [2021-03-11 20:14:56,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 71 [2021-03-11 20:14:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:56,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424745227] [2021-03-11 20:14:56,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:56,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:14:56,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588589216] [2021-03-11 20:14:56,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:14:56,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:56,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:14:56,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:14:56,663 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 179 [2021-03-11 20:14:56,663 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 136.83333333333334) internal successors, (821), 6 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:56,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 179 [2021-03-11 20:14:56,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:56,744 INFO L129 PetriNetUnfolder]: 52/142 cut-off events. [2021-03-11 20:14:56,745 INFO L130 PetriNetUnfolder]: For 288/298 co-relation queries the response was YES. [2021-03-11 20:14:56,745 INFO L84 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 142 events. 52/142 cut-off events. For 288/298 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 655 event pairs, 3 based on Foata normal form. 10/144 useless extension candidates. Maximal degree in co-relation 480. Up to 57 conditions per place. [2021-03-11 20:14:56,746 INFO L132 encePairwiseOnDemand]: 172/179 looper letters, 9 selfloop transitions, 12 changer transitions 0/36 dead transitions. [2021-03-11 20:14:56,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 231 flow [2021-03-11 20:14:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:14:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:14:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2021-03-11 20:14:56,748 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7798882681564245 [2021-03-11 20:14:56,748 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2021-03-11 20:14:56,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2021-03-11 20:14:56,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:56,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2021-03-11 20:14:56,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,750 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,750 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 163 flow. Second operand 5 states and 698 transitions. [2021-03-11 20:14:56,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 231 flow [2021-03-11 20:14:56,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 214 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-11 20:14:56,752 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 196 flow [2021-03-11 20:14:56,752 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2021-03-11 20:14:56,752 INFO L335 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2021-03-11 20:14:56,752 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 196 flow [2021-03-11 20:14:56,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 136.83333333333334) internal successors, (821), 6 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,753 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:56,753 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:56,753 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:14:56,753 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:56,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:56,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1320470464, now seen corresponding path program 1 times [2021-03-11 20:14:56,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:56,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098461271] [2021-03-11 20:14:56,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:56,793 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-11 20:14:56,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:14:56,801 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-03-11 20:14:56,801 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-03-11 20:14:56,820 INFO L142 QuantifierPusher]: treesize reduction 17, result has 73.0 percent of original size [2021-03-11 20:14:56,821 INFO L147 QuantifierPusher]: treesize reduction 9, result has 80.4 percent of original size 37 [2021-03-11 20:14:56,848 INFO L142 QuantifierPusher]: treesize reduction 17, result has 73.0 percent of original size [2021-03-11 20:14:56,849 INFO L147 QuantifierPusher]: treesize reduction 9, result has 80.4 percent of original size 37 [2021-03-11 20:14:56,877 INFO L142 QuantifierPusher]: treesize reduction 17, result has 76.1 percent of original size [2021-03-11 20:14:56,880 INFO L147 QuantifierPusher]: treesize reduction 9, result has 83.3 percent of original size 45 [2021-03-11 20:14:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:56,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098461271] [2021-03-11 20:14:56,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:56,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:14:56,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818192414] [2021-03-11 20:14:56,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:14:56,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:56,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:14:56,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:14:56,913 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 179 [2021-03-11 20:14:56,914 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 134.85714285714286) internal successors, (944), 7 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:56,914 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:56,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 179 [2021-03-11 20:14:56,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:57,044 INFO L129 PetriNetUnfolder]: 56/156 cut-off events. [2021-03-11 20:14:57,044 INFO L130 PetriNetUnfolder]: For 365/375 co-relation queries the response was YES. [2021-03-11 20:14:57,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 156 events. 56/156 cut-off events. For 365/375 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 782 event pairs, 3 based on Foata normal form. 8/156 useless extension candidates. Maximal degree in co-relation 591. Up to 61 conditions per place. [2021-03-11 20:14:57,045 INFO L132 encePairwiseOnDemand]: 172/179 looper letters, 9 selfloop transitions, 16 changer transitions 0/40 dead transitions. [2021-03-11 20:14:57,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 40 transitions, 290 flow [2021-03-11 20:14:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:14:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:14:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 825 transitions. [2021-03-11 20:14:57,048 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7681564245810056 [2021-03-11 20:14:57,048 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 825 transitions. [2021-03-11 20:14:57,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 825 transitions. [2021-03-11 20:14:57,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:57,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 825 transitions. [2021-03-11 20:14:57,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,051 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,051 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 196 flow. Second operand 6 states and 825 transitions. [2021-03-11 20:14:57,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 40 transitions, 290 flow [2021-03-11 20:14:57,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 262 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-03-11 20:14:57,053 INFO L241 Difference]: Finished difference. Result has 48 places, 37 transitions, 250 flow [2021-03-11 20:14:57,053 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2021-03-11 20:14:57,054 INFO L335 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2021-03-11 20:14:57,054 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 250 flow [2021-03-11 20:14:57,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 134.85714285714286) internal successors, (944), 7 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,054 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:57,054 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:57,054 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:14:57,054 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:57,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:57,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1245450752, now seen corresponding path program 2 times [2021-03-11 20:14:57,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:57,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615243262] [2021-03-11 20:14:57,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:57,109 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-11 20:14:57,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:14:57,117 INFO L142 QuantifierPusher]: treesize reduction 30, result has 34.8 percent of original size [2021-03-11 20:14:57,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 20:14:57,126 INFO L142 QuantifierPusher]: treesize reduction 30, result has 47.4 percent of original size [2021-03-11 20:14:57,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-11 20:14:57,147 INFO L142 QuantifierPusher]: treesize reduction 17, result has 75.7 percent of original size [2021-03-11 20:14:57,148 INFO L147 QuantifierPusher]: treesize reduction 9, result has 83.0 percent of original size 44 [2021-03-11 20:14:57,176 INFO L142 QuantifierPusher]: treesize reduction 17, result has 72.1 percent of original size [2021-03-11 20:14:57,176 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.5 percent of original size 35 [2021-03-11 20:14:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:57,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615243262] [2021-03-11 20:14:57,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:57,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:14:57,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305780518] [2021-03-11 20:14:57,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:14:57,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:57,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:14:57,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:14:57,201 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 179 [2021-03-11 20:14:57,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:57,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 179 [2021-03-11 20:14:57,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:57,333 INFO L129 PetriNetUnfolder]: 53/151 cut-off events. [2021-03-11 20:14:57,333 INFO L130 PetriNetUnfolder]: For 466/476 co-relation queries the response was YES. [2021-03-11 20:14:57,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 151 events. 53/151 cut-off events. For 466/476 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 725 event pairs, 3 based on Foata normal form. 8/151 useless extension candidates. Maximal degree in co-relation 616. Up to 55 conditions per place. [2021-03-11 20:14:57,334 INFO L132 encePairwiseOnDemand]: 172/179 looper letters, 12 selfloop transitions, 13 changer transitions 0/40 dead transitions. [2021-03-11 20:14:57,334 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 40 transitions, 318 flow [2021-03-11 20:14:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:14:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:14:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2021-03-11 20:14:57,336 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7508379888268156 [2021-03-11 20:14:57,336 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2021-03-11 20:14:57,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2021-03-11 20:14:57,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:57,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2021-03-11 20:14:57,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,339 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,339 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 250 flow. Second operand 5 states and 672 transitions. [2021-03-11 20:14:57,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 40 transitions, 318 flow [2021-03-11 20:14:57,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 40 transitions, 296 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-11 20:14:57,341 INFO L241 Difference]: Finished difference. Result has 50 places, 37 transitions, 265 flow [2021-03-11 20:14:57,341 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2021-03-11 20:14:57,341 INFO L335 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2021-03-11 20:14:57,341 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 265 flow [2021-03-11 20:14:57,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,341 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:57,341 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:57,341 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:14:57,342 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:57,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:57,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1092420792, now seen corresponding path program 1 times [2021-03-11 20:14:57,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:57,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891129827] [2021-03-11 20:14:57,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:57,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:57,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:57,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:57,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:14:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:57,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891129827] [2021-03-11 20:14:57,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:57,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:14:57,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523312138] [2021-03-11 20:14:57,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:14:57,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:57,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:14:57,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:14:57,382 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 179 [2021-03-11 20:14:57,382 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:57,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 179 [2021-03-11 20:14:57,382 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:57,416 INFO L129 PetriNetUnfolder]: 74/206 cut-off events. [2021-03-11 20:14:57,417 INFO L130 PetriNetUnfolder]: For 612/626 co-relation queries the response was YES. [2021-03-11 20:14:57,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 206 events. 74/206 cut-off events. For 612/626 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1059 event pairs, 23 based on Foata normal form. 4/192 useless extension candidates. Maximal degree in co-relation 707. Up to 80 conditions per place. [2021-03-11 20:14:57,418 INFO L132 encePairwiseOnDemand]: 174/179 looper letters, 4 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2021-03-11 20:14:57,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 40 transitions, 287 flow [2021-03-11 20:14:57,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:14:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:14:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2021-03-11 20:14:57,420 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8435754189944135 [2021-03-11 20:14:57,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2021-03-11 20:14:57,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2021-03-11 20:14:57,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:57,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2021-03-11 20:14:57,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,423 INFO L185 Difference]: Start difference. First operand has 50 places, 37 transitions, 265 flow. Second operand 3 states and 453 transitions. [2021-03-11 20:14:57,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 40 transitions, 287 flow [2021-03-11 20:14:57,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 257 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-11 20:14:57,425 INFO L241 Difference]: Finished difference. Result has 49 places, 40 transitions, 261 flow [2021-03-11 20:14:57,426 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2021-03-11 20:14:57,426 INFO L335 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2021-03-11 20:14:57,426 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 261 flow [2021-03-11 20:14:57,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,426 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:57,426 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:57,426 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:14:57,427 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:57,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:57,427 INFO L82 PathProgramCache]: Analyzing trace with hash -298853270, now seen corresponding path program 1 times [2021-03-11 20:14:57,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:57,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100505202] [2021-03-11 20:14:57,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:57,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:57,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:57,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:57,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:57,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:57,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:14:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:57,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100505202] [2021-03-11 20:14:57,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:57,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:14:57,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690185693] [2021-03-11 20:14:57,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:14:57,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:57,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:14:57,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:14:57,473 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 179 [2021-03-11 20:14:57,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:57,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 179 [2021-03-11 20:14:57,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:57,494 INFO L129 PetriNetUnfolder]: 29/111 cut-off events. [2021-03-11 20:14:57,494 INFO L130 PetriNetUnfolder]: For 277/318 co-relation queries the response was YES. [2021-03-11 20:14:57,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 111 events. 29/111 cut-off events. For 277/318 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 441 event pairs, 2 based on Foata normal form. 29/135 useless extension candidates. Maximal degree in co-relation 402. Up to 44 conditions per place. [2021-03-11 20:14:57,495 INFO L132 encePairwiseOnDemand]: 174/179 looper letters, 4 selfloop transitions, 7 changer transitions 0/39 dead transitions. [2021-03-11 20:14:57,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 266 flow [2021-03-11 20:14:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:14:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:14:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 604 transitions. [2021-03-11 20:14:57,497 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8435754189944135 [2021-03-11 20:14:57,497 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 604 transitions. [2021-03-11 20:14:57,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 604 transitions. [2021-03-11 20:14:57,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:57,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 604 transitions. [2021-03-11 20:14:57,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,499 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,499 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 261 flow. Second operand 4 states and 604 transitions. [2021-03-11 20:14:57,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 266 flow [2021-03-11 20:14:57,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 247 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-11 20:14:57,501 INFO L241 Difference]: Finished difference. Result has 49 places, 39 transitions, 253 flow [2021-03-11 20:14:57,501 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2021-03-11 20:14:57,501 INFO L335 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2021-03-11 20:14:57,501 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 253 flow [2021-03-11 20:14:57,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,501 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:57,501 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:57,501 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:14:57,501 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:57,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:57,502 INFO L82 PathProgramCache]: Analyzing trace with hash 864538866, now seen corresponding path program 1 times [2021-03-11 20:14:57,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:57,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277035087] [2021-03-11 20:14:57,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:57,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:57,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:14:57,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:57,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:57,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:57,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:57,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277035087] [2021-03-11 20:14:57,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:57,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:14:57,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604208148] [2021-03-11 20:14:57,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:14:57,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:57,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:14:57,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:14:57,535 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 179 [2021-03-11 20:14:57,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:57,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 179 [2021-03-11 20:14:57,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:57,561 INFO L129 PetriNetUnfolder]: 64/202 cut-off events. [2021-03-11 20:14:57,562 INFO L130 PetriNetUnfolder]: For 561/609 co-relation queries the response was YES. [2021-03-11 20:14:57,562 INFO L84 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 202 events. 64/202 cut-off events. For 561/609 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1038 event pairs, 5 based on Foata normal form. 24/216 useless extension candidates. Maximal degree in co-relation 692. Up to 96 conditions per place. [2021-03-11 20:14:57,563 INFO L132 encePairwiseOnDemand]: 176/179 looper letters, 4 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2021-03-11 20:14:57,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 283 flow [2021-03-11 20:14:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:14:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:14:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 591 transitions. [2021-03-11 20:14:57,565 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8254189944134078 [2021-03-11 20:14:57,565 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 591 transitions. [2021-03-11 20:14:57,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 591 transitions. [2021-03-11 20:14:57,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:57,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 591 transitions. [2021-03-11 20:14:57,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,567 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,567 INFO L185 Difference]: Start difference. First operand has 49 places, 39 transitions, 253 flow. Second operand 4 states and 591 transitions. [2021-03-11 20:14:57,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 283 flow [2021-03-11 20:14:57,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 41 transitions, 269 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-11 20:14:57,568 INFO L241 Difference]: Finished difference. Result has 52 places, 39 transitions, 246 flow [2021-03-11 20:14:57,569 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2021-03-11 20:14:57,569 INFO L335 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2021-03-11 20:14:57,569 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 246 flow [2021-03-11 20:14:57,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,569 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:57,569 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:57,569 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 20:14:57,569 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:57,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:57,569 INFO L82 PathProgramCache]: Analyzing trace with hash 453479056, now seen corresponding path program 2 times [2021-03-11 20:14:57,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:57,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067493150] [2021-03-11 20:14:57,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:57,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:57,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:14:57,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:57,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:57,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067493150] [2021-03-11 20:14:57,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:57,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:14:57,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242627799] [2021-03-11 20:14:57,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:14:57,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:57,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:14:57,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:14:57,598 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 179 [2021-03-11 20:14:57,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:57,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 179 [2021-03-11 20:14:57,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:57,621 INFO L129 PetriNetUnfolder]: 39/169 cut-off events. [2021-03-11 20:14:57,621 INFO L130 PetriNetUnfolder]: For 521/549 co-relation queries the response was YES. [2021-03-11 20:14:57,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 169 events. 39/169 cut-off events. For 521/549 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 894 event pairs, 4 based on Foata normal form. 24/189 useless extension candidates. Maximal degree in co-relation 502. Up to 71 conditions per place. [2021-03-11 20:14:57,622 INFO L132 encePairwiseOnDemand]: 176/179 looper letters, 3 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2021-03-11 20:14:57,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 39 transitions, 258 flow [2021-03-11 20:14:57,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:14:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:14:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2021-03-11 20:14:57,624 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8547486033519553 [2021-03-11 20:14:57,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2021-03-11 20:14:57,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2021-03-11 20:14:57,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:57,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2021-03-11 20:14:57,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,627 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,627 INFO L185 Difference]: Start difference. First operand has 52 places, 39 transitions, 246 flow. Second operand 3 states and 459 transitions. [2021-03-11 20:14:57,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 39 transitions, 258 flow [2021-03-11 20:14:57,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 39 transitions, 255 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:14:57,631 INFO L241 Difference]: Finished difference. Result has 52 places, 39 transitions, 254 flow [2021-03-11 20:14:57,631 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2021-03-11 20:14:57,631 INFO L335 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2021-03-11 20:14:57,631 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 254 flow [2021-03-11 20:14:57,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,631 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:57,631 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:14:57,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 20:14:57,632 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:57,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:57,632 INFO L82 PathProgramCache]: Analyzing trace with hash 32944903, now seen corresponding path program 1 times [2021-03-11 20:14:57,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:57,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924077077] [2021-03-11 20:14:57,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:14:57,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:57,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:57,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:57,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:57,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:57,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:14:57,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:14:57,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:14:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:14:57,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924077077] [2021-03-11 20:14:57,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:14:57,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:14:57,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732887087] [2021-03-11 20:14:57,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:14:57,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:14:57,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:14:57,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:14:57,678 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 179 [2021-03-11 20:14:57,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:14:57,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 179 [2021-03-11 20:14:57,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:14:57,705 INFO L129 PetriNetUnfolder]: 29/116 cut-off events. [2021-03-11 20:14:57,705 INFO L130 PetriNetUnfolder]: For 226/285 co-relation queries the response was YES. [2021-03-11 20:14:57,705 INFO L84 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 116 events. 29/116 cut-off events. For 226/285 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 533 event pairs, 0 based on Foata normal form. 69/182 useless extension candidates. Maximal degree in co-relation 387. Up to 45 conditions per place. [2021-03-11 20:14:57,705 INFO L132 encePairwiseOnDemand]: 174/179 looper letters, 1 selfloop transitions, 10 changer transitions 9/39 dead transitions. [2021-03-11 20:14:57,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 39 transitions, 276 flow [2021-03-11 20:14:57,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:14:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:14:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 752 transitions. [2021-03-11 20:14:57,707 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8402234636871508 [2021-03-11 20:14:57,707 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 752 transitions. [2021-03-11 20:14:57,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 752 transitions. [2021-03-11 20:14:57,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:14:57,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 752 transitions. [2021-03-11 20:14:57,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,710 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,710 INFO L185 Difference]: Start difference. First operand has 52 places, 39 transitions, 254 flow. Second operand 5 states and 752 transitions. [2021-03-11 20:14:57,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 39 transitions, 276 flow [2021-03-11 20:14:57,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 39 transitions, 240 flow, removed 10 selfloop flow, removed 3 redundant places. [2021-03-11 20:14:57,712 INFO L241 Difference]: Finished difference. Result has 54 places, 30 transitions, 188 flow [2021-03-11 20:14:57,712 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=54, PETRI_TRANSITIONS=30} [2021-03-11 20:14:57,712 INFO L335 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2021-03-11 20:14:57,712 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 30 transitions, 188 flow [2021-03-11 20:14:57,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:14:57,713 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:14:57,713 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] [2021-03-11 20:14:57,713 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 20:14:57,713 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:14:57,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:14:57,713 INFO L82 PathProgramCache]: Analyzing trace with hash 623630620, now seen corresponding path program 1 times [2021-03-11 20:14:57,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:14:57,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66438286] [2021-03-11 20:14:57,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:14:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:14:57,738 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:14:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:14:57,765 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:14:57,792 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:14:57,792 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:14:57,792 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 20:14:57,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:14:57 BasicIcfg [2021-03-11 20:14:57,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:14:57,845 INFO L168 Benchmark]: Toolchain (without parser) took 17357.47 ms. Allocated memory was 255.9 MB in the beginning and 595.6 MB in the end (delta: 339.7 MB). Free memory was 235.1 MB in the beginning and 361.4 MB in the end (delta: -126.3 MB). Peak memory consumption was 211.8 MB. Max. memory is 16.0 GB. [2021-03-11 20:14:57,846 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:14:57,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.07 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 234.3 MB in the beginning and 302.0 MB in the end (delta: -67.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-11 20:14:57,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.20 ms. Allocated memory is still 341.8 MB. Free memory was 301.5 MB in the beginning and 298.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:14:57,846 INFO L168 Benchmark]: Boogie Preprocessor took 18.99 ms. Allocated memory is still 341.8 MB. Free memory was 298.9 MB in the beginning and 296.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:14:57,846 INFO L168 Benchmark]: RCFGBuilder took 1114.44 ms. Allocated memory is still 341.8 MB. Free memory was 296.8 MB in the beginning and 317.9 MB in the end (delta: -21.1 MB). Peak memory consumption was 72.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:14:57,847 INFO L168 Benchmark]: TraceAbstraction took 15733.26 ms. Allocated memory was 341.8 MB in the beginning and 595.6 MB in the end (delta: 253.8 MB). Free memory was 316.8 MB in the beginning and 361.4 MB in the end (delta: -44.6 MB). Peak memory consumption was 208.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:14:57,848 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 449.07 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 234.3 MB in the beginning and 302.0 MB in the end (delta: -67.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 33.20 ms. Allocated memory is still 341.8 MB. Free memory was 301.5 MB in the beginning and 298.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 18.99 ms. Allocated memory is still 341.8 MB. Free memory was 298.9 MB in the beginning and 296.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1114.44 ms. Allocated memory is still 341.8 MB. Free memory was 296.8 MB in the beginning and 317.9 MB in the end (delta: -21.1 MB). Peak memory consumption was 72.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 15733.26 ms. Allocated memory was 341.8 MB in the beginning and 595.6 MB in the end (delta: 253.8 MB). Free memory was 316.8 MB in the beginning and 361.4 MB in the end (delta: -44.6 MB). Peak memory consumption was 208.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13011.8ms, 101 PlacesBefore, 32 PlacesAfterwards, 93 TransitionsBefore, 22 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, 4105 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2111, positive: 1955, positive conditional: 0, positive unconditional: 1955, negative: 156, negative conditional: 0, negative unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1135, positive: 1074, positive conditional: 0, positive unconditional: 1074, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1135, positive: 1063, positive conditional: 0, positive unconditional: 1063, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 919, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 902, negative conditional: 0, negative unconditional: 902, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2111, positive: 881, positive conditional: 0, positive unconditional: 881, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 1135, unknown conditional: 0, unknown unconditional: 1135] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1507; [L814] FCALL, FORK 0 pthread_create(&t1507, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1508; [L816] FCALL, FORK 0 pthread_create(&t1508, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1509; [L818] FCALL, FORK 0 pthread_create(&t1509, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15620.7ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 969.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13104.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 54 SDtfs, 8 SDslu, 7 SDs, 0 SdLazy, 219 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 286.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 537.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=9, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 34.2ms SsaConstructionTime, 352.2ms SatisfiabilityAnalysisTime, 937.8ms InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 1310 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...