/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/safe029_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:40:58,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:40:58,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:40:58,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:40:58,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:40:58,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:40:58,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:40:58,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:40:58,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:40:58,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:40:58,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:40:58,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:40:58,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:40:58,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:40:58,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:40:58,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:40:58,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:40:58,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:40:58,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:40:58,873 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:40:58,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:40:58,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:40:58,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:40:58,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:40:58,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:40:58,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:40:58,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:40:58,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:40:58,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:40:58,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:40:58,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:40:58,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:40:58,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:40:58,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:40:58,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:40:58,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:40:58,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:40:58,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:40:58,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:40:58,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:40:58,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:40:58,891 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:40:58,915 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:40:58,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:40:58,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:40:58,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:40:58,919 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:40:58,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:40:58,919 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:40:58,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:40:58,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:40:58,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:40:58,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:40:58,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:40:58,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:40:58,921 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:40:58,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:40:58,921 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:40:58,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:40:58,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:40:58,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:40:58,921 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:40:58,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:40:58,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:40:58,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:40:58,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:40:58,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:40:58,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:40:58,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:40:58,922 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:40:58,922 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:40:58,923 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:40:58,923 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:40:59,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:40:59,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:40:59,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:40:59,308 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:40:59,308 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:40:59,309 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2021-03-26 10:40:59,370 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d7e7d19/ea6949c4c8ae475499ca940deaa188d4/FLAG701880cc9 [2021-03-26 10:40:59,893 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:40:59,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2021-03-26 10:40:59,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d7e7d19/ea6949c4c8ae475499ca940deaa188d4/FLAG701880cc9 [2021-03-26 10:41:00,371 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d7e7d19/ea6949c4c8ae475499ca940deaa188d4 [2021-03-26 10:41:00,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:41:00,375 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:41:00,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:41:00,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:41:00,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:41:00,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:41:00" (1/1) ... [2021-03-26 10:41:00,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f8bd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:00, skipping insertion in model container [2021-03-26 10:41:00,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:41:00" (1/1) ... [2021-03-26 10:41:00,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:41:00,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:41:00,559 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/safe029_rmo.oepc.i[950,963] [2021-03-26 10:41:00,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:41:00,681 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:41:00,690 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/safe029_rmo.oepc.i[950,963] [2021-03-26 10:41:00,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:41:00,771 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:41:00,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:00 WrapperNode [2021-03-26 10:41:00,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:41:00,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:41:00,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:41:00,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:41:00,779 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:41:00" (1/1) ... [2021-03-26 10:41:00,800 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:41:00" (1/1) ... [2021-03-26 10:41:00,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:41:00,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:41:00,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:41:00,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:41:00,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:00" (1/1) ... [2021-03-26 10:41:00,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:00" (1/1) ... [2021-03-26 10:41:00,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:00" (1/1) ... [2021-03-26 10:41:00,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:00" (1/1) ... [2021-03-26 10:41:00,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:00" (1/1) ... [2021-03-26 10:41:00,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:00" (1/1) ... [2021-03-26 10:41:00,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:00" (1/1) ... [2021-03-26 10:41:00,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:41:00,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:41:00,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:41:00,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:41:00,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:00" (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:41:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:41:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:41:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:41:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:41:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:41:00,967 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:41:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:41:00,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:41:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:41:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:41:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:41:00,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:41:00,969 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:41:02,387 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:41:02,388 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:41:02,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:41:02 BoogieIcfgContainer [2021-03-26 10:41:02,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:41:02,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:41:02,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:41:02,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:41:02,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:41:00" (1/3) ... [2021-03-26 10:41:02,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a6d5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:41:02, skipping insertion in model container [2021-03-26 10:41:02,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:41:00" (2/3) ... [2021-03-26 10:41:02,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a6d5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:41:02, skipping insertion in model container [2021-03-26 10:41:02,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:41:02" (3/3) ... [2021-03-26 10:41:02,397 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc.i [2021-03-26 10:41:02,406 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:41:02,410 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:41:02,411 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:41:02,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,437 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,437 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,438 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,438 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,438 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,438 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,438 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,439 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,442 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,442 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,442 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,442 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,447 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,447 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,447 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,449 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,449 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:41:02,451 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:41:02,466 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 10:41:02,483 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:41:02,483 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:41:02,483 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:41:02,483 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:41:02,483 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:41:02,483 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:41:02,483 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:41:02,483 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:41:02,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2021-03-26 10:41:02,516 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-26 10:41:02,516 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:41:02,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 10:41:02,518 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2021-03-26 10:41:02,522 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2021-03-26 10:41:02,523 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:02,534 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-26 10:41:02,537 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-26 10:41:02,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2021-03-26 10:41:02,549 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-26 10:41:02,550 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:41:02,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 10:41:02,552 INFO L142 LiptonReduction]: Number of co-enabled transitions 926 [2021-03-26 10:41:03,706 WARN L205 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-03-26 10:41:03,977 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-03-26 10:41:05,196 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-03-26 10:41:05,723 WARN L205 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-03-26 10:41:06,199 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:41:06,529 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:41:07,587 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 10:41:07,850 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 10:41:08,407 WARN L205 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 10:41:09,015 WARN L205 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 10:41:09,301 INFO L154 LiptonReduction]: Checked pairs total: 1628 [2021-03-26 10:41:09,301 INFO L156 LiptonReduction]: Total number of compositions: 55 [2021-03-26 10:41:09,303 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6781 [2021-03-26 10:41:09,309 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2021-03-26 10:41:09,309 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:41:09,309 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:09,310 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:09,310 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:09,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:09,313 INFO L82 PathProgramCache]: Analyzing trace with hash 730483881, now seen corresponding path program 1 times [2021-03-26 10:41:09,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:09,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254639524] [2021-03-26 10:41:09,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:09,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:09,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:09,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:09,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:09,465 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:41:09,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254639524] [2021-03-26 10:41:09,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:09,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:41:09,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427722391] [2021-03-26 10:41:09,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:41:09,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:09,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:41:09,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:41:09,481 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 134 [2021-03-26 10:41:09,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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:41:09,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:09,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 134 [2021-03-26 10:41:09,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:09,533 INFO L129 PetriNetUnfolder]: 23/89 cut-off events. [2021-03-26 10:41:09,533 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:41:09,548 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 89 events. 23/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 340 event pairs, 16 based on Foata normal form. 6/86 useless extension candidates. Maximal degree in co-relation 130. Up to 37 conditions per place. [2021-03-26 10:41:09,564 INFO L132 encePairwiseOnDemand]: 130/134 looper letters, 7 selfloop transitions, 2 changer transitions 5/30 dead transitions. [2021-03-26 10:41:09,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 88 flow [2021-03-26 10:41:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:41:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:41:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2021-03-26 10:41:09,574 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8706467661691543 [2021-03-26 10:41:09,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2021-03-26 10:41:09,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2021-03-26 10:41:09,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:09,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2021-03-26 10:41:09,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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:41:09,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:41:09,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:41:09,603 INFO L185 Difference]: Start difference. First operand has 35 places, 29 transitions, 64 flow. Second operand 3 states and 350 transitions. [2021-03-26 10:41:09,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 88 flow [2021-03-26 10:41:09,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:41:09,606 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 52 flow [2021-03-26 10:41:09,607 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-03-26 10:41:09,608 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2021-03-26 10:41:09,608 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:09,608 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 52 flow [2021-03-26 10:41:09,608 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 52 flow [2021-03-26 10:41:09,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 52 flow [2021-03-26 10:41:09,612 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 10:41:09,612 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:41:09,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:41:09,613 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-26 10:41:09,990 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:41:10,276 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:41:10,895 WARN L205 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:41:11,480 WARN L205 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:41:12,393 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-26 10:41:12,507 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-26 10:41:12,779 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-26 10:41:12,889 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-26 10:41:12,891 INFO L154 LiptonReduction]: Checked pairs total: 588 [2021-03-26 10:41:12,891 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 10:41:12,891 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3283 [2021-03-26 10:41:12,892 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2021-03-26 10:41:12,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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:41:12,893 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:12,893 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:12,893 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:41:12,893 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:12,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1358233529, now seen corresponding path program 1 times [2021-03-26 10:41:12,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:12,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038591777] [2021-03-26 10:41:12,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:13,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:13,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:13,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:13,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:13,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:13,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:41:13,068 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:41:13,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038591777] [2021-03-26 10:41:13,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:13,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:41:13,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663195047] [2021-03-26 10:41:13,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:41:13,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:13,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:41:13,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:41:13,076 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2021-03-26 10:41:13,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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:41:13,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:13,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2021-03-26 10:41:13,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:13,099 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-03-26 10:41:13,099 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:41:13,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 1 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 38. Up to 10 conditions per place. [2021-03-26 10:41:13,104 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 3 selfloop transitions, 3 changer transitions 0/18 dead transitions. [2021-03-26 10:41:13,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 18 transitions, 56 flow [2021-03-26 10:41:13,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:41:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:41:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2021-03-26 10:41:13,108 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8380952380952381 [2021-03-26 10:41:13,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2021-03-26 10:41:13,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2021-03-26 10:41:13,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:13,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2021-03-26 10:41:13,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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:41:13,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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:41:13,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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:41:13,110 INFO L185 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 3 states and 352 transitions. [2021-03-26 10:41:13,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 18 transitions, 56 flow [2021-03-26 10:41:13,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 18 transitions, 52 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:41:13,111 INFO L241 Difference]: Finished difference. Result has 24 places, 18 transitions, 55 flow [2021-03-26 10:41:13,111 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2021-03-26 10:41:13,112 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -11 predicate places. [2021-03-26 10:41:13,112 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:13,112 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 18 transitions, 55 flow [2021-03-26 10:41:13,112 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 55 flow [2021-03-26 10:41:13,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 55 flow [2021-03-26 10:41:13,130 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-03-26 10:41:13,130 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:41:13,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 39. Up to 10 conditions per place. [2021-03-26 10:41:13,130 INFO L142 LiptonReduction]: Number of co-enabled transitions 118 [2021-03-26 10:41:13,289 INFO L154 LiptonReduction]: Checked pairs total: 112 [2021-03-26 10:41:13,289 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:13,290 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 178 [2021-03-26 10:41:13,290 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2021-03-26 10:41:13,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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:41:13,291 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:13,291 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:13,291 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:41:13,291 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:13,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:13,291 INFO L82 PathProgramCache]: Analyzing trace with hash 211342155, now seen corresponding path program 1 times [2021-03-26 10:41:13,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:13,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100804047] [2021-03-26 10:41:13,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:13,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:13,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:41:13,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:13,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:41:13,402 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:41:13,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100804047] [2021-03-26 10:41:13,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:13,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:41:13,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278532072] [2021-03-26 10:41:13,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:41:13,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:13,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:41:13,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:41:13,404 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 140 [2021-03-26 10:41:13,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 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:41:13,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:13,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 140 [2021-03-26 10:41:13,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:13,457 INFO L129 PetriNetUnfolder]: 32/85 cut-off events. [2021-03-26 10:41:13,457 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-03-26 10:41:13,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 85 events. 32/85 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 293 event pairs, 6 based on Foata normal form. 4/88 useless extension candidates. Maximal degree in co-relation 166. Up to 55 conditions per place. [2021-03-26 10:41:13,458 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 8 selfloop transitions, 5 changer transitions 0/24 dead transitions. [2021-03-26 10:41:13,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 93 flow [2021-03-26 10:41:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:41:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:41:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2021-03-26 10:41:13,460 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7625 [2021-03-26 10:41:13,460 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 427 transitions. [2021-03-26 10:41:13,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 427 transitions. [2021-03-26 10:41:13,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:13,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 427 transitions. [2021-03-26 10:41:13,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 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:41:13,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 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:41:13,463 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 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:41:13,463 INFO L185 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 4 states and 427 transitions. [2021-03-26 10:41:13,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 93 flow [2021-03-26 10:41:13,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 90 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:41:13,464 INFO L241 Difference]: Finished difference. Result has 28 places, 22 transitions, 86 flow [2021-03-26 10:41:13,464 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2021-03-26 10:41:13,464 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -7 predicate places. [2021-03-26 10:41:13,464 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:13,464 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 22 transitions, 86 flow [2021-03-26 10:41:13,464 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 22 transitions, 86 flow [2021-03-26 10:41:13,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 22 transitions, 86 flow [2021-03-26 10:41:13,469 INFO L129 PetriNetUnfolder]: 8/39 cut-off events. [2021-03-26 10:41:13,469 INFO L130 PetriNetUnfolder]: For 19/21 co-relation queries the response was YES. [2021-03-26 10:41:13,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 39 events. 8/39 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 117 event pairs, 2 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 79. Up to 13 conditions per place. [2021-03-26 10:41:13,470 INFO L142 LiptonReduction]: Number of co-enabled transitions 134 [2021-03-26 10:41:13,492 INFO L154 LiptonReduction]: Checked pairs total: 60 [2021-03-26 10:41:13,493 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:13,493 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-03-26 10:41:13,493 INFO L480 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 86 flow [2021-03-26 10:41:13,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 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:41:13,494 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:13,494 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:13,494 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:41:13,494 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:13,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:13,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2012180085, now seen corresponding path program 1 times [2021-03-26 10:41:13,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:13,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425724160] [2021-03-26 10:41:13,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:13,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:13,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:41:13,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:13,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:13,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:13,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:41:13,585 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:41:13,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425724160] [2021-03-26 10:41:13,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:13,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:41:13,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045891763] [2021-03-26 10:41:13,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:41:13,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:13,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:41:13,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:41:13,587 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 140 [2021-03-26 10:41:13,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 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:41:13,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:13,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 140 [2021-03-26 10:41:13,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:13,639 INFO L129 PetriNetUnfolder]: 32/83 cut-off events. [2021-03-26 10:41:13,639 INFO L130 PetriNetUnfolder]: For 66/70 co-relation queries the response was YES. [2021-03-26 10:41:13,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 83 events. 32/83 cut-off events. For 66/70 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 272 event pairs, 13 based on Foata normal form. 3/83 useless extension candidates. Maximal degree in co-relation 216. Up to 50 conditions per place. [2021-03-26 10:41:13,640 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 10 selfloop transitions, 7 changer transitions 0/28 dead transitions. [2021-03-26 10:41:13,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 140 flow [2021-03-26 10:41:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:41:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:41:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2021-03-26 10:41:13,642 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7767857142857143 [2021-03-26 10:41:13,642 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 435 transitions. [2021-03-26 10:41:13,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 435 transitions. [2021-03-26 10:41:13,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:13,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 435 transitions. [2021-03-26 10:41:13,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 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:41:13,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 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:41:13,644 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 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:41:13,644 INFO L185 Difference]: Start difference. First operand has 28 places, 22 transitions, 86 flow. Second operand 4 states and 435 transitions. [2021-03-26 10:41:13,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 140 flow [2021-03-26 10:41:13,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:41:13,646 INFO L241 Difference]: Finished difference. Result has 32 places, 25 transitions, 118 flow [2021-03-26 10:41:13,646 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2021-03-26 10:41:13,646 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-03-26 10:41:13,646 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:13,646 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 118 flow [2021-03-26 10:41:13,646 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 118 flow [2021-03-26 10:41:13,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 118 flow [2021-03-26 10:41:13,654 INFO L129 PetriNetUnfolder]: 16/61 cut-off events. [2021-03-26 10:41:13,655 INFO L130 PetriNetUnfolder]: For 54/59 co-relation queries the response was YES. [2021-03-26 10:41:13,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 61 events. 16/61 cut-off events. For 54/59 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 217 event pairs, 7 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 154. Up to 25 conditions per place. [2021-03-26 10:41:13,655 INFO L142 LiptonReduction]: Number of co-enabled transitions 136 [2021-03-26 10:41:13,801 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:41:14,140 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-26 10:41:14,251 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 10:41:14,254 INFO L154 LiptonReduction]: Checked pairs total: 33 [2021-03-26 10:41:14,254 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:41:14,254 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 608 [2021-03-26 10:41:14,254 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 122 flow [2021-03-26 10:41:14,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 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:41:14,255 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:14,255 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:14,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:41:14,255 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:14,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:14,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2040094965, now seen corresponding path program 2 times [2021-03-26 10:41:14,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:14,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122181077] [2021-03-26 10:41:14,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:14,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:14,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:41:14,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:14,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:41:14,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:14,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 10:41:14,306 INFO L142 QuantifierPusher]: treesize reduction 4, result has 76.5 percent of original size [2021-03-26 10:41:14,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:41:14,313 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:41:14,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122181077] [2021-03-26 10:41:14,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:14,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:41:14,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146720733] [2021-03-26 10:41:14,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:41:14,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:14,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:41:14,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:41:14,315 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 141 [2021-03-26 10:41:14,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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:41:14,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:14,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 141 [2021-03-26 10:41:14,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:14,412 INFO L129 PetriNetUnfolder]: 118/217 cut-off events. [2021-03-26 10:41:14,412 INFO L130 PetriNetUnfolder]: For 208/215 co-relation queries the response was YES. [2021-03-26 10:41:14,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 217 events. 118/217 cut-off events. For 208/215 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 876 event pairs, 51 based on Foata normal form. 5/189 useless extension candidates. Maximal degree in co-relation 668. Up to 178 conditions per place. [2021-03-26 10:41:14,414 INFO L132 encePairwiseOnDemand]: 135/141 looper letters, 20 selfloop transitions, 8 changer transitions 1/36 dead transitions. [2021-03-26 10:41:14,414 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 212 flow [2021-03-26 10:41:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:41:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:41:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2021-03-26 10:41:14,416 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7063829787234043 [2021-03-26 10:41:14,416 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 498 transitions. [2021-03-26 10:41:14,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 498 transitions. [2021-03-26 10:41:14,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:14,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 498 transitions. [2021-03-26 10:41:14,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 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:41:14,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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:41:14,418 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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:41:14,418 INFO L185 Difference]: Start difference. First operand has 32 places, 25 transitions, 122 flow. Second operand 5 states and 498 transitions. [2021-03-26 10:41:14,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 212 flow [2021-03-26 10:41:14,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 203 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 10:41:14,420 INFO L241 Difference]: Finished difference. Result has 37 places, 27 transitions, 151 flow [2021-03-26 10:41:14,420 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2021-03-26 10:41:14,420 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2021-03-26 10:41:14,420 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:14,420 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 27 transitions, 151 flow [2021-03-26 10:41:14,420 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 151 flow [2021-03-26 10:41:14,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 151 flow [2021-03-26 10:41:14,473 INFO L129 PetriNetUnfolder]: 21/66 cut-off events. [2021-03-26 10:41:14,473 INFO L130 PetriNetUnfolder]: For 162/170 co-relation queries the response was YES. [2021-03-26 10:41:14,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 66 events. 21/66 cut-off events. For 162/170 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 230 event pairs, 9 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 205. Up to 25 conditions per place. [2021-03-26 10:41:14,474 INFO L142 LiptonReduction]: Number of co-enabled transitions 144 [2021-03-26 10:41:14,479 INFO L154 LiptonReduction]: Checked pairs total: 28 [2021-03-26 10:41:14,479 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:14,479 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-03-26 10:41:14,480 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 151 flow [2021-03-26 10:41:14,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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:41:14,480 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:14,480 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:14,481 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:41:14,481 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:14,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:14,481 INFO L82 PathProgramCache]: Analyzing trace with hash 646396046, now seen corresponding path program 1 times [2021-03-26 10:41:14,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:14,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786734633] [2021-03-26 10:41:14,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:14,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:14,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:14,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:14,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:14,521 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:41:14,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786734633] [2021-03-26 10:41:14,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:14,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:41:14,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136733665] [2021-03-26 10:41:14,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:41:14,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:14,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:41:14,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:41:14,525 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 141 [2021-03-26 10:41:14,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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:41:14,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:14,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 141 [2021-03-26 10:41:14,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:14,544 INFO L129 PetriNetUnfolder]: 22/90 cut-off events. [2021-03-26 10:41:14,545 INFO L130 PetriNetUnfolder]: For 536/558 co-relation queries the response was YES. [2021-03-26 10:41:14,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 90 events. 22/90 cut-off events. For 536/558 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 383 event pairs, 7 based on Foata normal form. 14/97 useless extension candidates. Maximal degree in co-relation 277. Up to 35 conditions per place. [2021-03-26 10:41:14,546 INFO L132 encePairwiseOnDemand]: 138/141 looper letters, 3 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2021-03-26 10:41:14,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 163 flow [2021-03-26 10:41:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:41:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:41:14,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2021-03-26 10:41:14,549 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8652482269503546 [2021-03-26 10:41:14,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2021-03-26 10:41:14,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2021-03-26 10:41:14,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:14,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2021-03-26 10:41:14,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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:41:14,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 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:41:14,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 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:41:14,550 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 151 flow. Second operand 3 states and 366 transitions. [2021-03-26 10:41:14,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 163 flow [2021-03-26 10:41:14,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 147 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:41:14,554 INFO L241 Difference]: Finished difference. Result has 37 places, 27 transitions, 146 flow [2021-03-26 10:41:14,554 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2021-03-26 10:41:14,554 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2021-03-26 10:41:14,554 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:14,554 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 27 transitions, 146 flow [2021-03-26 10:41:14,555 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 146 flow [2021-03-26 10:41:14,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 146 flow [2021-03-26 10:41:14,567 INFO L129 PetriNetUnfolder]: 19/85 cut-off events. [2021-03-26 10:41:14,567 INFO L130 PetriNetUnfolder]: For 309/323 co-relation queries the response was YES. [2021-03-26 10:41:14,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 85 events. 19/85 cut-off events. For 309/323 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 6 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 260. Up to 30 conditions per place. [2021-03-26 10:41:14,569 INFO L142 LiptonReduction]: Number of co-enabled transitions 144 [2021-03-26 10:41:14,571 INFO L154 LiptonReduction]: Checked pairs total: 18 [2021-03-26 10:41:14,571 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:14,571 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-26 10:41:14,573 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 146 flow [2021-03-26 10:41:14,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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:41:14,573 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:14,573 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:14,573 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:41:14,573 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:14,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:14,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1236313300, now seen corresponding path program 1 times [2021-03-26 10:41:14,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:14,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291507945] [2021-03-26 10:41:14,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:14,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:14,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:41:14,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:14,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:41:14,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:14,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:41:14,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:14,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:41:14,647 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:41:14,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291507945] [2021-03-26 10:41:14,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:14,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:41:14,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551184132] [2021-03-26 10:41:14,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:41:14,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:14,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:41:14,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:41:14,649 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 141 [2021-03-26 10:41:14,650 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 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:41:14,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:14,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 141 [2021-03-26 10:41:14,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:14,705 INFO L129 PetriNetUnfolder]: 43/120 cut-off events. [2021-03-26 10:41:14,706 INFO L130 PetriNetUnfolder]: For 336/348 co-relation queries the response was YES. [2021-03-26 10:41:14,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 120 events. 43/120 cut-off events. For 336/348 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 484 event pairs, 16 based on Foata normal form. 5/122 useless extension candidates. Maximal degree in co-relation 410. Up to 77 conditions per place. [2021-03-26 10:41:14,706 INFO L132 encePairwiseOnDemand]: 134/141 looper letters, 10 selfloop transitions, 10 changer transitions 0/32 dead transitions. [2021-03-26 10:41:14,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 206 flow [2021-03-26 10:41:14,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:41:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:41:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2021-03-26 10:41:14,708 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7546099290780142 [2021-03-26 10:41:14,708 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2021-03-26 10:41:14,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2021-03-26 10:41:14,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:14,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2021-03-26 10:41:14,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 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:41:14,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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:41:14,711 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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:41:14,711 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 146 flow. Second operand 5 states and 532 transitions. [2021-03-26 10:41:14,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 206 flow [2021-03-26 10:41:14,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 199 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 10:41:14,713 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 183 flow [2021-03-26 10:41:14,713 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2021-03-26 10:41:14,713 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2021-03-26 10:41:14,713 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:14,713 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 183 flow [2021-03-26 10:41:14,714 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 183 flow [2021-03-26 10:41:14,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 183 flow [2021-03-26 10:41:14,726 INFO L129 PetriNetUnfolder]: 36/114 cut-off events. [2021-03-26 10:41:14,726 INFO L130 PetriNetUnfolder]: For 277/297 co-relation queries the response was YES. [2021-03-26 10:41:14,726 INFO L84 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 114 events. 36/114 cut-off events. For 277/297 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 513 event pairs, 10 based on Foata normal form. 2/107 useless extension candidates. Maximal degree in co-relation 369. Up to 56 conditions per place. [2021-03-26 10:41:14,727 INFO L142 LiptonReduction]: Number of co-enabled transitions 152 [2021-03-26 10:41:14,728 INFO L154 LiptonReduction]: Checked pairs total: 30 [2021-03-26 10:41:14,728 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:14,728 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-26 10:41:14,729 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 183 flow [2021-03-26 10:41:14,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 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:41:14,729 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:14,730 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:14,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:41:14,730 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:14,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:14,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2032150570, now seen corresponding path program 2 times [2021-03-26 10:41:14,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:14,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72098545] [2021-03-26 10:41:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:14,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:14,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:41:14,787 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-26 10:41:14,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 10:41:14,803 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.6 percent of original size [2021-03-26 10:41:14,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-26 10:41:14,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:14,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:41:14,829 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:41:14,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72098545] [2021-03-26 10:41:14,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:14,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:41:14,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747184197] [2021-03-26 10:41:14,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:41:14,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:14,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:41:14,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:41:14,831 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 141 [2021-03-26 10:41:14,832 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 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:41:14,832 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:14,832 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 141 [2021-03-26 10:41:14,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:14,896 INFO L129 PetriNetUnfolder]: 45/139 cut-off events. [2021-03-26 10:41:14,896 INFO L130 PetriNetUnfolder]: For 413/421 co-relation queries the response was YES. [2021-03-26 10:41:14,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 139 events. 45/139 cut-off events. For 413/421 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 639 event pairs, 4 based on Foata normal form. 7/145 useless extension candidates. Maximal degree in co-relation 516. Up to 71 conditions per place. [2021-03-26 10:41:14,897 INFO L132 encePairwiseOnDemand]: 135/141 looper letters, 14 selfloop transitions, 9 changer transitions 0/35 dead transitions. [2021-03-26 10:41:14,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 259 flow [2021-03-26 10:41:14,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:41:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:41:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2021-03-26 10:41:14,899 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7304964539007093 [2021-03-26 10:41:14,899 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 515 transitions. [2021-03-26 10:41:14,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 515 transitions. [2021-03-26 10:41:14,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:14,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 515 transitions. [2021-03-26 10:41:14,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 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:41:14,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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:41:14,901 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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:41:14,901 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 183 flow. Second operand 5 states and 515 transitions. [2021-03-26 10:41:14,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 259 flow [2021-03-26 10:41:14,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 237 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-26 10:41:14,903 INFO L241 Difference]: Finished difference. Result has 43 places, 32 transitions, 201 flow [2021-03-26 10:41:14,903 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2021-03-26 10:41:14,903 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2021-03-26 10:41:14,903 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:14,903 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 201 flow [2021-03-26 10:41:14,904 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 201 flow [2021-03-26 10:41:14,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 201 flow [2021-03-26 10:41:14,914 INFO L129 PetriNetUnfolder]: 34/104 cut-off events. [2021-03-26 10:41:14,914 INFO L130 PetriNetUnfolder]: For 303/319 co-relation queries the response was YES. [2021-03-26 10:41:14,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 104 events. 34/104 cut-off events. For 303/319 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 428 event pairs, 10 based on Foata normal form. 2/97 useless extension candidates. Maximal degree in co-relation 382. Up to 52 conditions per place. [2021-03-26 10:41:14,915 INFO L142 LiptonReduction]: Number of co-enabled transitions 162 [2021-03-26 10:41:14,917 INFO L154 LiptonReduction]: Checked pairs total: 33 [2021-03-26 10:41:14,917 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:14,917 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-03-26 10:41:14,918 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 201 flow [2021-03-26 10:41:14,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 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:41:14,918 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:14,918 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:14,918 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:41:14,918 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:14,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:14,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1181550250, now seen corresponding path program 3 times [2021-03-26 10:41:14,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:14,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521048615] [2021-03-26 10:41:14,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:14,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:14,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:41:14,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:14,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:41:14,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:14,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:41:14,982 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-03-26 10:41:14,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 10:41:14,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:15,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:41:15,007 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:41:15,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521048615] [2021-03-26 10:41:15,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:15,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:41:15,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533636643] [2021-03-26 10:41:15,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:41:15,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:15,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:41:15,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:41:15,009 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 141 [2021-03-26 10:41:15,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 201 flow. Second operand has 7 states, 7 states have (on average 88.85714285714286) internal successors, (622), 7 states have internal predecessors, (622), 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:41:15,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:15,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 141 [2021-03-26 10:41:15,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:15,131 INFO L129 PetriNetUnfolder]: 188/360 cut-off events. [2021-03-26 10:41:15,131 INFO L130 PetriNetUnfolder]: For 928/938 co-relation queries the response was YES. [2021-03-26 10:41:15,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 360 events. 188/360 cut-off events. For 928/938 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1658 event pairs, 104 based on Foata normal form. 4/323 useless extension candidates. Maximal degree in co-relation 1376. Up to 315 conditions per place. [2021-03-26 10:41:15,133 INFO L132 encePairwiseOnDemand]: 133/141 looper letters, 20 selfloop transitions, 9 changer transitions 6/42 dead transitions. [2021-03-26 10:41:15,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 42 transitions, 313 flow [2021-03-26 10:41:15,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:41:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:41:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2021-03-26 10:41:15,135 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6652482269503546 [2021-03-26 10:41:15,135 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 469 transitions. [2021-03-26 10:41:15,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 469 transitions. [2021-03-26 10:41:15,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:15,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 469 transitions. [2021-03-26 10:41:15,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 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:41:15,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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:41:15,137 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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:41:15,137 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 201 flow. Second operand 5 states and 469 transitions. [2021-03-26 10:41:15,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 42 transitions, 313 flow [2021-03-26 10:41:15,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 42 transitions, 305 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:41:15,139 INFO L241 Difference]: Finished difference. Result has 46 places, 31 transitions, 222 flow [2021-03-26 10:41:15,139 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2021-03-26 10:41:15,139 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2021-03-26 10:41:15,139 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:15,140 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 31 transitions, 222 flow [2021-03-26 10:41:15,140 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 31 transitions, 222 flow [2021-03-26 10:41:15,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 31 transitions, 222 flow [2021-03-26 10:41:15,152 INFO L129 PetriNetUnfolder]: 31/103 cut-off events. [2021-03-26 10:41:15,152 INFO L130 PetriNetUnfolder]: For 421/436 co-relation queries the response was YES. [2021-03-26 10:41:15,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 103 events. 31/103 cut-off events. For 421/436 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 464 event pairs, 10 based on Foata normal form. 2/97 useless extension candidates. Maximal degree in co-relation 419. Up to 50 conditions per place. [2021-03-26 10:41:15,153 INFO L142 LiptonReduction]: Number of co-enabled transitions 118 [2021-03-26 10:41:15,162 INFO L154 LiptonReduction]: Checked pairs total: 42 [2021-03-26 10:41:15,162 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:15,162 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-26 10:41:15,162 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 222 flow [2021-03-26 10:41:15,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 88.85714285714286) internal successors, (622), 7 states have internal predecessors, (622), 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:41:15,163 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:15,163 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:15,163 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:41:15,163 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:15,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:15,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1245130010, now seen corresponding path program 1 times [2021-03-26 10:41:15,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:15,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021552393] [2021-03-26 10:41:15,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:15,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:15,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:41:15,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:15,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:41:15,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:15,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:41:15,239 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-03-26 10:41:15,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:41:15,247 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-03-26 10:41:15,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:41:15,248 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:41:15,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021552393] [2021-03-26 10:41:15,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:15,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:41:15,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423482162] [2021-03-26 10:41:15,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:41:15,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:15,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:41:15,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:41:15,250 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 141 [2021-03-26 10:41:15,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 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:41:15,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:15,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 141 [2021-03-26 10:41:15,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:15,337 INFO L129 PetriNetUnfolder]: 139/284 cut-off events. [2021-03-26 10:41:15,338 INFO L130 PetriNetUnfolder]: For 1103/1112 co-relation queries the response was YES. [2021-03-26 10:41:15,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 284 events. 139/284 cut-off events. For 1103/1112 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1251 event pairs, 28 based on Foata normal form. 8/291 useless extension candidates. Maximal degree in co-relation 1190. Up to 210 conditions per place. [2021-03-26 10:41:15,340 INFO L132 encePairwiseOnDemand]: 135/141 looper letters, 17 selfloop transitions, 10 changer transitions 9/43 dead transitions. [2021-03-26 10:41:15,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 371 flow [2021-03-26 10:41:15,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:41:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:41:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2021-03-26 10:41:15,341 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6638297872340425 [2021-03-26 10:41:15,341 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 468 transitions. [2021-03-26 10:41:15,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 468 transitions. [2021-03-26 10:41:15,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:15,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 468 transitions. [2021-03-26 10:41:15,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 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:41:15,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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:41:15,344 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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:41:15,344 INFO L185 Difference]: Start difference. First operand has 45 places, 31 transitions, 222 flow. Second operand 5 states and 468 transitions. [2021-03-26 10:41:15,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 371 flow [2021-03-26 10:41:15,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 352 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-26 10:41:15,348 INFO L241 Difference]: Finished difference. Result has 48 places, 30 transitions, 247 flow [2021-03-26 10:41:15,348 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2021-03-26 10:41:15,348 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2021-03-26 10:41:15,348 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:15,348 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 30 transitions, 247 flow [2021-03-26 10:41:15,349 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 30 transitions, 247 flow [2021-03-26 10:41:15,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 30 transitions, 247 flow [2021-03-26 10:41:15,359 INFO L129 PetriNetUnfolder]: 30/99 cut-off events. [2021-03-26 10:41:15,359 INFO L130 PetriNetUnfolder]: For 664/688 co-relation queries the response was YES. [2021-03-26 10:41:15,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 99 events. 30/99 cut-off events. For 664/688 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 441 event pairs, 11 based on Foata normal form. 2/91 useless extension candidates. Maximal degree in co-relation 491. Up to 57 conditions per place. [2021-03-26 10:41:15,360 INFO L142 LiptonReduction]: Number of co-enabled transitions 102 [2021-03-26 10:41:15,362 INFO L154 LiptonReduction]: Checked pairs total: 44 [2021-03-26 10:41:15,362 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:15,362 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-03-26 10:41:15,362 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 247 flow [2021-03-26 10:41:15,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 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:41:15,363 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:15,363 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:15,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:41:15,363 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:15,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:15,363 INFO L82 PathProgramCache]: Analyzing trace with hash -977381041, now seen corresponding path program 1 times [2021-03-26 10:41:15,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:15,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327706172] [2021-03-26 10:41:15,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:15,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:15,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:15,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:15,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:15,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:15,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:15,402 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:41:15,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327706172] [2021-03-26 10:41:15,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:15,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:41:15,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891860344] [2021-03-26 10:41:15,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:41:15,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:15,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:41:15,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:41:15,403 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2021-03-26 10:41:15,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:41:15,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:15,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2021-03-26 10:41:15,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:15,429 INFO L129 PetriNetUnfolder]: 31/109 cut-off events. [2021-03-26 10:41:15,429 INFO L130 PetriNetUnfolder]: For 546/569 co-relation queries the response was YES. [2021-03-26 10:41:15,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 109 events. 31/109 cut-off events. For 546/569 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 485 event pairs, 8 based on Foata normal form. 31/138 useless extension candidates. Maximal degree in co-relation 481. Up to 52 conditions per place. [2021-03-26 10:41:15,430 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 4 selfloop transitions, 5 changer transitions 3/32 dead transitions. [2021-03-26 10:41:15,430 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 32 transitions, 255 flow [2021-03-26 10:41:15,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:41:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:41:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2021-03-26 10:41:15,432 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8283687943262411 [2021-03-26 10:41:15,432 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions. [2021-03-26 10:41:15,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions. [2021-03-26 10:41:15,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:15,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions. [2021-03-26 10:41:15,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 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:41:15,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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:41:15,434 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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:41:15,434 INFO L185 Difference]: Start difference. First operand has 46 places, 30 transitions, 247 flow. Second operand 5 states and 584 transitions. [2021-03-26 10:41:15,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 32 transitions, 255 flow [2021-03-26 10:41:15,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 216 flow, removed 9 selfloop flow, removed 9 redundant places. [2021-03-26 10:41:15,437 INFO L241 Difference]: Finished difference. Result has 44 places, 29 transitions, 207 flow [2021-03-26 10:41:15,437 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2021-03-26 10:41:15,438 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2021-03-26 10:41:15,438 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:15,438 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 29 transitions, 207 flow [2021-03-26 10:41:15,438 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 29 transitions, 207 flow [2021-03-26 10:41:15,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 29 transitions, 207 flow [2021-03-26 10:41:15,447 INFO L129 PetriNetUnfolder]: 21/95 cut-off events. [2021-03-26 10:41:15,447 INFO L130 PetriNetUnfolder]: For 266/286 co-relation queries the response was YES. [2021-03-26 10:41:15,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 95 events. 21/95 cut-off events. For 266/286 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 445 event pairs, 6 based on Foata normal form. 9/101 useless extension candidates. Maximal degree in co-relation 395. Up to 46 conditions per place. [2021-03-26 10:41:15,448 INFO L142 LiptonReduction]: Number of co-enabled transitions 100 [2021-03-26 10:41:15,449 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:41:15,449 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:41:15,449 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-03-26 10:41:15,451 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 207 flow [2021-03-26 10:41:15,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:41:15,451 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:15,451 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:15,451 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:41:15,451 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:15,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:15,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1881564272, now seen corresponding path program 1 times [2021-03-26 10:41:15,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:15,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923316195] [2021-03-26 10:41:15,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:15,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:15,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:15,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:15,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:15,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:15,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:41:15,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:15,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:41:15,492 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:41:15,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923316195] [2021-03-26 10:41:15,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:15,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:41:15,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50409022] [2021-03-26 10:41:15,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:41:15,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:15,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:41:15,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:41:15,493 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2021-03-26 10:41:15,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 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:41:15,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:15,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2021-03-26 10:41:15,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:15,527 INFO L129 PetriNetUnfolder]: 11/67 cut-off events. [2021-03-26 10:41:15,527 INFO L130 PetriNetUnfolder]: For 251/335 co-relation queries the response was YES. [2021-03-26 10:41:15,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 67 events. 11/67 cut-off events. For 251/335 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 275 event pairs, 0 based on Foata normal form. 50/115 useless extension candidates. Maximal degree in co-relation 268. Up to 27 conditions per place. [2021-03-26 10:41:15,528 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 2 selfloop transitions, 8 changer transitions 7/32 dead transitions. [2021-03-26 10:41:15,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 32 transitions, 249 flow [2021-03-26 10:41:15,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:41:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:41:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 812 transitions. [2021-03-26 10:41:15,529 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8226950354609929 [2021-03-26 10:41:15,530 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 812 transitions. [2021-03-26 10:41:15,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 812 transitions. [2021-03-26 10:41:15,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:15,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 812 transitions. [2021-03-26 10:41:15,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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:41:15,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 141.0) internal successors, (1128), 8 states have internal predecessors, (1128), 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:41:15,533 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 141.0) internal successors, (1128), 8 states have internal predecessors, (1128), 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:41:15,533 INFO L185 Difference]: Start difference. First operand has 44 places, 29 transitions, 207 flow. Second operand 7 states and 812 transitions. [2021-03-26 10:41:15,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 32 transitions, 249 flow [2021-03-26 10:41:15,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 32 transitions, 220 flow, removed 13 selfloop flow, removed 1 redundant places. [2021-03-26 10:41:15,535 INFO L241 Difference]: Finished difference. Result has 52 places, 25 transitions, 182 flow [2021-03-26 10:41:15,535 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=52, PETRI_TRANSITIONS=25} [2021-03-26 10:41:15,535 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2021-03-26 10:41:15,535 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:15,535 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 25 transitions, 182 flow [2021-03-26 10:41:15,535 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 25 transitions, 182 flow [2021-03-26 10:41:15,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 25 transitions, 182 flow [2021-03-26 10:41:15,539 INFO L129 PetriNetUnfolder]: 4/32 cut-off events. [2021-03-26 10:41:15,539 INFO L130 PetriNetUnfolder]: For 67/73 co-relation queries the response was YES. [2021-03-26 10:41:15,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 32 events. 4/32 cut-off events. For 67/73 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 115. Up to 12 conditions per place. [2021-03-26 10:41:15,539 INFO L142 LiptonReduction]: Number of co-enabled transitions 66 [2021-03-26 10:41:16,122 WARN L205 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 178 [2021-03-26 10:41:16,332 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2021-03-26 10:41:17,488 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 333 DAG size of output: 254 [2021-03-26 10:41:17,960 WARN L205 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2021-03-26 10:41:18,367 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-26 10:41:18,613 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-26 10:41:19,072 WARN L205 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2021-03-26 10:41:19,530 WARN L205 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2021-03-26 10:41:19,603 INFO L154 LiptonReduction]: Checked pairs total: 54 [2021-03-26 10:41:19,603 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-26 10:41:19,603 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4068 [2021-03-26 10:41:19,604 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 19 transitions, 160 flow [2021-03-26 10:41:19,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 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:41:19,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:19,604 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:19,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:41:19,604 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:19,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:19,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1116086546, now seen corresponding path program 1 times [2021-03-26 10:41:19,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:19,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272539587] [2021-03-26 10:41:19,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:41:19,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:41:19,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:41:19,652 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.0 percent of original size [2021-03-26 10:41:19,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 10:41:19,670 INFO L142 QuantifierPusher]: treesize reduction 31, result has 74.2 percent of original size [2021-03-26 10:41:19,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2021-03-26 10:41:19,709 INFO L142 QuantifierPusher]: treesize reduction 31, result has 75.0 percent of original size [2021-03-26 10:41:19,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 93 [2021-03-26 10:41:19,747 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.4 percent of original size [2021-03-26 10:41:19,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-26 10:41:19,775 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.8 percent of original size [2021-03-26 10:41:19,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-03-26 10:41:19,805 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:41:19,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272539587] [2021-03-26 10:41:19,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:41:19,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:41:19,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007842404] [2021-03-26 10:41:19,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:41:19,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:41:19,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:41:19,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:41:19,807 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 146 [2021-03-26 10:41:19,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 19 transitions, 160 flow. Second operand has 8 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 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:41:19,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:41:19,808 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 146 [2021-03-26 10:41:19,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:41:19,872 INFO L129 PetriNetUnfolder]: 4/24 cut-off events. [2021-03-26 10:41:19,873 INFO L130 PetriNetUnfolder]: For 150/154 co-relation queries the response was YES. [2021-03-26 10:41:19,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 24 events. 4/24 cut-off events. For 150/154 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 5/29 useless extension candidates. Maximal degree in co-relation 110. Up to 13 conditions per place. [2021-03-26 10:41:19,873 INFO L132 encePairwiseOnDemand]: 141/146 looper letters, 4 selfloop transitions, 4 changer transitions 3/18 dead transitions. [2021-03-26 10:41:19,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 18 transitions, 173 flow [2021-03-26 10:41:19,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:41:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:41:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 580 transitions. [2021-03-26 10:41:19,875 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6621004566210046 [2021-03-26 10:41:19,875 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 580 transitions. [2021-03-26 10:41:19,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 580 transitions. [2021-03-26 10:41:19,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:41:19,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 580 transitions. [2021-03-26 10:41:19,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 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:41:19,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 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:41:19,877 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 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:41:19,877 INFO L185 Difference]: Start difference. First operand has 45 places, 19 transitions, 160 flow. Second operand 6 states and 580 transitions. [2021-03-26 10:41:19,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 18 transitions, 173 flow [2021-03-26 10:41:19,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 18 transitions, 130 flow, removed 11 selfloop flow, removed 12 redundant places. [2021-03-26 10:41:19,879 INFO L241 Difference]: Finished difference. Result has 35 places, 15 transitions, 98 flow [2021-03-26 10:41:19,879 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=35, PETRI_TRANSITIONS=15} [2021-03-26 10:41:19,879 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2021-03-26 10:41:19,879 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:41:19,879 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 15 transitions, 98 flow [2021-03-26 10:41:19,879 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 15 transitions, 98 flow [2021-03-26 10:41:19,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 15 transitions, 98 flow [2021-03-26 10:41:19,881 INFO L129 PetriNetUnfolder]: 3/17 cut-off events. [2021-03-26 10:41:19,882 INFO L130 PetriNetUnfolder]: For 27/28 co-relation queries the response was YES. [2021-03-26 10:41:19,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 17 events. 3/17 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 53. Up to 9 conditions per place. [2021-03-26 10:41:19,882 INFO L142 LiptonReduction]: Number of co-enabled transitions 6 [2021-03-26 10:41:20,073 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-26 10:41:20,473 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2021-03-26 10:41:20,589 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 10:41:20,590 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:41:20,590 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:41:20,590 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 711 [2021-03-26 10:41:20,591 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 15 transitions, 102 flow [2021-03-26 10:41:20,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 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:41:20,591 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:41:20,591 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:41:20,591 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:41:20,591 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:41:20,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:41:20,592 INFO L82 PathProgramCache]: Analyzing trace with hash -517431531, now seen corresponding path program 1 times [2021-03-26 10:41:20,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:41:20,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439441905] [2021-03-26 10:41:20,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:41:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:41:20,609 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:41:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:41:20,626 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:41:20,652 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:41:20,652 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:41:20,652 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:41:20,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:41:20 BasicIcfg [2021-03-26 10:41:20,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:41:20,707 INFO L168 Benchmark]: Toolchain (without parser) took 20332.22 ms. Allocated memory was 358.6 MB in the beginning and 765.5 MB in the end (delta: 406.8 MB). Free memory was 321.4 MB in the beginning and 678.1 MB in the end (delta: -356.7 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:20,707 INFO L168 Benchmark]: CDTParser took 0.63 ms. Allocated memory is still 358.6 MB. Free memory is still 339.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:41:20,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.68 ms. Allocated memory is still 358.6 MB. Free memory was 321.2 MB in the beginning and 318.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:20,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.77 ms. Allocated memory is still 358.6 MB. Free memory was 318.6 MB in the beginning and 315.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:20,708 INFO L168 Benchmark]: Boogie Preprocessor took 55.82 ms. Allocated memory is still 358.6 MB. Free memory was 315.5 MB in the beginning and 313.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:20,708 INFO L168 Benchmark]: RCFGBuilder took 1492.11 ms. Allocated memory is still 358.6 MB. Free memory was 313.0 MB in the beginning and 293.5 MB in the end (delta: 19.5 MB). Peak memory consumption was 163.5 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:20,708 INFO L168 Benchmark]: TraceAbstraction took 18314.62 ms. Allocated memory was 358.6 MB in the beginning and 765.5 MB in the end (delta: 406.8 MB). Free memory was 292.4 MB in the beginning and 678.1 MB in the end (delta: -385.6 MB). Peak memory consumption was 20.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:41:20,709 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.63 ms. Allocated memory is still 358.6 MB. Free memory is still 339.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 395.68 ms. Allocated memory is still 358.6 MB. Free memory was 321.2 MB in the beginning and 318.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 68.77 ms. Allocated memory is still 358.6 MB. Free memory was 318.6 MB in the beginning and 315.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 55.82 ms. Allocated memory is still 358.6 MB. Free memory was 315.5 MB in the beginning and 313.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1492.11 ms. Allocated memory is still 358.6 MB. Free memory was 313.0 MB in the beginning and 293.5 MB in the end (delta: 19.5 MB). Peak memory consumption was 163.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18314.62 ms. Allocated memory was 358.6 MB in the beginning and 765.5 MB in the end (delta: 406.8 MB). Free memory was 292.4 MB in the beginning and 678.1 MB in the end (delta: -385.6 MB). Peak memory consumption was 20.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6764.8ms, 82 PlacesBefore, 35 PlacesAfterwards, 77 TransitionsBefore, 29 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 55 TotalNumberOfCompositions, 1628 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 855, positive: 790, positive conditional: 790, positive unconditional: 0, negative: 65, negative conditional: 65, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 855, positive: 790, positive conditional: 0, positive unconditional: 790, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 855, positive: 790, positive conditional: 0, positive unconditional: 790, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 669, positive: 636, positive conditional: 0, positive unconditional: 636, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 669, positive: 634, positive conditional: 0, positive unconditional: 634, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 604, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 600, negative conditional: 0, negative unconditional: 600, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 855, positive: 154, positive conditional: 0, positive unconditional: 154, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 669, unknown conditional: 0, unknown unconditional: 669] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 636, Positive conditional cache size: 0, Positive unconditional cache size: 636, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3282.8ms, 33 PlacesBefore, 23 PlacesAfterwards, 22 TransitionsBefore, 16 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 4 FixpointIterations, 5 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 588 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, positive: 118, positive conditional: 118, positive unconditional: 0, negative: 65, negative conditional: 65, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 183, positive: 118, positive conditional: 13, positive unconditional: 105, negative: 65, negative conditional: 4, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 183, positive: 118, positive conditional: 13, positive unconditional: 105, negative: 65, negative conditional: 4, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 53, positive: 38, positive conditional: 4, positive unconditional: 34, negative: 15, negative conditional: 2, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 53, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 2, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 212, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 212, negative conditional: 41, negative unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 183, positive: 80, positive conditional: 9, positive unconditional: 71, negative: 50, negative conditional: 2, negative unconditional: 48, unknown: 53, unknown conditional: 6, unknown unconditional: 47] , Statistics on independence cache: Total cache size (in pairs): 722, Positive cache size: 674, Positive conditional cache size: 4, Positive unconditional cache size: 670, Negative cache size: 48, Negative conditional cache size: 2, Negative unconditional cache size: 46, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 177.2ms, 24 PlacesBefore, 24 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 112 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 10, positive conditional: 10, 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: 22, positive: 10, positive conditional: 0, positive unconditional: 10, 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: 22, positive: 10, positive conditional: 0, positive unconditional: 10, 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: 12, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 157, negative conditional: 0, negative unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 734, Positive cache size: 679, Positive conditional cache size: 4, Positive unconditional cache size: 675, Negative cache size: 55, Negative conditional cache size: 2, Negative unconditional cache size: 53, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.1ms, 28 PlacesBefore, 28 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 60 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 5, positive conditional: 5, 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: 11, positive: 5, positive conditional: 1, positive unconditional: 4, negative: 6, negative conditional: 1, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 5, positive conditional: 1, positive unconditional: 4, negative: 6, negative conditional: 1, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 736, Positive cache size: 680, Positive conditional cache size: 4, Positive unconditional cache size: 676, Negative cache size: 56, Negative conditional cache size: 3, Negative unconditional cache size: 53, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 607.5ms, 32 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 33 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, positive: 14, positive conditional: 6, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 14, positive conditional: 6, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, 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: 16, positive: 14, positive conditional: 6, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 736, Positive cache size: 680, Positive conditional cache size: 4, Positive unconditional cache size: 676, Negative cache size: 56, Negative conditional cache size: 3, Negative unconditional cache size: 53, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 59.0ms, 37 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 28 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, positive: 11, positive conditional: 6, positive unconditional: 5, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 6, positive unconditional: 5, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, positive: 10, positive conditional: 5, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 738, Positive cache size: 681, Positive conditional cache size: 5, Positive unconditional cache size: 676, Negative cache size: 57, Negative conditional cache size: 4, Negative unconditional cache size: 53, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.2ms, 37 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 18 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, positive: 9, positive conditional: 3, positive unconditional: 6, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 3, positive unconditional: 6, negative: 1, negative conditional: 1, negative unconditional: 0, 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: 10, positive: 9, positive conditional: 3, positive unconditional: 6, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 738, Positive cache size: 681, Positive conditional cache size: 5, Positive unconditional cache size: 676, Negative cache size: 57, Negative conditional cache size: 4, Negative unconditional cache size: 53, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.7ms, 41 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 30 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, positive: 11, positive conditional: 6, positive unconditional: 5, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 6, positive unconditional: 5, negative: 2, negative conditional: 1, negative unconditional: 1, 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: 13, positive: 11, positive conditional: 6, positive unconditional: 5, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 738, Positive cache size: 681, Positive conditional cache size: 5, Positive unconditional cache size: 676, Negative cache size: 57, Negative conditional cache size: 4, Negative unconditional cache size: 53, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.5ms, 43 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 33 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, positive: 15, positive conditional: 9, positive unconditional: 6, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 9, positive unconditional: 6, negative: 2, negative conditional: 1, negative unconditional: 1, 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: 17, positive: 15, positive conditional: 9, positive unconditional: 6, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 738, Positive cache size: 681, Positive conditional cache size: 5, Positive unconditional cache size: 676, Negative cache size: 57, Negative conditional cache size: 4, Negative unconditional cache size: 53, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.1ms, 46 PlacesBefore, 45 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 42 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 739, Positive cache size: 681, Positive conditional cache size: 5, Positive unconditional cache size: 676, Negative cache size: 58, Negative conditional cache size: 5, Negative unconditional cache size: 53, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.2ms, 48 PlacesBefore, 46 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 44 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, positive: 20, positive conditional: 6, positive unconditional: 14, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 20, positive conditional: 6, positive unconditional: 14, negative: 4, negative conditional: 0, negative unconditional: 4, 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: 24, positive: 20, positive conditional: 6, positive unconditional: 14, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 739, Positive cache size: 681, Positive conditional cache size: 5, Positive unconditional cache size: 676, Negative cache size: 58, Negative conditional cache size: 5, Negative unconditional cache size: 53, Eliminated conditions: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.8ms, 44 PlacesBefore, 44 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 739, Positive cache size: 681, Positive conditional cache size: 5, Positive unconditional cache size: 676, Negative cache size: 58, Negative conditional cache size: 5, Negative unconditional cache size: 53, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4067.9ms, 52 PlacesBefore, 45 PlacesAfterwards, 25 TransitionsBefore, 19 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 54 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 27, positive conditional: 27, 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: 51, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 24, negative conditional: 18, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 24, negative conditional: 18, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 4, negative conditional: 3, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 3, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 69, negative conditional: 60, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 20, negative conditional: 15, negative unconditional: 5, unknown: 12, unknown conditional: 11, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 751, Positive cache size: 689, Positive conditional cache size: 13, Positive unconditional cache size: 676, Negative cache size: 62, Negative conditional cache size: 8, Negative unconditional cache size: 54, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 711.1ms, 35 PlacesBefore, 34 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 751, Positive cache size: 689, Positive conditional cache size: 13, Positive unconditional cache size: 676, Negative cache size: 62, Negative conditional cache size: 8, Negative unconditional cache size: 54, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2481; [L791] FCALL, FORK 0 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2482; [L793] FCALL, FORK 0 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18172.9ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 947.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6823.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 59 SDtfs, 36 SDslu, 41 SDs, 0 SdLazy, 369 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 343.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 390.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=10, InterpolantAutomatonStates: 60, 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: 29.1ms SsaConstructionTime, 272.7ms SatisfiabilityAnalysisTime, 862.1ms InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 1082 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...