/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:28:26,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:28:26,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:28:26,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:28:26,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:28:26,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:28:26,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:28:26,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:28:26,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:28:26,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:28:26,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:28:26,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:28:26,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:28:26,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:28:26,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:28:26,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:28:26,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:28:26,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:28:26,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:28:26,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:28:26,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:28:26,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:28:26,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:28:26,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:28:26,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:28:26,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:28:26,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:28:26,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:28:26,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:28:26,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:28:26,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:28:26,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:28:26,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:28:26,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:28:26,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:28:26,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:28:26,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:28:26,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:28:26,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:28:26,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:28:26,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:28:26,875 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:28:26,893 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:28:26,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:28:26,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:28:26,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:28:26,895 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:28:26,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:28:26,895 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:28:26,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:28:26,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:28:26,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:28:26,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:28:26,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:28:26,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:28:26,896 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:28:26,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:28:26,896 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:28:26,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:28:26,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:28:26,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:28:26,896 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:28:26,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:28:26,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:28:26,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:28:26,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:28:26,897 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:28:26,897 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:28:26,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:28:26,897 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:28:26,897 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:28:26,897 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:28:26,897 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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-26 10:28:27,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:28:27,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:28:27,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:28:27,131 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:28:27,131 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:28:27,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i [2021-03-26 10:28:27,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c5953e20/bed82101cc8446dca14a09a5a8b02fa7/FLAG1a016f8e0 [2021-03-26 10:28:27,557 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:28:27,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i [2021-03-26 10:28:27,566 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c5953e20/bed82101cc8446dca14a09a5a8b02fa7/FLAG1a016f8e0 [2021-03-26 10:28:27,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c5953e20/bed82101cc8446dca14a09a5a8b02fa7 [2021-03-26 10:28:27,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:28:27,938 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:28:27,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:28:27,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:28:27,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:28:27,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:28:27" (1/1) ... [2021-03-26 10:28:27,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ef855a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:27, skipping insertion in model container [2021-03-26 10:28:27,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:28:27" (1/1) ... [2021-03-26 10:28:27,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:28:27,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:28:28,071 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/safe004_power.opt.i[951,964] [2021-03-26 10:28:28,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:28:28,257 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:28:28,265 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/safe004_power.opt.i[951,964] [2021-03-26 10:28:28,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:28:28,346 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:28:28,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:28 WrapperNode [2021-03-26 10:28:28,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:28:28,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:28:28,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:28:28,348 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:28:28,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:28" (1/1) ... [2021-03-26 10:28:28,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:28" (1/1) ... [2021-03-26 10:28:28,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:28:28,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:28:28,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:28:28,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:28:28,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:28" (1/1) ... [2021-03-26 10:28:28,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:28" (1/1) ... [2021-03-26 10:28:28,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:28" (1/1) ... [2021-03-26 10:28:28,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:28" (1/1) ... [2021-03-26 10:28:28,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:28" (1/1) ... [2021-03-26 10:28:28,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:28" (1/1) ... [2021-03-26 10:28:28,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:28" (1/1) ... [2021-03-26 10:28:28,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:28:28,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:28:28,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:28:28,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:28:28,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:28" (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-26 10:28:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:28:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:28:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:28:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:28:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:28:28,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:28:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:28:28,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:28:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:28:28,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:28:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:28:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:28:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:28:28,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:28:28,492 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:28:29,779 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:28:29,780 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:28:29,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:28:29 BoogieIcfgContainer [2021-03-26 10:28:29,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:28:29,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:28:29,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:28:29,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:28:29,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:28:27" (1/3) ... [2021-03-26 10:28:29,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5c63db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:28:29, skipping insertion in model container [2021-03-26 10:28:29,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:28" (2/3) ... [2021-03-26 10:28:29,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5c63db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:28:29, skipping insertion in model container [2021-03-26 10:28:29,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:28:29" (3/3) ... [2021-03-26 10:28:29,786 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_power.opt.i [2021-03-26 10:28:29,790 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:28:29,792 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:28:29,793 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:28:29,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,815 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,815 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,815 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,815 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,819 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,819 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,819 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,822 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,822 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,822 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,822 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,825 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,826 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,826 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,827 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,828 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,829 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,831 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,831 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,831 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,831 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,831 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,831 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,831 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,831 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,831 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:28:29,832 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:28:29,844 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:28:29,856 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:28:29,856 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:28:29,856 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:28:29,856 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:28:29,856 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:28:29,856 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:28:29,856 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:28:29,856 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:28:29,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:28:29,884 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:28:29,884 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:28:29,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:28:29,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:28:29,889 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 10:28:29,890 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:29,898 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:28:29,900 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:28:29,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 10:28:29,913 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:28:29,913 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:28:29,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:28:29,915 INFO L142 LiptonReduction]: Number of co-enabled transitions 1686 [2021-03-26 10:28:31,482 WARN L205 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 10:28:32,043 WARN L205 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-26 10:28:33,260 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:28:33,771 WARN L205 SmtUtils]: Spent 509.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:28:33,922 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:28:34,295 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-26 10:28:34,412 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 10:28:35,320 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:28:35,582 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:28:36,165 WARN L205 SmtUtils]: Spent 581.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:28:36,720 WARN L205 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:28:36,849 INFO L154 LiptonReduction]: Checked pairs total: 2882 [2021-03-26 10:28:36,849 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-26 10:28:36,851 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6962 [2021-03-26 10:28:36,859 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-26 10:28:36,859 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:28:36,859 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:36,860 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:36,862 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:36,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:36,866 INFO L82 PathProgramCache]: Analyzing trace with hash 788348067, now seen corresponding path program 1 times [2021-03-26 10:28:36,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:36,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753031556] [2021-03-26 10:28:36,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:37,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:37,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:28:37,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:37,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:37,036 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-26 10:28:37,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753031556] [2021-03-26 10:28:37,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:37,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:28:37,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912302023] [2021-03-26 10:28:37,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:28:37,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:37,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:28:37,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:28:37,051 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 161 [2021-03-26 10:28:37,052 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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-26 10:28:37,052 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:37,052 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 161 [2021-03-26 10:28:37,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:37,159 INFO L129 PetriNetUnfolder]: 69/198 cut-off events. [2021-03-26 10:28:37,159 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:28:37,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 198 events. 69/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 921 event pairs, 39 based on Foata normal form. 11/192 useless extension candidates. Maximal degree in co-relation 307. Up to 89 conditions per place. [2021-03-26 10:28:37,161 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 9 selfloop transitions, 2 changer transitions 5/41 dead transitions. [2021-03-26 10:28:37,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 117 flow [2021-03-26 10:28:37,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:28:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:28:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2021-03-26 10:28:37,176 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8902691511387164 [2021-03-26 10:28:37,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2021-03-26 10:28:37,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2021-03-26 10:28:37,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:37,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2021-03-26 10:28:37,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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-26 10:28:37,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 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-26 10:28:37,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 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-26 10:28:37,193 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 430 transitions. [2021-03-26 10:28:37,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 117 flow [2021-03-26 10:28:37,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:28:37,196 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 74 flow [2021-03-26 10:28:37,197 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-26 10:28:37,197 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-26 10:28:37,197 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:37,198 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-26 10:28:37,198 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-26 10:28:37,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2021-03-26 10:28:37,203 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-26 10:28:37,203 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:28:37,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:28:37,204 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 10:28:37,654 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:28:37,931 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:28:38,474 WARN L205 SmtUtils]: Spent 540.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:28:39,039 WARN L205 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:28:39,609 INFO L154 LiptonReduction]: Checked pairs total: 1242 [2021-03-26 10:28:39,609 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-26 10:28:39,610 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2413 [2021-03-26 10:28:39,610 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 10:28:39,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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-26 10:28:39,611 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:39,611 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:39,611 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:28:39,611 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:39,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:39,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1851944499, now seen corresponding path program 1 times [2021-03-26 10:28:39,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:39,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379875219] [2021-03-26 10:28:39,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:39,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:39,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:28:39,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:39,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:39,708 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:28:39,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:28:39,711 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-26 10:28:39,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379875219] [2021-03-26 10:28:39,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:39,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:28:39,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740173633] [2021-03-26 10:28:39,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:28:39,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:39,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:28:39,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:28:39,714 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 169 [2021-03-26 10:28:39,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 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-26 10:28:39,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:39,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 169 [2021-03-26 10:28:39,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:39,743 INFO L129 PetriNetUnfolder]: 21/78 cut-off events. [2021-03-26 10:28:39,743 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:28:39,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 78 events. 21/78 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 274 event pairs, 11 based on Foata normal form. 1/75 useless extension candidates. Maximal degree in co-relation 120. Up to 40 conditions per place. [2021-03-26 10:28:39,744 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 7 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-03-26 10:28:39,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 86 flow [2021-03-26 10:28:39,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:28:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:28:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2021-03-26 10:28:39,746 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8500986193293886 [2021-03-26 10:28:39,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2021-03-26 10:28:39,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2021-03-26 10:28:39,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:39,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2021-03-26 10:28:39,747 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-26 10:28:39,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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-26 10:28:39,748 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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-26 10:28:39,748 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 431 transitions. [2021-03-26 10:28:39,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 86 flow [2021-03-26 10:28:39,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:28:39,749 INFO L241 Difference]: Finished difference. Result has 34 places, 26 transitions, 73 flow [2021-03-26 10:28:39,749 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2021-03-26 10:28:39,750 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-26 10:28:39,750 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:39,750 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 73 flow [2021-03-26 10:28:39,750 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 73 flow [2021-03-26 10:28:39,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 73 flow [2021-03-26 10:28:39,755 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-03-26 10:28:39,755 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:28:39,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 36 events. 3/36 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-26 10:28:39,756 INFO L142 LiptonReduction]: Number of co-enabled transitions 270 [2021-03-26 10:28:40,293 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:28:40,435 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:28:40,691 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:28:40,811 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:28:40,813 INFO L154 LiptonReduction]: Checked pairs total: 780 [2021-03-26 10:28:40,813 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:28:40,814 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1064 [2021-03-26 10:28:40,814 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 69 flow [2021-03-26 10:28:40,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 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-26 10:28:40,815 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:40,815 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:40,815 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:28:40,815 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:40,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:40,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1193503231, now seen corresponding path program 1 times [2021-03-26 10:28:40,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:40,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68521538] [2021-03-26 10:28:40,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:40,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:40,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:40,875 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-26 10:28:40,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68521538] [2021-03-26 10:28:40,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:40,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:28:40,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438365904] [2021-03-26 10:28:40,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:28:40,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:40,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:28:40,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:28:40,877 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 171 [2021-03-26 10:28:40,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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-26 10:28:40,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:40,877 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 171 [2021-03-26 10:28:40,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:40,886 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-26 10:28:40,886 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 10:28:40,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 32 events. 3/32 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-26 10:28:40,886 INFO L132 encePairwiseOnDemand]: 168/171 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2021-03-26 10:28:40,886 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 75 flow [2021-03-26 10:28:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:28:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:28:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-26 10:28:40,888 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8966861598440545 [2021-03-26 10:28:40,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-26 10:28:40,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-26 10:28:40,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:40,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-26 10:28:40,889 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-26 10:28:40,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 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-26 10:28:40,890 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 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-26 10:28:40,890 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 69 flow. Second operand 3 states and 460 transitions. [2021-03-26 10:28:40,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 75 flow [2021-03-26 10:28:40,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 72 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:28:40,891 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 74 flow [2021-03-26 10:28:40,891 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2021-03-26 10:28:40,891 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-26 10:28:40,891 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:40,891 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 74 flow [2021-03-26 10:28:40,891 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 74 flow [2021-03-26 10:28:40,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 74 flow [2021-03-26 10:28:40,894 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-26 10:28:40,895 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 10:28:40,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 34 events. 3/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-26 10:28:40,895 INFO L142 LiptonReduction]: Number of co-enabled transitions 268 [2021-03-26 10:28:40,896 INFO L154 LiptonReduction]: Checked pairs total: 246 [2021-03-26 10:28:40,896 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:40,896 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5 [2021-03-26 10:28:40,897 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 74 flow [2021-03-26 10:28:40,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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-26 10:28:40,897 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:40,897 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:40,897 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:28:40,897 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:40,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:40,898 INFO L82 PathProgramCache]: Analyzing trace with hash 510325772, now seen corresponding path program 1 times [2021-03-26 10:28:40,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:40,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565557613] [2021-03-26 10:28:40,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:40,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:40,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:40,961 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-26 10:28:40,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565557613] [2021-03-26 10:28:40,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:40,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:28:40,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928687483] [2021-03-26 10:28:40,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:28:40,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:40,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:28:40,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:28:40,963 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 171 [2021-03-26 10:28:40,963 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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-26 10:28:40,963 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:40,963 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 171 [2021-03-26 10:28:40,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:40,970 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-26 10:28:40,970 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-03-26 10:28:40,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 32 events. 3/32 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 71 event pairs, 1 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-03-26 10:28:40,971 INFO L132 encePairwiseOnDemand]: 168/171 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2021-03-26 10:28:40,971 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 24 transitions, 80 flow [2021-03-26 10:28:40,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:28:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:28:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-26 10:28:40,972 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8966861598440545 [2021-03-26 10:28:40,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-26 10:28:40,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-26 10:28:40,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:40,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-26 10:28:40,973 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-26 10:28:40,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 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-26 10:28:40,974 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 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-26 10:28:40,974 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 74 flow. Second operand 3 states and 460 transitions. [2021-03-26 10:28:40,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 24 transitions, 80 flow [2021-03-26 10:28:40,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 24 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:28:40,984 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 78 flow [2021-03-26 10:28:40,984 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2021-03-26 10:28:40,984 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -13 predicate places. [2021-03-26 10:28:40,984 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:40,984 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 78 flow [2021-03-26 10:28:40,984 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 78 flow [2021-03-26 10:28:40,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 24 transitions, 78 flow [2021-03-26 10:28:40,988 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-26 10:28:40,988 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-26 10:28:40,988 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 34 events. 3/34 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 54. Up to 10 conditions per place. [2021-03-26 10:28:40,988 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-26 10:28:40,989 INFO L154 LiptonReduction]: Checked pairs total: 244 [2021-03-26 10:28:40,989 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:40,989 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5 [2021-03-26 10:28:40,990 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 78 flow [2021-03-26 10:28:40,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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-26 10:28:40,990 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:40,990 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:40,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:28:40,991 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:40,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:40,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2015421001, now seen corresponding path program 1 times [2021-03-26 10:28:40,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:40,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063133816] [2021-03-26 10:28:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:41,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:41,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:41,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:41,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:41,058 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-26 10:28:41,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063133816] [2021-03-26 10:28:41,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:41,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:28:41,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943584039] [2021-03-26 10:28:41,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:28:41,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:41,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:28:41,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:28:41,060 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2021-03-26 10:28:41,060 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 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-26 10:28:41,060 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:41,060 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2021-03-26 10:28:41,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:41,088 INFO L129 PetriNetUnfolder]: 12/71 cut-off events. [2021-03-26 10:28:41,088 INFO L130 PetriNetUnfolder]: For 40/70 co-relation queries the response was YES. [2021-03-26 10:28:41,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 71 events. 12/71 cut-off events. For 40/70 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 301 event pairs, 0 based on Foata normal form. 8/78 useless extension candidates. Maximal degree in co-relation 150. Up to 22 conditions per place. [2021-03-26 10:28:41,089 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 6 selfloop transitions, 4 changer transitions 3/29 dead transitions. [2021-03-26 10:28:41,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 125 flow [2021-03-26 10:28:41,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:28:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:28:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2021-03-26 10:28:41,091 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8391812865497076 [2021-03-26 10:28:41,091 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2021-03-26 10:28:41,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2021-03-26 10:28:41,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:41,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2021-03-26 10:28:41,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 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-26 10:28:41,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 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-26 10:28:41,094 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 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-26 10:28:41,094 INFO L185 Difference]: Start difference. First operand has 35 places, 24 transitions, 78 flow. Second operand 4 states and 574 transitions. [2021-03-26 10:28:41,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 125 flow [2021-03-26 10:28:41,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 112 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:28:41,095 INFO L241 Difference]: Finished difference. Result has 36 places, 24 transitions, 83 flow [2021-03-26 10:28:41,095 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2021-03-26 10:28:41,095 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -12 predicate places. [2021-03-26 10:28:41,095 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:41,096 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 24 transitions, 83 flow [2021-03-26 10:28:41,096 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 83 flow [2021-03-26 10:28:41,096 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 24 transitions, 83 flow [2021-03-26 10:28:41,099 INFO L129 PetriNetUnfolder]: 3/38 cut-off events. [2021-03-26 10:28:41,099 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-26 10:28:41,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 38 events. 3/38 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 89 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 63. Up to 10 conditions per place. [2021-03-26 10:28:41,099 INFO L142 LiptonReduction]: Number of co-enabled transitions 250 [2021-03-26 10:28:41,101 INFO L154 LiptonReduction]: Checked pairs total: 234 [2021-03-26 10:28:41,101 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:41,101 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-03-26 10:28:41,101 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 83 flow [2021-03-26 10:28:41,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 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-26 10:28:41,102 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:41,102 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:41,102 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:28:41,102 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:41,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:41,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2069532121, now seen corresponding path program 2 times [2021-03-26 10:28:41,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:41,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280930772] [2021-03-26 10:28:41,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:41,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:41,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:28:41,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:41,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:41,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:41,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:41,139 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-26 10:28:41,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280930772] [2021-03-26 10:28:41,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:41,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:28:41,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559814850] [2021-03-26 10:28:41,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:28:41,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:41,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:28:41,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:28:41,140 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2021-03-26 10:28:41,141 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 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-26 10:28:41,141 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:41,141 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2021-03-26 10:28:41,141 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:41,176 INFO L129 PetriNetUnfolder]: 4/60 cut-off events. [2021-03-26 10:28:41,177 INFO L130 PetriNetUnfolder]: For 38/41 co-relation queries the response was YES. [2021-03-26 10:28:41,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 60 events. 4/60 cut-off events. For 38/41 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 241 event pairs, 0 based on Foata normal form. 6/65 useless extension candidates. Maximal degree in co-relation 118. Up to 13 conditions per place. [2021-03-26 10:28:41,177 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 7 selfloop transitions, 4 changer transitions 4/31 dead transitions. [2021-03-26 10:28:41,177 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 143 flow [2021-03-26 10:28:41,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:28:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:28:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 716 transitions. [2021-03-26 10:28:41,179 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8374269005847953 [2021-03-26 10:28:41,179 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 716 transitions. [2021-03-26 10:28:41,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 716 transitions. [2021-03-26 10:28:41,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:41,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 716 transitions. [2021-03-26 10:28:41,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.2) internal successors, (716), 5 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-26 10:28:41,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 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-26 10:28:41,183 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 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-26 10:28:41,183 INFO L185 Difference]: Start difference. First operand has 36 places, 24 transitions, 83 flow. Second operand 5 states and 716 transitions. [2021-03-26 10:28:41,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 143 flow [2021-03-26 10:28:41,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 129 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-26 10:28:41,184 INFO L241 Difference]: Finished difference. Result has 41 places, 26 transitions, 109 flow [2021-03-26 10:28:41,185 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2021-03-26 10:28:41,185 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2021-03-26 10:28:41,185 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:41,185 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 26 transitions, 109 flow [2021-03-26 10:28:41,185 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 26 transitions, 109 flow [2021-03-26 10:28:41,186 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 109 flow [2021-03-26 10:28:41,191 INFO L129 PetriNetUnfolder]: 2/43 cut-off events. [2021-03-26 10:28:41,191 INFO L130 PetriNetUnfolder]: For 42/45 co-relation queries the response was YES. [2021-03-26 10:28:41,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 43 events. 2/43 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 119 event pairs, 0 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 79. Up to 10 conditions per place. [2021-03-26 10:28:41,191 INFO L142 LiptonReduction]: Number of co-enabled transitions 252 [2021-03-26 10:28:41,386 INFO L154 LiptonReduction]: Checked pairs total: 271 [2021-03-26 10:28:41,386 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:41,386 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 201 [2021-03-26 10:28:41,387 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 109 flow [2021-03-26 10:28:41,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 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-26 10:28:41,387 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:41,387 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:41,387 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:28:41,387 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:41,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1044540930, now seen corresponding path program 1 times [2021-03-26 10:28:41,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:41,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398225975] [2021-03-26 10:28:41,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:41,437 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-26 10:28:41,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:28:41,445 INFO L142 QuantifierPusher]: treesize reduction 40, result has 37.5 percent of original size [2021-03-26 10:28:41,446 INFO L147 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size 20 [2021-03-26 10:28:41,467 INFO L142 QuantifierPusher]: treesize reduction 15, result has 82.4 percent of original size [2021-03-26 10:28:41,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-03-26 10:28:41,505 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-26 10:28:41,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398225975] [2021-03-26 10:28:41,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:41,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:28:41,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138322752] [2021-03-26 10:28:41,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:28:41,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:41,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:28:41,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:28:41,507 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 171 [2021-03-26 10:28:41,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 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-26 10:28:41,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:41,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 171 [2021-03-26 10:28:41,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:41,589 INFO L129 PetriNetUnfolder]: 106/245 cut-off events. [2021-03-26 10:28:41,590 INFO L130 PetriNetUnfolder]: For 366/392 co-relation queries the response was YES. [2021-03-26 10:28:41,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 245 events. 106/245 cut-off events. For 366/392 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1188 event pairs, 59 based on Foata normal form. 7/232 useless extension candidates. Maximal degree in co-relation 569. Up to 173 conditions per place. [2021-03-26 10:28:41,591 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 10 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2021-03-26 10:28:41,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 155 flow [2021-03-26 10:28:41,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:28:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:28:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2021-03-26 10:28:41,593 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2021-03-26 10:28:41,593 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2021-03-26 10:28:41,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2021-03-26 10:28:41,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:41,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2021-03-26 10:28:41,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 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-26 10:28:41,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 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-26 10:28:41,595 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 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-26 10:28:41,595 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 109 flow. Second operand 4 states and 516 transitions. [2021-03-26 10:28:41,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 155 flow [2021-03-26 10:28:41,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 137 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-03-26 10:28:41,598 INFO L241 Difference]: Finished difference. Result has 40 places, 31 transitions, 132 flow [2021-03-26 10:28:41,599 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2021-03-26 10:28:41,599 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2021-03-26 10:28:41,599 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:41,599 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 132 flow [2021-03-26 10:28:41,599 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 132 flow [2021-03-26 10:28:41,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 132 flow [2021-03-26 10:28:41,628 INFO L129 PetriNetUnfolder]: 27/101 cut-off events. [2021-03-26 10:28:41,628 INFO L130 PetriNetUnfolder]: For 94/98 co-relation queries the response was YES. [2021-03-26 10:28:41,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 101 events. 27/101 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 420 event pairs, 3 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 228. Up to 42 conditions per place. [2021-03-26 10:28:41,629 INFO L142 LiptonReduction]: Number of co-enabled transitions 298 [2021-03-26 10:28:41,688 INFO L154 LiptonReduction]: Checked pairs total: 128 [2021-03-26 10:28:41,688 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:28:41,688 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 89 [2021-03-26 10:28:41,689 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 132 flow [2021-03-26 10:28:41,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 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-26 10:28:41,689 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:41,689 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:41,689 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:28:41,689 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:41,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:41,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2056530295, now seen corresponding path program 1 times [2021-03-26 10:28:41,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:41,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322184172] [2021-03-26 10:28:41,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:41,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:41,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:28:41,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:41,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:41,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:41,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:41,731 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-26 10:28:41,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322184172] [2021-03-26 10:28:41,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:41,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:28:41,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299942746] [2021-03-26 10:28:41,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:28:41,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:41,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:28:41,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:28:41,732 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2021-03-26 10:28:41,733 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 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-26 10:28:41,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:41,733 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2021-03-26 10:28:41,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:41,759 INFO L129 PetriNetUnfolder]: 32/116 cut-off events. [2021-03-26 10:28:41,759 INFO L130 PetriNetUnfolder]: For 186/199 co-relation queries the response was YES. [2021-03-26 10:28:41,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 116 events. 32/116 cut-off events. For 186/199 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 513 event pairs, 9 based on Foata normal form. 15/127 useless extension candidates. Maximal degree in co-relation 293. Up to 54 conditions per place. [2021-03-26 10:28:41,760 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 6 selfloop transitions, 4 changer transitions 1/32 dead transitions. [2021-03-26 10:28:41,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 32 transitions, 157 flow [2021-03-26 10:28:41,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:28:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:28:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions. [2021-03-26 10:28:41,762 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8347953216374269 [2021-03-26 10:28:41,762 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 571 transitions. [2021-03-26 10:28:41,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions. [2021-03-26 10:28:41,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:41,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions. [2021-03-26 10:28:41,763 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-26 10:28:41,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 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-26 10:28:41,764 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 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-26 10:28:41,764 INFO L185 Difference]: Start difference. First operand has 40 places, 31 transitions, 132 flow. Second operand 4 states and 571 transitions. [2021-03-26 10:28:41,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 32 transitions, 157 flow [2021-03-26 10:28:41,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 32 transitions, 157 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:28:41,766 INFO L241 Difference]: Finished difference. Result has 45 places, 31 transitions, 148 flow [2021-03-26 10:28:41,766 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2021-03-26 10:28:41,766 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-26 10:28:41,766 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:41,766 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 31 transitions, 148 flow [2021-03-26 10:28:41,766 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 31 transitions, 148 flow [2021-03-26 10:28:41,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 31 transitions, 148 flow [2021-03-26 10:28:41,776 INFO L129 PetriNetUnfolder]: 28/107 cut-off events. [2021-03-26 10:28:41,776 INFO L130 PetriNetUnfolder]: For 202/205 co-relation queries the response was YES. [2021-03-26 10:28:41,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 107 events. 28/107 cut-off events. For 202/205 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 461 event pairs, 8 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 268. Up to 48 conditions per place. [2021-03-26 10:28:41,777 INFO L142 LiptonReduction]: Number of co-enabled transitions 296 [2021-03-26 10:28:41,822 INFO L154 LiptonReduction]: Checked pairs total: 286 [2021-03-26 10:28:41,822 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:28:41,822 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-03-26 10:28:41,823 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 146 flow [2021-03-26 10:28:41,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 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-26 10:28:41,823 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:41,823 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:41,823 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:28:41,823 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:41,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:41,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2094400293, now seen corresponding path program 2 times [2021-03-26 10:28:41,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:41,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96762803] [2021-03-26 10:28:41,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:41,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:41,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:41,871 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:28:41,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:28:41,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:41,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:28:41,876 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-26 10:28:41,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96762803] [2021-03-26 10:28:41,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:41,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:28:41,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847712511] [2021-03-26 10:28:41,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:28:41,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:41,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:28:41,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:28:41,880 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172 [2021-03-26 10:28:41,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 146 flow. Second operand has 4 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-26 10:28:41,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:41,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172 [2021-03-26 10:28:41,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:41,934 INFO L129 PetriNetUnfolder]: 173/380 cut-off events. [2021-03-26 10:28:41,935 INFO L130 PetriNetUnfolder]: For 520/556 co-relation queries the response was YES. [2021-03-26 10:28:41,936 INFO L84 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 380 events. 173/380 cut-off events. For 520/556 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2189 event pairs, 51 based on Foata normal form. 32/341 useless extension candidates. Maximal degree in co-relation 902. Up to 241 conditions per place. [2021-03-26 10:28:41,937 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 10 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2021-03-26 10:28:41,937 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 204 flow [2021-03-26 10:28:41,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:28:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:28:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 730 transitions. [2021-03-26 10:28:41,939 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8488372093023255 [2021-03-26 10:28:41,939 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 730 transitions. [2021-03-26 10:28:41,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 730 transitions. [2021-03-26 10:28:41,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:41,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 730 transitions. [2021-03-26 10:28:41,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 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-26 10:28:41,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 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-26 10:28:41,941 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 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-26 10:28:41,941 INFO L185 Difference]: Start difference. First operand has 43 places, 30 transitions, 146 flow. Second operand 5 states and 730 transitions. [2021-03-26 10:28:41,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 204 flow [2021-03-26 10:28:41,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 188 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 10:28:41,943 INFO L241 Difference]: Finished difference. Result has 46 places, 37 transitions, 190 flow [2021-03-26 10:28:41,943 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2021-03-26 10:28:41,943 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2021-03-26 10:28:41,943 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:41,943 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 190 flow [2021-03-26 10:28:41,943 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 190 flow [2021-03-26 10:28:41,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 190 flow [2021-03-26 10:28:41,965 INFO L129 PetriNetUnfolder]: 128/307 cut-off events. [2021-03-26 10:28:41,966 INFO L130 PetriNetUnfolder]: For 349/393 co-relation queries the response was YES. [2021-03-26 10:28:41,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 307 events. 128/307 cut-off events. For 349/393 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1774 event pairs, 43 based on Foata normal form. 13/299 useless extension candidates. Maximal degree in co-relation 888. Up to 169 conditions per place. [2021-03-26 10:28:41,968 INFO L142 LiptonReduction]: Number of co-enabled transitions 326 [2021-03-26 10:28:42,018 INFO L154 LiptonReduction]: Checked pairs total: 138 [2021-03-26 10:28:42,018 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:28:42,019 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76 [2021-03-26 10:28:42,019 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 184 flow [2021-03-26 10:28:42,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 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-26 10:28:42,019 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:42,019 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:42,020 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:28:42,020 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:42,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:42,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1266902118, now seen corresponding path program 1 times [2021-03-26 10:28:42,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:42,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447988766] [2021-03-26 10:28:42,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:42,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:42,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:42,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:42,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:42,067 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:28:42,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:28:42,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:42,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:28:42,073 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-26 10:28:42,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447988766] [2021-03-26 10:28:42,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:42,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:28:42,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827366446] [2021-03-26 10:28:42,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:28:42,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:42,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:28:42,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:28:42,076 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172 [2021-03-26 10:28:42,076 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 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-26 10:28:42,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:42,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172 [2021-03-26 10:28:42,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:42,127 INFO L129 PetriNetUnfolder]: 105/263 cut-off events. [2021-03-26 10:28:42,127 INFO L130 PetriNetUnfolder]: For 254/314 co-relation queries the response was YES. [2021-03-26 10:28:42,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 263 events. 105/263 cut-off events. For 254/314 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1370 event pairs, 8 based on Foata normal form. 44/282 useless extension candidates. Maximal degree in co-relation 882. Up to 159 conditions per place. [2021-03-26 10:28:42,129 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 8 selfloop transitions, 11 changer transitions 3/45 dead transitions. [2021-03-26 10:28:42,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 272 flow [2021-03-26 10:28:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:28:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:28:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 876 transitions. [2021-03-26 10:28:42,131 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8488372093023255 [2021-03-26 10:28:42,131 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 876 transitions. [2021-03-26 10:28:42,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 876 transitions. [2021-03-26 10:28:42,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:42,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 876 transitions. [2021-03-26 10:28:42,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 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-26 10:28:42,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 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-26 10:28:42,134 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 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-26 10:28:42,134 INFO L185 Difference]: Start difference. First operand has 46 places, 36 transitions, 184 flow. Second operand 6 states and 876 transitions. [2021-03-26 10:28:42,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 272 flow [2021-03-26 10:28:42,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 266 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:28:42,138 INFO L241 Difference]: Finished difference. Result has 50 places, 40 transitions, 248 flow [2021-03-26 10:28:42,138 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2021-03-26 10:28:42,138 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2021-03-26 10:28:42,138 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:42,138 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 40 transitions, 248 flow [2021-03-26 10:28:42,138 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 40 transitions, 248 flow [2021-03-26 10:28:42,139 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 248 flow [2021-03-26 10:28:42,156 INFO L129 PetriNetUnfolder]: 61/189 cut-off events. [2021-03-26 10:28:42,156 INFO L130 PetriNetUnfolder]: For 333/342 co-relation queries the response was YES. [2021-03-26 10:28:42,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 189 events. 61/189 cut-off events. For 333/342 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 986 event pairs, 8 based on Foata normal form. 1/185 useless extension candidates. Maximal degree in co-relation 683. Up to 110 conditions per place. [2021-03-26 10:28:42,158 INFO L142 LiptonReduction]: Number of co-enabled transitions 298 [2021-03-26 10:28:42,163 INFO L154 LiptonReduction]: Checked pairs total: 131 [2021-03-26 10:28:42,163 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:28:42,163 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-26 10:28:42,163 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 240 flow [2021-03-26 10:28:42,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 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-26 10:28:42,164 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:42,164 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:28:42,164 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:28:42,164 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:42,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1383472924, now seen corresponding path program 1 times [2021-03-26 10:28:42,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:42,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009577987] [2021-03-26 10:28:42,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:28:42,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:42,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:42,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:42,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:42,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:42,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:28:42,223 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:28:42,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:28:42,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:28:42,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:28:42,233 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-26 10:28:42,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009577987] [2021-03-26 10:28:42,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:28:42,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:28:42,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067450432] [2021-03-26 10:28:42,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:28:42,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:28:42,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:28:42,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:28:42,234 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172 [2021-03-26 10:28:42,235 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 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-26 10:28:42,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:28:42,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172 [2021-03-26 10:28:42,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:28:42,285 INFO L129 PetriNetUnfolder]: 74/187 cut-off events. [2021-03-26 10:28:42,285 INFO L130 PetriNetUnfolder]: For 372/426 co-relation queries the response was YES. [2021-03-26 10:28:42,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 187 events. 74/187 cut-off events. For 372/426 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 836 event pairs, 2 based on Foata normal form. 26/191 useless extension candidates. Maximal degree in co-relation 715. Up to 108 conditions per place. [2021-03-26 10:28:42,286 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 5 selfloop transitions, 11 changer transitions 4/42 dead transitions. [2021-03-26 10:28:42,286 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 42 transitions, 282 flow [2021-03-26 10:28:42,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:28:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:28:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1016 transitions. [2021-03-26 10:28:42,288 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8438538205980066 [2021-03-26 10:28:42,288 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1016 transitions. [2021-03-26 10:28:42,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1016 transitions. [2021-03-26 10:28:42,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:28:42,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1016 transitions. [2021-03-26 10:28:42,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.14285714285714) internal successors, (1016), 7 states have internal predecessors, (1016), 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-26 10:28:42,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 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-26 10:28:42,292 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 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-26 10:28:42,292 INFO L185 Difference]: Start difference. First operand has 50 places, 39 transitions, 240 flow. Second operand 7 states and 1016 transitions. [2021-03-26 10:28:42,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 42 transitions, 282 flow [2021-03-26 10:28:42,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 250 flow, removed 13 selfloop flow, removed 4 redundant places. [2021-03-26 10:28:42,295 INFO L241 Difference]: Finished difference. Result has 53 places, 36 transitions, 216 flow [2021-03-26 10:28:42,295 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2021-03-26 10:28:42,295 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2021-03-26 10:28:42,295 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:28:42,295 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 36 transitions, 216 flow [2021-03-26 10:28:42,295 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 36 transitions, 216 flow [2021-03-26 10:28:42,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 36 transitions, 216 flow [2021-03-26 10:28:42,303 INFO L129 PetriNetUnfolder]: 26/108 cut-off events. [2021-03-26 10:28:42,303 INFO L130 PetriNetUnfolder]: For 144/145 co-relation queries the response was YES. [2021-03-26 10:28:42,303 INFO L84 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 108 events. 26/108 cut-off events. For 144/145 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 449 event pairs, 2 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 363. Up to 36 conditions per place. [2021-03-26 10:28:42,304 INFO L142 LiptonReduction]: Number of co-enabled transitions 226 [2021-03-26 10:28:42,576 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 10:28:42,743 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 10:28:43,355 WARN L205 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 194 [2021-03-26 10:28:43,566 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:28:44,859 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 348 DAG size of output: 276 [2021-03-26 10:28:45,390 WARN L205 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-26 10:28:45,394 INFO L154 LiptonReduction]: Checked pairs total: 178 [2021-03-26 10:28:45,395 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:28:45,395 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3100 [2021-03-26 10:28:45,395 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 216 flow [2021-03-26 10:28:45,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 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-26 10:28:45,395 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:28:45,395 INFO L263 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-26 10:28:45,395 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:28:45,396 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:28:45,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:28:45,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1418499422, now seen corresponding path program 1 times [2021-03-26 10:28:45,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:28:45,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955056543] [2021-03-26 10:28:45,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:28:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:28:45,445 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:28:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:28:45,472 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:28:45,489 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:28:45,490 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:28:45,490 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:28:45,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:28:45 BasicIcfg [2021-03-26 10:28:45,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:28:45,552 INFO L168 Benchmark]: Toolchain (without parser) took 17613.64 ms. Allocated memory was 255.9 MB in the beginning and 690.0 MB in the end (delta: 434.1 MB). Free memory was 234.5 MB in the beginning and 540.4 MB in the end (delta: -305.9 MB). Peak memory consumption was 127.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:28:45,552 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:28:45,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.73 ms. Allocated memory was 255.9 MB in the beginning and 398.5 MB in the end (delta: 142.6 MB). Free memory was 234.5 MB in the beginning and 359.4 MB in the end (delta: -124.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:28:45,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.02 ms. Allocated memory is still 398.5 MB. Free memory was 359.4 MB in the beginning and 356.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:28:45,553 INFO L168 Benchmark]: Boogie Preprocessor took 19.47 ms. Allocated memory is still 398.5 MB. Free memory was 356.6 MB in the beginning and 354.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:28:45,553 INFO L168 Benchmark]: RCFGBuilder took 1353.09 ms. Allocated memory is still 398.5 MB. Free memory was 354.5 MB in the beginning and 258.1 MB in the end (delta: 96.4 MB). Peak memory consumption was 100.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:28:45,553 INFO L168 Benchmark]: TraceAbstraction took 15769.83 ms. Allocated memory was 398.5 MB in the beginning and 690.0 MB in the end (delta: 291.5 MB). Free memory was 257.3 MB in the beginning and 540.4 MB in the end (delta: -283.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. [2021-03-26 10:28:45,554 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.35 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 407.73 ms. Allocated memory was 255.9 MB in the beginning and 398.5 MB in the end (delta: 142.6 MB). Free memory was 234.5 MB in the beginning and 359.4 MB in the end (delta: -124.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 60.02 ms. Allocated memory is still 398.5 MB. Free memory was 359.4 MB in the beginning and 356.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 19.47 ms. Allocated memory is still 398.5 MB. Free memory was 356.6 MB in the beginning and 354.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1353.09 ms. Allocated memory is still 398.5 MB. Free memory was 354.5 MB in the beginning and 258.1 MB in the end (delta: 96.4 MB). Peak memory consumption was 100.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 15769.83 ms. Allocated memory was 398.5 MB in the beginning and 690.0 MB in the end (delta: 291.5 MB). Free memory was 257.3 MB in the beginning and 540.4 MB in the end (delta: -283.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6948.8ms, 102 PlacesBefore, 48 PlacesAfterwards, 94 TransitionsBefore, 39 TransitionsAfterwards, 1686 CoEnabledTransitionPairs, 4 FixpointIterations, 26 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 2882 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1370, positive: 1298, positive conditional: 1298, positive unconditional: 0, negative: 72, negative conditional: 72, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1370, positive: 1298, positive conditional: 0, positive unconditional: 1298, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1370, positive: 1298, positive conditional: 0, positive unconditional: 1298, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1079, positive: 1045, positive conditional: 0, positive unconditional: 1045, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1079, positive: 1036, positive conditional: 0, positive unconditional: 1036, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 435, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 403, negative conditional: 0, negative unconditional: 403, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1370, positive: 253, positive conditional: 0, positive unconditional: 253, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 1079, unknown conditional: 0, unknown unconditional: 1079] , Statistics on independence cache: Total cache size (in pairs): 1079, Positive cache size: 1045, Positive conditional cache size: 0, Positive unconditional cache size: 1045, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2411.0ms, 45 PlacesBefore, 33 PlacesAfterwards, 32 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 1242 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 333, positive: 244, positive conditional: 244, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 333, positive: 244, positive conditional: 11, positive unconditional: 233, negative: 89, negative conditional: 4, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 333, positive: 244, positive conditional: 11, positive unconditional: 233, negative: 89, negative conditional: 4, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 55, positive: 46, positive conditional: 1, positive unconditional: 45, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 55, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 118, negative conditional: 15, negative unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 333, positive: 198, positive conditional: 10, positive unconditional: 188, negative: 80, negative conditional: 3, negative unconditional: 77, unknown: 55, unknown conditional: 2, unknown unconditional: 53] , Statistics on independence cache: Total cache size (in pairs): 1134, Positive cache size: 1091, Positive conditional cache size: 1, Positive unconditional cache size: 1090, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1063.0ms, 34 PlacesBefore, 32 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 780 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 140, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 140, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 140, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 140, positive: 82, positive conditional: 0, positive unconditional: 82, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1138, Positive cache size: 1095, Positive conditional cache size: 1, Positive unconditional cache size: 1094, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8ms, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 246 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1138, Positive cache size: 1095, Positive conditional cache size: 1, Positive unconditional cache size: 1094, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9ms, 35 PlacesBefore, 35 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 244 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1138, Positive cache size: 1095, Positive conditional cache size: 1, Positive unconditional cache size: 1094, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9ms, 36 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 234 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1138, Positive cache size: 1095, Positive conditional cache size: 1, Positive unconditional cache size: 1094, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 200.9ms, 41 PlacesBefore, 39 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 271 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 192, negative conditional: 0, negative unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 1150, Positive cache size: 1099, Positive conditional cache size: 1, Positive unconditional cache size: 1098, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 89.0ms, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 128 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, positive: 26, positive conditional: 2, positive unconditional: 24, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, positive: 26, positive conditional: 2, positive unconditional: 24, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 1, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, positive: 19, positive conditional: 1, positive unconditional: 18, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 10, unknown conditional: 1, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 1160, Positive cache size: 1106, Positive conditional cache size: 2, Positive unconditional cache size: 1104, Negative cache size: 54, Negative conditional cache size: 1, Negative unconditional cache size: 53, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56.1ms, 45 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 286 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, positive: 33, positive conditional: 33, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 1167, Positive cache size: 1112, Positive conditional cache size: 2, Positive unconditional cache size: 1110, Negative cache size: 55, Negative conditional cache size: 1, Negative unconditional cache size: 54, Eliminated conditions: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75.1ms, 46 PlacesBefore, 46 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 138 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, positive: 48, positive conditional: 20, positive unconditional: 28, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, positive: 48, positive conditional: 20, positive unconditional: 28, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 9, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, positive: 30, positive conditional: 11, positive unconditional: 19, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 20, unknown conditional: 9, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 1187, Positive cache size: 1130, Positive conditional cache size: 11, Positive unconditional cache size: 1119, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.3ms, 50 PlacesBefore, 50 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 131 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, positive: 32, positive conditional: 20, positive unconditional: 12, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 32, positive conditional: 20, positive unconditional: 12, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 29, positive conditional: 17, positive unconditional: 12, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1190, Positive cache size: 1133, Positive conditional cache size: 14, Positive unconditional cache size: 1119, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3099.3ms, 53 PlacesBefore, 50 PlacesAfterwards, 36 TransitionsBefore, 34 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 178 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, positive: 46, positive conditional: 46, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, positive: 46, positive conditional: 22, positive unconditional: 24, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 46, positive conditional: 22, positive unconditional: 24, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, positive: 44, positive conditional: 20, positive unconditional: 24, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1192, Positive cache size: 1135, Positive conditional cache size: 16, Positive unconditional cache size: 1119, Negative cache size: 57, Negative conditional cache size: 1, Negative unconditional cache size: 56, Eliminated conditions: 0 - 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; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 pthread_t t1878; [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$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=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15637.0ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 621.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7000.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 47 SDtfs, 27 SDslu, 24 SDs, 0 SdLazy, 177 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 157.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 147.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=10, InterpolantAutomatonStates: 47, 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: 26.2ms SsaConstructionTime, 324.0ms SatisfiabilityAnalysisTime, 443.9ms InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...