/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:15:28,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:15:28,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:15:28,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:15:28,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:15:28,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:15:28,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:15:28,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:15:28,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:15:28,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:15:28,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:15:28,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:15:28,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:15:28,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:15:28,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:15:28,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:15:28,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:15:28,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:15:28,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:15:28,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:15:28,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:15:28,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:15:28,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:15:28,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:15:28,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:15:28,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:15:28,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:15:28,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:15:28,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:15:28,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:15:28,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:15:28,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:15:28,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:15:28,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:15:28,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:15:28,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:15:28,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:15:28,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:15:28,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:15:28,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:15:28,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:15:28,799 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:15:28,834 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:15:28,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:15:28,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:15:28,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:15:28,838 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:15:28,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:15:28,838 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:15:28,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:15:28,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:15:28,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:15:28,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:15:28,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:15:28,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:15:28,840 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:15:28,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:15:28,841 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:15:28,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:15:28,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:15:28,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:15:28,841 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:15:28,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:15:28,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:15:28,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:15:28,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:15:28,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:15:28,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:15:28,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:15:28,843 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:15:28,843 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:15:28,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:15:28,843 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 00:15:29,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:15:29,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:15:29,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:15:29,195 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:15:29,199 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:15:29,200 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.oepc.i [2021-03-26 00:15:29,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24c456f87/397177a26dfe4fd6b1b9048acb9a65d0/FLAGcd56faf81 [2021-03-26 00:15:29,779 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:15:29,779 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_rmo.oepc.i [2021-03-26 00:15:29,791 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24c456f87/397177a26dfe4fd6b1b9048acb9a65d0/FLAGcd56faf81 [2021-03-26 00:15:30,113 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24c456f87/397177a26dfe4fd6b1b9048acb9a65d0 [2021-03-26 00:15:30,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:15:30,116 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:15:30,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:15:30,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:15:30,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:15:30,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:15:30" (1/1) ... [2021-03-26 00:15:30,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b483d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:30, skipping insertion in model container [2021-03-26 00:15:30,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:15:30" (1/1) ... [2021-03-26 00:15:30,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:15:30,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:15:30,398 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/mix035_rmo.oepc.i[949,962] [2021-03-26 00:15:30,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:15:30,613 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:15:30,627 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/mix035_rmo.oepc.i[949,962] [2021-03-26 00:15:30,686 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:15:30,744 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:15:30,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:30 WrapperNode [2021-03-26 00:15:30,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:15:30,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:15:30,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:15:30,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:15:30,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:30" (1/1) ... [2021-03-26 00:15:30,766 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:30" (1/1) ... [2021-03-26 00:15:30,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:15:30,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:15:30,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:15:30,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:15:30,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:30" (1/1) ... [2021-03-26 00:15:30,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:30" (1/1) ... [2021-03-26 00:15:30,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:30" (1/1) ... [2021-03-26 00:15:30,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:30" (1/1) ... [2021-03-26 00:15:30,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:30" (1/1) ... [2021-03-26 00:15:30,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:30" (1/1) ... [2021-03-26 00:15:30,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:30" (1/1) ... [2021-03-26 00:15:30,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:15:30,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:15:30,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:15:30,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:15:30,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:30" (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 00:15:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:15:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:15:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:15:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:15:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:15:30,928 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:15:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:15:30,928 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:15:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:15:30,928 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:15:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:15:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:15:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:15:30,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:15:30,930 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 00:15:32,677 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:15:32,677 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:15:32,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:15:32 BoogieIcfgContainer [2021-03-26 00:15:32,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:15:32,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:15:32,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:15:32,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:15:32,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:15:30" (1/3) ... [2021-03-26 00:15:32,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13cffa7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:15:32, skipping insertion in model container [2021-03-26 00:15:32,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:30" (2/3) ... [2021-03-26 00:15:32,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13cffa7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:15:32, skipping insertion in model container [2021-03-26 00:15:32,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:15:32" (3/3) ... [2021-03-26 00:15:32,687 INFO L111 eAbstractionObserver]: Analyzing ICFG mix035_rmo.oepc.i [2021-03-26 00:15:32,693 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:15:32,697 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:15:32,697 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:15:32,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,735 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,735 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,735 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,735 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,736 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,736 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,736 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,736 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,740 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,741 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,741 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,741 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,741 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,742 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,744 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,746 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,746 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,747 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,747 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,749 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,749 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,749 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,749 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,749 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,749 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,749 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,749 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,773 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,775 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,776 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,776 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,778 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,778 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,778 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,779 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,779 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,781 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,781 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,782 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:32,786 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:15:32,802 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:15:32,824 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:15:32,824 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:15:32,824 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:15:32,824 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:15:32,825 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:15:32,825 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:15:32,825 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:15:32,825 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:15:32,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 221 flow [2021-03-26 00:15:32,865 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-03-26 00:15:32,866 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:32,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-26 00:15:32,869 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 103 transitions, 221 flow [2021-03-26 00:15:32,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 100 transitions, 209 flow [2021-03-26 00:15:32,875 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:32,885 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 209 flow [2021-03-26 00:15:32,887 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 209 flow [2021-03-26 00:15:32,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 209 flow [2021-03-26 00:15:32,904 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-03-26 00:15:32,905 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:32,905 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-26 00:15:32,908 INFO L142 LiptonReduction]: Number of co-enabled transitions 1862 [2021-03-26 00:15:34,186 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:15:34,602 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:15:34,714 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:15:35,999 INFO L154 LiptonReduction]: Checked pairs total: 3253 [2021-03-26 00:15:35,999 INFO L156 LiptonReduction]: Total number of compositions: 70 [2021-03-26 00:15:36,002 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3127 [2021-03-26 00:15:36,011 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 00:15:36,011 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:36,011 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:36,012 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:36,012 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:36,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:36,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1601348935, now seen corresponding path program 1 times [2021-03-26 00:15:36,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:36,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922556724] [2021-03-26 00:15:36,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:36,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:36,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:36,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:36,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:36,238 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 00:15:36,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922556724] [2021-03-26 00:15:36,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:36,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:15:36,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176533315] [2021-03-26 00:15:36,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:15:36,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:36,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:15:36,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:15:36,259 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 173 [2021-03-26 00:15:36,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:36,263 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:36,263 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 173 [2021-03-26 00:15:36,264 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:36,380 INFO L129 PetriNetUnfolder]: 49/171 cut-off events. [2021-03-26 00:15:36,380 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:36,382 INFO L84 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 171 events. 49/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 786 event pairs, 38 based on Foata normal form. 17/174 useless extension candidates. Maximal degree in co-relation 247. Up to 65 conditions per place. [2021-03-26 00:15:36,385 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 9 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2021-03-26 00:15:36,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 113 flow [2021-03-26 00:15:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:15:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:15:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2021-03-26 00:15:36,402 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.905587668593449 [2021-03-26 00:15:36,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2021-03-26 00:15:36,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2021-03-26 00:15:36,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:36,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2021-03-26 00:15:36,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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 00:15:36,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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 00:15:36,422 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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 00:15:36,424 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 470 transitions. [2021-03-26 00:15:36,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 113 flow [2021-03-26 00:15:36,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 110 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:15:36,429 INFO L241 Difference]: Finished difference. Result has 46 places, 37 transitions, 84 flow [2021-03-26 00:15:36,430 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2021-03-26 00:15:36,431 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2021-03-26 00:15:36,431 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:36,431 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 84 flow [2021-03-26 00:15:36,432 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 84 flow [2021-03-26 00:15:36,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 84 flow [2021-03-26 00:15:36,443 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-26 00:15:36,443 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:36,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:15:36,444 INFO L142 LiptonReduction]: Number of co-enabled transitions 368 [2021-03-26 00:15:37,668 INFO L154 LiptonReduction]: Checked pairs total: 1624 [2021-03-26 00:15:37,668 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 00:15:37,668 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1237 [2021-03-26 00:15:37,670 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 62 flow [2021-03-26 00:15:37,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:37,670 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:37,671 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:37,671 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:15:37,671 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:37,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:37,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2115622323, now seen corresponding path program 1 times [2021-03-26 00:15:37,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:37,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379147501] [2021-03-26 00:15:37,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:37,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:37,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:37,790 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:15:37,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:15:37,800 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:15:37,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:15:37,852 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 00:15:37,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379147501] [2021-03-26 00:15:37,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:37,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:15:37,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913444732] [2021-03-26 00:15:37,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:15:37,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:37,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:15:37,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:15:37,857 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 184 [2021-03-26 00:15:37,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 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 00:15:37,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:37,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 184 [2021-03-26 00:15:37,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:37,923 INFO L129 PetriNetUnfolder]: 52/149 cut-off events. [2021-03-26 00:15:37,924 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:37,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 149 events. 52/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 674 event pairs, 14 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 247. Up to 49 conditions per place. [2021-03-26 00:15:37,925 INFO L132 encePairwiseOnDemand]: 177/184 looper letters, 5 selfloop transitions, 4 changer transitions 10/38 dead transitions. [2021-03-26 00:15:37,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 124 flow [2021-03-26 00:15:37,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:15:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:15:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 765 transitions. [2021-03-26 00:15:37,928 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8315217391304348 [2021-03-26 00:15:37,928 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 765 transitions. [2021-03-26 00:15:37,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 765 transitions. [2021-03-26 00:15:37,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:37,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 765 transitions. [2021-03-26 00:15:37,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 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 00:15:37,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 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 00:15:37,936 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 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 00:15:37,936 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 62 flow. Second operand 5 states and 765 transitions. [2021-03-26 00:15:37,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 124 flow [2021-03-26 00:15:37,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:15:37,937 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 90 flow [2021-03-26 00:15:37,938 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2021-03-26 00:15:37,938 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2021-03-26 00:15:37,938 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:37,938 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 28 transitions, 90 flow [2021-03-26 00:15:37,939 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 90 flow [2021-03-26 00:15:37,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 90 flow [2021-03-26 00:15:37,952 INFO L129 PetriNetUnfolder]: 24/93 cut-off events. [2021-03-26 00:15:37,952 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-03-26 00:15:37,952 INFO L84 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 93 events. 24/93 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 350 event pairs, 16 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 167. Up to 39 conditions per place. [2021-03-26 00:15:37,954 INFO L142 LiptonReduction]: Number of co-enabled transitions 286 [2021-03-26 00:15:38,789 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 00:15:38,932 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:15:39,259 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 00:15:39,441 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:15:39,446 INFO L154 LiptonReduction]: Checked pairs total: 582 [2021-03-26 00:15:39,446 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:15:39,446 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1508 [2021-03-26 00:15:39,447 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 86 flow [2021-03-26 00:15:39,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 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 00:15:39,448 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:39,448 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:39,448 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:15:39,448 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:39,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:39,449 INFO L82 PathProgramCache]: Analyzing trace with hash -299055933, now seen corresponding path program 1 times [2021-03-26 00:15:39,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:39,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473266498] [2021-03-26 00:15:39,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:39,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:39,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:39,531 INFO L142 QuantifierPusher]: treesize reduction 16, result has 51.5 percent of original size [2021-03-26 00:15:39,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:15:39,539 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 00:15:39,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473266498] [2021-03-26 00:15:39,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:39,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:15:39,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980658492] [2021-03-26 00:15:39,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:15:39,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:39,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:15:39,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:15:39,542 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 186 [2021-03-26 00:15:39,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 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 00:15:39,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:39,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 186 [2021-03-26 00:15:39,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:39,564 INFO L129 PetriNetUnfolder]: 21/66 cut-off events. [2021-03-26 00:15:39,564 INFO L130 PetriNetUnfolder]: For 41/65 co-relation queries the response was YES. [2021-03-26 00:15:39,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 66 events. 21/66 cut-off events. For 41/65 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 218 event pairs, 4 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 172. Up to 37 conditions per place. [2021-03-26 00:15:39,565 INFO L132 encePairwiseOnDemand]: 183/186 looper letters, 8 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-03-26 00:15:39,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 28 transitions, 120 flow [2021-03-26 00:15:39,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:15:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:15:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2021-03-26 00:15:39,567 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8440860215053764 [2021-03-26 00:15:39,567 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2021-03-26 00:15:39,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2021-03-26 00:15:39,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:39,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2021-03-26 00:15:39,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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 00:15:39,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:39,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:39,571 INFO L185 Difference]: Start difference. First operand has 34 places, 26 transitions, 86 flow. Second operand 3 states and 471 transitions. [2021-03-26 00:15:39,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 28 transitions, 120 flow [2021-03-26 00:15:39,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:15:39,572 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 93 flow [2021-03-26 00:15:39,572 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2021-03-26 00:15:39,572 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -13 predicate places. [2021-03-26 00:15:39,572 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:39,573 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 93 flow [2021-03-26 00:15:39,573 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 93 flow [2021-03-26 00:15:39,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 93 flow [2021-03-26 00:15:39,581 INFO L129 PetriNetUnfolder]: 18/70 cut-off events. [2021-03-26 00:15:39,581 INFO L130 PetriNetUnfolder]: For 27/30 co-relation queries the response was YES. [2021-03-26 00:15:39,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 70 events. 18/70 cut-off events. For 27/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 217 event pairs, 5 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 144. Up to 32 conditions per place. [2021-03-26 00:15:39,582 INFO L142 LiptonReduction]: Number of co-enabled transitions 284 [2021-03-26 00:15:39,612 INFO L154 LiptonReduction]: Checked pairs total: 216 [2021-03-26 00:15:39,612 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:15:39,612 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-03-26 00:15:39,618 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 93 flow [2021-03-26 00:15:39,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 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 00:15:39,618 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:39,618 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:39,618 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:15:39,618 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:39,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:39,619 INFO L82 PathProgramCache]: Analyzing trace with hash 681114295, now seen corresponding path program 1 times [2021-03-26 00:15:39,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:39,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443573212] [2021-03-26 00:15:39,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:39,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:39,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:39,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:39,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:39,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:39,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:39,703 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 00:15:39,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443573212] [2021-03-26 00:15:39,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:39,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:15:39,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969430968] [2021-03-26 00:15:39,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:15:39,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:39,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:15:39,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:15:39,705 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 186 [2021-03-26 00:15:39,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 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 00:15:39,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:39,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 186 [2021-03-26 00:15:39,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:39,752 INFO L129 PetriNetUnfolder]: 88/213 cut-off events. [2021-03-26 00:15:39,752 INFO L130 PetriNetUnfolder]: For 39/42 co-relation queries the response was YES. [2021-03-26 00:15:39,753 INFO L84 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 213 events. 88/213 cut-off events. For 39/42 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1057 event pairs, 25 based on Foata normal form. 16/190 useless extension candidates. Maximal degree in co-relation 452. Up to 126 conditions per place. [2021-03-26 00:15:39,754 INFO L132 encePairwiseOnDemand]: 180/186 looper letters, 10 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2021-03-26 00:15:39,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 151 flow [2021-03-26 00:15:39,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:15:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:15:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 790 transitions. [2021-03-26 00:15:39,757 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8494623655913979 [2021-03-26 00:15:39,757 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 790 transitions. [2021-03-26 00:15:39,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 790 transitions. [2021-03-26 00:15:39,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:39,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 790 transitions. [2021-03-26 00:15:39,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 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 00:15:39,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 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 00:15:39,761 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 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 00:15:39,761 INFO L185 Difference]: Start difference. First operand has 36 places, 26 transitions, 93 flow. Second operand 5 states and 790 transitions. [2021-03-26 00:15:39,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 151 flow [2021-03-26 00:15:39,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:15:39,763 INFO L241 Difference]: Finished difference. Result has 41 places, 33 transitions, 147 flow [2021-03-26 00:15:39,763 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2021-03-26 00:15:39,764 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -8 predicate places. [2021-03-26 00:15:39,764 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:39,764 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 147 flow [2021-03-26 00:15:39,764 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 147 flow [2021-03-26 00:15:39,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 147 flow [2021-03-26 00:15:39,780 INFO L129 PetriNetUnfolder]: 71/182 cut-off events. [2021-03-26 00:15:39,781 INFO L130 PetriNetUnfolder]: For 119/144 co-relation queries the response was YES. [2021-03-26 00:15:39,781 INFO L84 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 182 events. 71/182 cut-off events. For 119/144 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 935 event pairs, 29 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 485. Up to 90 conditions per place. [2021-03-26 00:15:39,783 INFO L142 LiptonReduction]: Number of co-enabled transitions 374 [2021-03-26 00:15:39,816 INFO L154 LiptonReduction]: Checked pairs total: 489 [2021-03-26 00:15:39,816 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:15:39,816 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 52 [2021-03-26 00:15:39,817 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 141 flow [2021-03-26 00:15:39,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 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 00:15:39,817 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:39,818 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:39,818 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:15:39,818 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:39,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:39,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1549699547, now seen corresponding path program 1 times [2021-03-26 00:15:39,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:39,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691547159] [2021-03-26 00:15:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:39,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:39,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:39,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:39,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:39,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:39,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:39,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:39,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:39,950 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 00:15:39,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691547159] [2021-03-26 00:15:39,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:39,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:15:39,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764155449] [2021-03-26 00:15:39,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:15:39,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:39,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:15:39,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:15:39,952 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 186 [2021-03-26 00:15:39,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 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 00:15:39,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:39,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 186 [2021-03-26 00:15:39,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:40,015 INFO L129 PetriNetUnfolder]: 56/149 cut-off events. [2021-03-26 00:15:40,015 INFO L130 PetriNetUnfolder]: For 135/207 co-relation queries the response was YES. [2021-03-26 00:15:40,016 INFO L84 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 149 events. 56/149 cut-off events. For 135/207 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 616 event pairs, 5 based on Foata normal form. 29/165 useless extension candidates. Maximal degree in co-relation 470. Up to 83 conditions per place. [2021-03-26 00:15:40,017 INFO L132 encePairwiseOnDemand]: 180/186 looper letters, 8 selfloop transitions, 11 changer transitions 3/41 dead transitions. [2021-03-26 00:15:40,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 229 flow [2021-03-26 00:15:40,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:15:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:15:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 948 transitions. [2021-03-26 00:15:40,019 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8494623655913979 [2021-03-26 00:15:40,020 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 948 transitions. [2021-03-26 00:15:40,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 948 transitions. [2021-03-26 00:15:40,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:40,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 948 transitions. [2021-03-26 00:15:40,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.0) internal successors, (948), 6 states have internal predecessors, (948), 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 00:15:40,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 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 00:15:40,025 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 186.0) internal successors, (1302), 7 states have internal predecessors, (1302), 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 00:15:40,026 INFO L185 Difference]: Start difference. First operand has 41 places, 32 transitions, 141 flow. Second operand 6 states and 948 transitions. [2021-03-26 00:15:40,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 229 flow [2021-03-26 00:15:40,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 223 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:15:40,030 INFO L241 Difference]: Finished difference. Result has 45 places, 36 transitions, 205 flow [2021-03-26 00:15:40,030 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2021-03-26 00:15:40,030 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2021-03-26 00:15:40,030 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:40,031 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 205 flow [2021-03-26 00:15:40,031 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 205 flow [2021-03-26 00:15:40,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 205 flow [2021-03-26 00:15:40,047 INFO L129 PetriNetUnfolder]: 32/112 cut-off events. [2021-03-26 00:15:40,048 INFO L130 PetriNetUnfolder]: For 168/185 co-relation queries the response was YES. [2021-03-26 00:15:40,048 INFO L84 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 112 events. 32/112 cut-off events. For 168/185 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 470 event pairs, 5 based on Foata normal form. 1/110 useless extension candidates. Maximal degree in co-relation 370. Up to 58 conditions per place. [2021-03-26 00:15:40,049 INFO L142 LiptonReduction]: Number of co-enabled transitions 374 [2021-03-26 00:15:40,056 INFO L154 LiptonReduction]: Checked pairs total: 490 [2021-03-26 00:15:40,056 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:15:40,056 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-26 00:15:40,059 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 197 flow [2021-03-26 00:15:40,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 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 00:15:40,060 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:40,060 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:40,060 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:15:40,060 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:40,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:40,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1674050179, now seen corresponding path program 1 times [2021-03-26 00:15:40,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:40,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413511381] [2021-03-26 00:15:40,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:40,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:40,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:40,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:40,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:40,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:40,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:40,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:40,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:40,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:40,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:40,196 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 00:15:40,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413511381] [2021-03-26 00:15:40,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:40,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:15:40,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134333316] [2021-03-26 00:15:40,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:15:40,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:40,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:15:40,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:15:40,199 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 186 [2021-03-26 00:15:40,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 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 00:15:40,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:40,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 186 [2021-03-26 00:15:40,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:40,272 INFO L129 PetriNetUnfolder]: 42/111 cut-off events. [2021-03-26 00:15:40,272 INFO L130 PetriNetUnfolder]: For 215/269 co-relation queries the response was YES. [2021-03-26 00:15:40,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 111 events. 42/111 cut-off events. For 215/269 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 378 event pairs, 2 based on Foata normal form. 17/115 useless extension candidates. Maximal degree in co-relation 397. Up to 57 conditions per place. [2021-03-26 00:15:40,273 INFO L132 encePairwiseOnDemand]: 180/186 looper letters, 5 selfloop transitions, 11 changer transitions 4/39 dead transitions. [2021-03-26 00:15:40,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 243 flow [2021-03-26 00:15:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:15:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:15:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1100 transitions. [2021-03-26 00:15:40,277 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8448540706605223 [2021-03-26 00:15:40,277 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1100 transitions. [2021-03-26 00:15:40,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1100 transitions. [2021-03-26 00:15:40,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:40,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1100 transitions. [2021-03-26 00:15:40,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.14285714285714) internal successors, (1100), 7 states have internal predecessors, (1100), 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 00:15:40,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 186.0) internal successors, (1488), 8 states have internal predecessors, (1488), 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 00:15:40,282 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 186.0) internal successors, (1488), 8 states have internal predecessors, (1488), 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 00:15:40,282 INFO L185 Difference]: Start difference. First operand has 45 places, 35 transitions, 197 flow. Second operand 7 states and 1100 transitions. [2021-03-26 00:15:40,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 243 flow [2021-03-26 00:15:40,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 216 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-26 00:15:40,287 INFO L241 Difference]: Finished difference. Result has 48 places, 33 transitions, 182 flow [2021-03-26 00:15:40,287 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2021-03-26 00:15:40,287 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2021-03-26 00:15:40,287 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:40,287 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 33 transitions, 182 flow [2021-03-26 00:15:40,288 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 33 transitions, 182 flow [2021-03-26 00:15:40,288 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 33 transitions, 182 flow [2021-03-26 00:15:40,297 INFO L129 PetriNetUnfolder]: 17/70 cut-off events. [2021-03-26 00:15:40,297 INFO L130 PetriNetUnfolder]: For 91/94 co-relation queries the response was YES. [2021-03-26 00:15:40,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 70 events. 17/70 cut-off events. For 91/94 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 200 event pairs, 2 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 212. Up to 20 conditions per place. [2021-03-26 00:15:40,298 INFO L142 LiptonReduction]: Number of co-enabled transitions 276 [2021-03-26 00:15:40,561 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:15:40,672 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:15:41,077 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-03-26 00:15:41,218 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-03-26 00:15:41,223 INFO L154 LiptonReduction]: Checked pairs total: 526 [2021-03-26 00:15:41,223 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:15:41,223 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 936 [2021-03-26 00:15:41,224 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 168 flow [2021-03-26 00:15:41,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 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 00:15:41,224 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:41,224 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:41,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:15:41,225 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:41,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:41,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1523551338, now seen corresponding path program 1 times [2021-03-26 00:15:41,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:41,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092674156] [2021-03-26 00:15:41,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:41,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:41,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:41,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:41,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:41,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:41,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:41,347 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 00:15:41,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092674156] [2021-03-26 00:15:41,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:41,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:15:41,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665386157] [2021-03-26 00:15:41,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:15:41,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:41,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:15:41,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:15:41,348 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2021-03-26 00:15:41,349 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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 00:15:41,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:41,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2021-03-26 00:15:41,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:41,374 INFO L129 PetriNetUnfolder]: 25/90 cut-off events. [2021-03-26 00:15:41,374 INFO L130 PetriNetUnfolder]: For 246/258 co-relation queries the response was YES. [2021-03-26 00:15:41,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 90 events. 25/90 cut-off events. For 246/258 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 347 event pairs, 3 based on Foata normal form. 6/94 useless extension candidates. Maximal degree in co-relation 278. Up to 26 conditions per place. [2021-03-26 00:15:41,375 INFO L132 encePairwiseOnDemand]: 185/188 looper letters, 4 selfloop transitions, 1 changer transitions 3/32 dead transitions. [2021-03-26 00:15:41,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 32 transitions, 192 flow [2021-03-26 00:15:41,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:15:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:15:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2021-03-26 00:15:41,377 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8537234042553191 [2021-03-26 00:15:41,377 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 642 transitions. [2021-03-26 00:15:41,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 642 transitions. [2021-03-26 00:15:41,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:41,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 642 transitions. [2021-03-26 00:15:41,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.5) internal successors, (642), 4 states have internal predecessors, (642), 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 00:15:41,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 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 00:15:41,380 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 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 00:15:41,380 INFO L185 Difference]: Start difference. First operand has 44 places, 30 transitions, 168 flow. Second operand 4 states and 642 transitions. [2021-03-26 00:15:41,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 32 transitions, 192 flow [2021-03-26 00:15:41,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 150 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-26 00:15:41,383 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 131 flow [2021-03-26 00:15:41,383 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2021-03-26 00:15:41,383 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2021-03-26 00:15:41,383 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:41,383 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 29 transitions, 131 flow [2021-03-26 00:15:41,383 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 29 transitions, 131 flow [2021-03-26 00:15:41,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 131 flow [2021-03-26 00:15:41,391 INFO L129 PetriNetUnfolder]: 10/50 cut-off events. [2021-03-26 00:15:41,391 INFO L130 PetriNetUnfolder]: For 39/41 co-relation queries the response was YES. [2021-03-26 00:15:41,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 50 events. 10/50 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 130 event pairs, 0 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 116. Up to 12 conditions per place. [2021-03-26 00:15:41,392 INFO L142 LiptonReduction]: Number of co-enabled transitions 234 [2021-03-26 00:15:41,439 INFO L154 LiptonReduction]: Checked pairs total: 166 [2021-03-26 00:15:41,439 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:15:41,439 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-03-26 00:15:41,440 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 131 flow [2021-03-26 00:15:41,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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 00:15:41,440 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:41,440 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:41,440 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:15:41,440 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:41,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:41,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1339665094, now seen corresponding path program 1 times [2021-03-26 00:15:41,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:41,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720891768] [2021-03-26 00:15:41,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:41,554 INFO L142 QuantifierPusher]: treesize reduction 11, result has 38.9 percent of original size [2021-03-26 00:15:41,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:15:41,569 INFO L142 QuantifierPusher]: treesize reduction 20, result has 74.7 percent of original size [2021-03-26 00:15:41,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-03-26 00:15:41,599 INFO L142 QuantifierPusher]: treesize reduction 90, result has 26.8 percent of original size [2021-03-26 00:15:41,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 00:15:41,624 INFO L142 QuantifierPusher]: treesize reduction 30, result has 65.9 percent of original size [2021-03-26 00:15:41,625 INFO L147 QuantifierPusher]: treesize reduction 9, result has 84.5 percent of original size 49 [2021-03-26 00:15:41,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:41,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:15:41,653 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 00:15:41,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720891768] [2021-03-26 00:15:41,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:41,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:15:41,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975291280] [2021-03-26 00:15:41,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:15:41,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:41,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:15:41,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:15:41,656 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 188 [2021-03-26 00:15:41,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 131 flow. Second operand has 7 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 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 00:15:41,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:41,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 188 [2021-03-26 00:15:41,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:41,845 INFO L129 PetriNetUnfolder]: 61/188 cut-off events. [2021-03-26 00:15:41,845 INFO L130 PetriNetUnfolder]: For 363/399 co-relation queries the response was YES. [2021-03-26 00:15:41,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 188 events. 61/188 cut-off events. For 363/399 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 930 event pairs, 5 based on Foata normal form. 24/204 useless extension candidates. Maximal degree in co-relation 487. Up to 50 conditions per place. [2021-03-26 00:15:41,847 INFO L132 encePairwiseOnDemand]: 181/188 looper letters, 9 selfloop transitions, 8 changer transitions 5/44 dead transitions. [2021-03-26 00:15:41,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 225 flow [2021-03-26 00:15:41,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:15:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:15:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 982 transitions. [2021-03-26 00:15:41,850 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7462006079027356 [2021-03-26 00:15:41,850 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 982 transitions. [2021-03-26 00:15:41,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 982 transitions. [2021-03-26 00:15:41,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:41,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 982 transitions. [2021-03-26 00:15:41,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.28571428571428) internal successors, (982), 7 states have internal predecessors, (982), 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 00:15:41,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 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 00:15:41,854 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 188.0) internal successors, (1504), 8 states have internal predecessors, (1504), 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 00:15:41,854 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 131 flow. Second operand 7 states and 982 transitions. [2021-03-26 00:15:41,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 225 flow [2021-03-26 00:15:41,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 218 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-26 00:15:41,860 INFO L241 Difference]: Finished difference. Result has 49 places, 35 transitions, 192 flow [2021-03-26 00:15:41,860 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2021-03-26 00:15:41,860 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2021-03-26 00:15:41,860 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:41,860 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 35 transitions, 192 flow [2021-03-26 00:15:41,861 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 35 transitions, 192 flow [2021-03-26 00:15:41,861 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 35 transitions, 192 flow [2021-03-26 00:15:41,877 INFO L129 PetriNetUnfolder]: 39/136 cut-off events. [2021-03-26 00:15:41,877 INFO L130 PetriNetUnfolder]: For 237/271 co-relation queries the response was YES. [2021-03-26 00:15:41,878 INFO L84 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 136 events. 39/136 cut-off events. For 237/271 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 577 event pairs, 7 based on Foata normal form. 14/141 useless extension candidates. Maximal degree in co-relation 401. Up to 38 conditions per place. [2021-03-26 00:15:41,879 INFO L142 LiptonReduction]: Number of co-enabled transitions 276 [2021-03-26 00:15:41,898 INFO L154 LiptonReduction]: Checked pairs total: 29 [2021-03-26 00:15:41,898 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:15:41,898 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-26 00:15:41,899 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 192 flow [2021-03-26 00:15:41,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 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 00:15:41,899 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:41,899 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:41,899 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:15:41,900 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:41,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:41,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1832436126, now seen corresponding path program 2 times [2021-03-26 00:15:41,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:41,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975715476] [2021-03-26 00:15:41,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:41,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:41,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:41,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:41,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:41,998 INFO L142 QuantifierPusher]: treesize reduction 7, result has 76.7 percent of original size [2021-03-26 00:15:41,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 00:15:42,016 INFO L142 QuantifierPusher]: treesize reduction 8, result has 83.3 percent of original size [2021-03-26 00:15:42,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 00:15:42,048 INFO L142 QuantifierPusher]: treesize reduction 8, result has 84.6 percent of original size [2021-03-26 00:15:42,050 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.5 percent of original size 35 [2021-03-26 00:15:42,066 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 00:15:42,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975715476] [2021-03-26 00:15:42,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:42,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:15:42,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704511243] [2021-03-26 00:15:42,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:15:42,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:42,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:15:42,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:15:42,068 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 188 [2021-03-26 00:15:42,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 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 00:15:42,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:42,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 188 [2021-03-26 00:15:42,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:42,263 INFO L129 PetriNetUnfolder]: 119/318 cut-off events. [2021-03-26 00:15:42,264 INFO L130 PetriNetUnfolder]: For 1015/1105 co-relation queries the response was YES. [2021-03-26 00:15:42,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 318 events. 119/318 cut-off events. For 1015/1105 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1732 event pairs, 15 based on Foata normal form. 51/359 useless extension candidates. Maximal degree in co-relation 1104. Up to 95 conditions per place. [2021-03-26 00:15:42,266 INFO L132 encePairwiseOnDemand]: 177/188 looper letters, 14 selfloop transitions, 24 changer transitions 13/67 dead transitions. [2021-03-26 00:15:42,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 67 transitions, 475 flow [2021-03-26 00:15:42,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:15:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:15:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1072 transitions. [2021-03-26 00:15:42,269 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7127659574468085 [2021-03-26 00:15:42,270 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1072 transitions. [2021-03-26 00:15:42,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1072 transitions. [2021-03-26 00:15:42,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:42,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1072 transitions. [2021-03-26 00:15:42,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 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 00:15:42,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 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 00:15:42,276 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 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 00:15:42,276 INFO L185 Difference]: Start difference. First operand has 47 places, 35 transitions, 192 flow. Second operand 8 states and 1072 transitions. [2021-03-26 00:15:42,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 67 transitions, 475 flow [2021-03-26 00:15:42,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 67 transitions, 442 flow, removed 8 selfloop flow, removed 4 redundant places. [2021-03-26 00:15:42,281 INFO L241 Difference]: Finished difference. Result has 54 places, 51 transitions, 360 flow [2021-03-26 00:15:42,281 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=360, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2021-03-26 00:15:42,282 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2021-03-26 00:15:42,282 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:42,282 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 51 transitions, 360 flow [2021-03-26 00:15:42,282 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 51 transitions, 360 flow [2021-03-26 00:15:42,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 51 transitions, 360 flow [2021-03-26 00:15:42,314 INFO L129 PetriNetUnfolder]: 77/253 cut-off events. [2021-03-26 00:15:42,314 INFO L130 PetriNetUnfolder]: For 545/594 co-relation queries the response was YES. [2021-03-26 00:15:42,315 INFO L84 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 253 events. 77/253 cut-off events. For 545/594 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1440 event pairs, 10 based on Foata normal form. 15/259 useless extension candidates. Maximal degree in co-relation 864. Up to 61 conditions per place. [2021-03-26 00:15:42,318 INFO L142 LiptonReduction]: Number of co-enabled transitions 398 [2021-03-26 00:15:43,484 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2021-03-26 00:15:43,858 WARN L205 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-26 00:15:45,941 WARN L205 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-26 00:15:46,866 WARN L205 SmtUtils]: Spent 921.00 ms on a formula simplification that was a NOOP. DAG size: 305 [2021-03-26 00:15:47,877 WARN L205 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-26 00:15:48,333 WARN L205 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 204 [2021-03-26 00:15:50,576 WARN L205 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 377 DAG size of output: 316 [2021-03-26 00:15:51,539 WARN L205 SmtUtils]: Spent 959.00 ms on a formula simplification that was a NOOP. DAG size: 307 [2021-03-26 00:15:51,705 INFO L154 LiptonReduction]: Checked pairs total: 40 [2021-03-26 00:15:51,705 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:15:51,705 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9423 [2021-03-26 00:15:51,706 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 367 flow [2021-03-26 00:15:51,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 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 00:15:51,706 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:51,706 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:51,706 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:15:51,707 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:51,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:51,707 INFO L82 PathProgramCache]: Analyzing trace with hash 324643208, now seen corresponding path program 3 times [2021-03-26 00:15:51,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:51,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769280081] [2021-03-26 00:15:51,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:51,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:51,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:15:51,775 INFO L142 QuantifierPusher]: treesize reduction 4, result has 88.9 percent of original size [2021-03-26 00:15:51,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 00:15:51,805 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-26 00:15:51,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 00:15:51,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:51,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:15:51,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:51,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:51,852 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 00:15:51,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769280081] [2021-03-26 00:15:51,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:51,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:15:51,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677298228] [2021-03-26 00:15:51,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:15:51,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:51,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:15:51,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:15:51,855 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 192 [2021-03-26 00:15:51,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 367 flow. Second operand has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 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 00:15:51,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:51,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 192 [2021-03-26 00:15:51,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:52,076 INFO L129 PetriNetUnfolder]: 94/309 cut-off events. [2021-03-26 00:15:52,077 INFO L130 PetriNetUnfolder]: For 945/1034 co-relation queries the response was YES. [2021-03-26 00:15:52,078 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 309 events. 94/309 cut-off events. For 945/1034 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1958 event pairs, 6 based on Foata normal form. 40/338 useless extension candidates. Maximal degree in co-relation 1136. Up to 81 conditions per place. [2021-03-26 00:15:52,079 INFO L132 encePairwiseOnDemand]: 184/192 looper letters, 13 selfloop transitions, 9 changer transitions 11/62 dead transitions. [2021-03-26 00:15:52,079 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 511 flow [2021-03-26 00:15:52,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:15:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:15:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 838 transitions. [2021-03-26 00:15:52,082 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7274305555555556 [2021-03-26 00:15:52,082 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 838 transitions. [2021-03-26 00:15:52,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 838 transitions. [2021-03-26 00:15:52,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:52,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 838 transitions. [2021-03-26 00:15:52,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.66666666666666) internal successors, (838), 6 states have internal predecessors, (838), 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 00:15:52,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 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 00:15:52,087 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 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 00:15:52,087 INFO L185 Difference]: Start difference. First operand has 54 places, 51 transitions, 367 flow. Second operand 6 states and 838 transitions. [2021-03-26 00:15:52,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 511 flow [2021-03-26 00:15:52,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 62 transitions, 491 flow, removed 10 selfloop flow, removed 0 redundant places. [2021-03-26 00:15:52,091 INFO L241 Difference]: Finished difference. Result has 61 places, 46 transitions, 328 flow [2021-03-26 00:15:52,092 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2021-03-26 00:15:52,092 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2021-03-26 00:15:52,092 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:52,093 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 46 transitions, 328 flow [2021-03-26 00:15:52,093 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 46 transitions, 328 flow [2021-03-26 00:15:52,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 328 flow [2021-03-26 00:15:52,116 INFO L129 PetriNetUnfolder]: 52/173 cut-off events. [2021-03-26 00:15:52,116 INFO L130 PetriNetUnfolder]: For 431/457 co-relation queries the response was YES. [2021-03-26 00:15:52,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 173 events. 52/173 cut-off events. For 431/457 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 868 event pairs, 7 based on Foata normal form. 14/181 useless extension candidates. Maximal degree in co-relation 593. Up to 42 conditions per place. [2021-03-26 00:15:52,118 INFO L142 LiptonReduction]: Number of co-enabled transitions 262 [2021-03-26 00:15:52,194 INFO L154 LiptonReduction]: Checked pairs total: 32 [2021-03-26 00:15:52,195 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:15:52,196 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 104 [2021-03-26 00:15:52,196 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 328 flow [2021-03-26 00:15:52,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 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 00:15:52,197 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:52,197 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:52,197 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:15:52,197 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:52,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:52,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1472998881, now seen corresponding path program 1 times [2021-03-26 00:15:52,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:52,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773983918] [2021-03-26 00:15:52,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:52,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:52,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:15:52,273 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.6 percent of original size [2021-03-26 00:15:52,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-26 00:15:52,297 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.6 percent of original size [2021-03-26 00:15:52,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-26 00:15:52,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:52,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:15:52,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:52,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:15:52,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:52,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:15:52,368 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 00:15:52,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773983918] [2021-03-26 00:15:52,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:52,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:15:52,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293663082] [2021-03-26 00:15:52,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:15:52,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:52,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:15:52,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:15:52,370 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 194 [2021-03-26 00:15:52,371 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 328 flow. Second operand has 8 states, 8 states have (on average 123.25) internal successors, (986), 8 states have internal predecessors, (986), 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 00:15:52,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:52,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 194 [2021-03-26 00:15:52,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:52,714 INFO L129 PetriNetUnfolder]: 90/279 cut-off events. [2021-03-26 00:15:52,715 INFO L130 PetriNetUnfolder]: For 1068/1116 co-relation queries the response was YES. [2021-03-26 00:15:52,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1180 conditions, 279 events. 90/279 cut-off events. For 1068/1116 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1607 event pairs, 16 based on Foata normal form. 41/314 useless extension candidates. Maximal degree in co-relation 1153. Up to 70 conditions per place. [2021-03-26 00:15:52,717 INFO L132 encePairwiseOnDemand]: 184/194 looper letters, 25 selfloop transitions, 14 changer transitions 24/78 dead transitions. [2021-03-26 00:15:52,717 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 78 transitions, 749 flow [2021-03-26 00:15:52,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 00:15:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 00:15:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1267 transitions. [2021-03-26 00:15:52,721 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6530927835051547 [2021-03-26 00:15:52,721 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1267 transitions. [2021-03-26 00:15:52,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1267 transitions. [2021-03-26 00:15:52,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:52,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1267 transitions. [2021-03-26 00:15:52,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 126.7) internal successors, (1267), 10 states have internal predecessors, (1267), 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 00:15:52,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 194.0) internal successors, (2134), 11 states have internal predecessors, (2134), 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 00:15:52,728 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 194.0) internal successors, (2134), 11 states have internal predecessors, (2134), 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 00:15:52,728 INFO L185 Difference]: Start difference. First operand has 58 places, 45 transitions, 328 flow. Second operand 10 states and 1267 transitions. [2021-03-26 00:15:52,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 78 transitions, 749 flow [2021-03-26 00:15:52,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 707 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-03-26 00:15:52,733 INFO L241 Difference]: Finished difference. Result has 68 places, 48 transitions, 392 flow [2021-03-26 00:15:52,733 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=392, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2021-03-26 00:15:52,733 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2021-03-26 00:15:52,733 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:52,734 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 48 transitions, 392 flow [2021-03-26 00:15:52,734 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 48 transitions, 392 flow [2021-03-26 00:15:52,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 48 transitions, 392 flow [2021-03-26 00:15:52,760 INFO L129 PetriNetUnfolder]: 51/169 cut-off events. [2021-03-26 00:15:52,760 INFO L130 PetriNetUnfolder]: For 470/484 co-relation queries the response was YES. [2021-03-26 00:15:52,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 169 events. 51/169 cut-off events. For 470/484 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 837 event pairs, 7 based on Foata normal form. 11/176 useless extension candidates. Maximal degree in co-relation 618. Up to 42 conditions per place. [2021-03-26 00:15:52,762 INFO L142 LiptonReduction]: Number of co-enabled transitions 232 [2021-03-26 00:15:53,967 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2021-03-26 00:15:54,434 WARN L205 SmtUtils]: Spent 465.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-26 00:15:56,806 WARN L205 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 377 DAG size of output: 313 [2021-03-26 00:15:57,871 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 305 [2021-03-26 00:15:58,999 WARN L205 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-26 00:15:59,960 WARN L205 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 203 [2021-03-26 00:16:02,584 WARN L205 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 377 DAG size of output: 312 [2021-03-26 00:16:03,674 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 304 [2021-03-26 00:16:03,893 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:16:04,356 WARN L205 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:16:04,520 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:16:04,648 INFO L154 LiptonReduction]: Checked pairs total: 19 [2021-03-26 00:16:04,649 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:16:04,649 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11916 [2021-03-26 00:16:04,649 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 408 flow [2021-03-26 00:16:04,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 123.25) internal successors, (986), 8 states have internal predecessors, (986), 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 00:16:04,650 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:16:04,650 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:16:04,650 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:16:04,650 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:16:04,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:16:04,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1542147095, now seen corresponding path program 1 times [2021-03-26 00:16:04,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:16:04,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901443555] [2021-03-26 00:16:04,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:16:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:16:04,689 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:16:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:16:04,723 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:16:04,748 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:16:04,749 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:16:04,749 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:16:04,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:16:04 BasicIcfg [2021-03-26 00:16:04,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:16:04,824 INFO L168 Benchmark]: Toolchain (without parser) took 34708.19 ms. Allocated memory was 255.9 MB in the beginning and 853.5 MB in the end (delta: 597.7 MB). Free memory was 233.4 MB in the beginning and 744.4 MB in the end (delta: -511.0 MB). Peak memory consumption was 87.5 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:04,824 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:16:04,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 628.14 ms. Allocated memory was 255.9 MB in the beginning and 379.6 MB in the end (delta: 123.7 MB). Free memory was 233.4 MB in the beginning and 338.5 MB in the end (delta: -105.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:04,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.08 ms. Allocated memory is still 379.6 MB. Free memory was 338.5 MB in the beginning and 335.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:04,825 INFO L168 Benchmark]: Boogie Preprocessor took 63.00 ms. Allocated memory is still 379.6 MB. Free memory was 335.8 MB in the beginning and 333.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:04,825 INFO L168 Benchmark]: RCFGBuilder took 1818.96 ms. Allocated memory is still 379.6 MB. Free memory was 333.6 MB in the beginning and 329.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 70.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:04,825 INFO L168 Benchmark]: TraceAbstraction took 32141.91 ms. Allocated memory was 379.6 MB in the beginning and 853.5 MB in the end (delta: 474.0 MB). Free memory was 329.6 MB in the beginning and 744.4 MB in the end (delta: -414.8 MB). Peak memory consumption was 59.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:16:04,827 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.52 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 628.14 ms. Allocated memory was 255.9 MB in the beginning and 379.6 MB in the end (delta: 123.7 MB). Free memory was 233.4 MB in the beginning and 338.5 MB in the end (delta: -105.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 51.08 ms. Allocated memory is still 379.6 MB. Free memory was 338.5 MB in the beginning and 335.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 63.00 ms. Allocated memory is still 379.6 MB. Free memory was 335.8 MB in the beginning and 333.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1818.96 ms. Allocated memory is still 379.6 MB. Free memory was 333.6 MB in the beginning and 329.6 MB in the end (delta: 3.9 MB). Peak memory consumption was 70.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 32141.91 ms. Allocated memory was 379.6 MB in the beginning and 853.5 MB in the end (delta: 474.0 MB). Free memory was 329.6 MB in the beginning and 744.4 MB in the end (delta: -414.8 MB). Peak memory consumption was 59.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: 3112.4ms, 108 PlacesBefore, 49 PlacesAfterwards, 100 TransitionsBefore, 40 TransitionsAfterwards, 1862 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, 3253 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1885, positive: 1803, positive conditional: 1803, positive unconditional: 0, negative: 82, negative conditional: 82, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1339, positive: 1303, positive conditional: 0, positive unconditional: 1303, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1339, positive: 1303, positive conditional: 0, positive unconditional: 1303, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1339, positive: 1296, positive conditional: 0, positive unconditional: 1296, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 568, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 542, negative conditional: 0, negative unconditional: 542, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1885, positive: 500, positive conditional: 500, positive unconditional: 0, negative: 46, negative conditional: 46, negative unconditional: 0, unknown: 1339, unknown conditional: 1339, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 103, Positive conditional cache size: 103, Positive unconditional cache size: 0, Negative cache size: 16, Negative conditional cache size: 16, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1235.5ms, 46 PlacesBefore, 35 PlacesAfterwards, 37 TransitionsBefore, 26 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1624 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 606, positive: 505, positive conditional: 505, positive unconditional: 0, negative: 101, negative conditional: 101, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 128, positive: 109, positive conditional: 13, positive unconditional: 96, negative: 19, negative conditional: 1, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 128, positive: 109, positive conditional: 13, positive unconditional: 96, negative: 19, negative conditional: 1, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 128, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 19, negative conditional: 1, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 263, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 251, negative conditional: 41, negative unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 606, positive: 396, positive conditional: 396, positive unconditional: 0, negative: 82, negative conditional: 82, negative unconditional: 0, unknown: 128, unknown conditional: 128, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 142, Positive conditional cache size: 142, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1507.5ms, 39 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 26 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 582 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 169, positive: 130, positive conditional: 130, positive unconditional: 0, negative: 39, negative conditional: 39, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 18, positive conditional: 2, positive unconditional: 16, negative: 8, negative conditional: 2, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 18, positive conditional: 2, positive unconditional: 16, negative: 8, negative conditional: 2, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 2, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 209, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 209, negative conditional: 10, negative unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 169, positive: 112, positive conditional: 112, positive unconditional: 0, negative: 31, negative conditional: 31, negative unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 160, Positive conditional cache size: 160, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.1ms, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 216 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 1, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 1, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 163, Positive conditional cache size: 163, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.8ms, 41 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 489 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 151, positive: 127, positive conditional: 127, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, positive: 42, positive conditional: 21, positive unconditional: 21, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, positive: 42, positive conditional: 21, positive unconditional: 21, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 43, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 151, positive: 85, positive conditional: 85, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 43, unknown conditional: 43, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 168, Positive conditional cache size: 168, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.5ms, 45 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 490 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 101, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 10, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 10, positive unconditional: 12, 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: 22, positive: 22, positive conditional: 0, positive unconditional: 22, 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: 101, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 168, Positive conditional cache size: 168, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 935.3ms, 48 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 30 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 526 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 109, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 35, negative conditional: 35, negative unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 137, Positive conditional cache size: 137, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.4ms, 42 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 10, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 10, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 155, Positive conditional cache size: 155, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.4ms, 49 PlacesBefore, 47 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 29 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 5, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 7, positive conditional: 5, positive unconditional: 2, 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: 8, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 162, Positive conditional cache size: 162, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9423.2ms, 54 PlacesBefore, 54 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 40 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 34, positive conditional: 31, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 34, positive conditional: 31, positive unconditional: 3, 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: 34, positive: 34, positive conditional: 0, positive unconditional: 34, 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: 40, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 34, unknown conditional: 34, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 139, Positive conditional cache size: 139, Positive unconditional cache size: 0, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 102.9ms, 61 PlacesBefore, 58 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 32 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 11, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 32, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 109, Positive conditional cache size: 109, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11914.9ms, 68 PlacesBefore, 64 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 19 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 19, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 101, Positive conditional cache size: 101, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L845] 0 pthread_t t925; [L846] FCALL, FORK 0 pthread_create(&t925, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t926; [L848] FCALL, FORK 0 pthread_create(&t926, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L849] 0 pthread_t t927; [L850] FCALL, FORK 0 pthread_create(&t927, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L798] 3 y = 1 [L801] 3 z = 1 [L804] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 a$flush_delayed = weak$$choice2 [L810] 3 a$mem_tmp = a [L811] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L811] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L812] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L812] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L812] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L812] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L813] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L813] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L813] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L813] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L814] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L814] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L814] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L814] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L815] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L816] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L816] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L816] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L817] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L817] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = a [L819] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L819] 3 a = a$flush_delayed ? a$mem_tmp : a [L820] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L823] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L823] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L823] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L823] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L824] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L824] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L825] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L825] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L826] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L826] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L827] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L827] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 3 return 0; [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L856] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L856] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L856] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L856] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L857] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L857] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L858] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L858] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L859] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L859] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L860] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L860] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 31927.9ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1578.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3183.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 75 SDtfs, 74 SDslu, 73 SDs, 0 SdLazy, 434 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 562.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 591.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=11, InterpolantAutomatonStates: 64, 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: 41.2ms SsaConstructionTime, 517.0ms SatisfiabilityAnalysisTime, 968.2ms InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 1409 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...