/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:26:59,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:26:59,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:26:59,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:26:59,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:26:59,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:26:59,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:26:59,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:26:59,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:26:59,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:26:59,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:26:59,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:26:59,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:26:59,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:26:59,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:26:59,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:26:59,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:26:59,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:26:59,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:26:59,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:26:59,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:26:59,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:26:59,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:26:59,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:26:59,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:26:59,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:26:59,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:26:59,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:26:59,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:26:59,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:26:59,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:26:59,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:26:59,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:26:59,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:26:59,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:26:59,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:26:59,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:26:59,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:26:59,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:26:59,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:26:59,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:26:59,908 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:26:59,945 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:26:59,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:26:59,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:26:59,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:26:59,949 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:26:59,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:26:59,949 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:26:59,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:26:59,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:26:59,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:26:59,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:26:59,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:26:59,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:26:59,951 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:26:59,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:26:59,951 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:26:59,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:26:59,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:26:59,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:26:59,952 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:26:59,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:26:59,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:26:59,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:26:59,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:26:59,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:26:59,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:26:59,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:26:59,954 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:26:59,954 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:26:59,954 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:26:59,954 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:27:00,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:27:00,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:27:00,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:27:00,346 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:27:00,347 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:27:00,348 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i [2021-03-26 10:27:00,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04356f6c8/4cf87052ca394788b6da16f933c98a1d/FLAG9dccc1419 [2021-03-26 10:27:01,022 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:27:01,023 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i [2021-03-26 10:27:01,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04356f6c8/4cf87052ca394788b6da16f933c98a1d/FLAG9dccc1419 [2021-03-26 10:27:01,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04356f6c8/4cf87052ca394788b6da16f933c98a1d [2021-03-26 10:27:01,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:27:01,419 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:27:01,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:27:01,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:27:01,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:27:01,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:27:01" (1/1) ... [2021-03-26 10:27:01,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e64bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:01, skipping insertion in model container [2021-03-26 10:27:01,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:27:01" (1/1) ... [2021-03-26 10:27:01,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:27:01,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:27:01,655 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/safe001_rmo.opt.i[949,962] [2021-03-26 10:27:01,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:27:01,889 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:27:01,901 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/safe001_rmo.opt.i[949,962] [2021-03-26 10:27:01,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:27:02,053 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:27:02,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:02 WrapperNode [2021-03-26 10:27:02,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:27:02,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:27:02,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:27:02,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:27:02,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:02" (1/1) ... [2021-03-26 10:27:02,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:02" (1/1) ... [2021-03-26 10:27:02,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:27:02,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:27:02,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:27:02,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:27:02,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:02" (1/1) ... [2021-03-26 10:27:02,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:02" (1/1) ... [2021-03-26 10:27:02,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:02" (1/1) ... [2021-03-26 10:27:02,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:02" (1/1) ... [2021-03-26 10:27:02,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:02" (1/1) ... [2021-03-26 10:27:02,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:02" (1/1) ... [2021-03-26 10:27:02,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:02" (1/1) ... [2021-03-26 10:27:02,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:27:02,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:27:02,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:27:02,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:27:02,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:27:02,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:27:02,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:27:02,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:27:02,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:27:02,277 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:27:02,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:27:02,277 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:27:02,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:27:02,277 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:27:02,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:27:02,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:27:02,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:27:02,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:27:02,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:27:02,280 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:27:04,216 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:27:04,216 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:27:04,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:27:04 BoogieIcfgContainer [2021-03-26 10:27:04,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:27:04,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:27:04,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:27:04,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:27:04,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:27:01" (1/3) ... [2021-03-26 10:27:04,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0e8d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:27:04, skipping insertion in model container [2021-03-26 10:27:04,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:27:02" (2/3) ... [2021-03-26 10:27:04,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0e8d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:27:04, skipping insertion in model container [2021-03-26 10:27:04,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:27:04" (3/3) ... [2021-03-26 10:27:04,226 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_rmo.opt.i [2021-03-26 10:27:04,232 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:27:04,236 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:27:04,237 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:27:04,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,270 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,270 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,270 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,271 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,274 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,274 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,274 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,275 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,275 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,275 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,275 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,276 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,279 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,279 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,279 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,279 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,283 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,284 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,285 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,285 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,288 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,288 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,291 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,292 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:27:04,293 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:27:04,309 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:27:04,327 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:27:04,327 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:27:04,327 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:27:04,327 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:27:04,327 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:27:04,327 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:27:04,327 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:27:04,328 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:27:04,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:27:04,374 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:27:04,375 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:27:04,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:27:04,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:27:04,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 10:27:04,389 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:27:04,401 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:27:04,405 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:27:04,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 10:27:04,439 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:27:04,439 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:27:04,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:27:04,444 INFO L142 LiptonReduction]: Number of co-enabled transitions 1686 [2021-03-26 10:27:06,465 WARN L205 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 10:27:06,766 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:27:08,049 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:27:08,602 WARN L205 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:27:08,763 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:27:09,157 WARN L205 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-26 10:27:09,280 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 10:27:10,719 WARN L205 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-26 10:27:11,001 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:27:11,600 WARN L205 SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:27:12,271 WARN L205 SmtUtils]: Spent 670.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:27:12,437 INFO L154 LiptonReduction]: Checked pairs total: 2882 [2021-03-26 10:27:12,437 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-26 10:27:12,440 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8052 [2021-03-26 10:27:12,450 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-26 10:27:12,450 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:27:12,451 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:27:12,451 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:27:12,452 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:27:12,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:27:12,457 INFO L82 PathProgramCache]: Analyzing trace with hash 788348067, now seen corresponding path program 1 times [2021-03-26 10:27:12,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:27:12,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931966896] [2021-03-26 10:27:12,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:27:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:27:12,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:12,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:27:12,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:12,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:27:12,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931966896] [2021-03-26 10:27:12,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:27:12,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:27:12,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133954193] [2021-03-26 10:27:12,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:27:12,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:27:12,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:27:12,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:27:12,688 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 161 [2021-03-26 10:27:12,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:12,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:27:12,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 161 [2021-03-26 10:27:12,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:27:12,801 INFO L129 PetriNetUnfolder]: 69/198 cut-off events. [2021-03-26 10:27:12,801 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:27:12,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 198 events. 69/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 921 event pairs, 39 based on Foata normal form. 11/192 useless extension candidates. Maximal degree in co-relation 307. Up to 89 conditions per place. [2021-03-26 10:27:12,805 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 9 selfloop transitions, 2 changer transitions 5/41 dead transitions. [2021-03-26 10:27:12,805 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 117 flow [2021-03-26 10:27:12,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:27:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:27:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2021-03-26 10:27:12,824 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8902691511387164 [2021-03-26 10:27:12,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2021-03-26 10:27:12,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2021-03-26 10:27:12,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:27:12,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2021-03-26 10:27:12,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:12,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:12,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:12,845 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 430 transitions. [2021-03-26 10:27:12,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 117 flow [2021-03-26 10:27:12,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:27:12,849 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 74 flow [2021-03-26 10:27:12,851 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-26 10:27:12,852 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-26 10:27:12,852 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:27:12,852 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-26 10:27:12,853 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-26 10:27:12,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2021-03-26 10:27:12,858 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-26 10:27:12,858 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:27:12,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:27:12,860 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 10:27:13,683 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 188 [2021-03-26 10:27:13,996 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:27:14,619 WARN L205 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:27:15,269 WARN L205 SmtUtils]: Spent 649.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:27:16,038 INFO L154 LiptonReduction]: Checked pairs total: 1242 [2021-03-26 10:27:16,039 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-26 10:27:16,039 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3187 [2021-03-26 10:27:16,040 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 10:27:16,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:16,040 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:27:16,041 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:27:16,041 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:27:16,043 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:27:16,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:27:16,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1851944499, now seen corresponding path program 1 times [2021-03-26 10:27:16,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:27:16,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657199933] [2021-03-26 10:27:16,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:27:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:27:16,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:16,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:27:16,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:16,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:16,233 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:27:16,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:27:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:27:16,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657199933] [2021-03-26 10:27:16,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:27:16,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:27:16,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365871142] [2021-03-26 10:27:16,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:27:16,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:27:16,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:27:16,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:27:16,251 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 169 [2021-03-26 10:27:16,251 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:16,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:27:16,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 169 [2021-03-26 10:27:16,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:27:16,268 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:27:16,269 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:27:16,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:27:16,269 INFO L132 encePairwiseOnDemand]: 166/169 looper letters, 1 selfloop transitions, 2 changer transitions 1/24 dead transitions. [2021-03-26 10:27:16,269 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 64 flow [2021-03-26 10:27:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:27:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:27:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2021-03-26 10:27:16,271 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8777120315581854 [2021-03-26 10:27:16,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2021-03-26 10:27:16,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2021-03-26 10:27:16,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:27:16,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2021-03-26 10:27:16,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:16,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:16,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:16,277 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 445 transitions. [2021-03-26 10:27:16,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 64 flow [2021-03-26 10:27:16,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:27:16,278 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 60 flow [2021-03-26 10:27:16,278 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-03-26 10:27:16,278 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-26 10:27:16,279 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:27:16,279 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 10:27:16,279 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 10:27:16,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-26 10:27:16,284 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 10:27:16,284 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:27:16,284 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:27:16,285 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-26 10:27:16,943 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:27:17,085 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:27:17,414 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:27:17,543 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:27:17,546 INFO L154 LiptonReduction]: Checked pairs total: 777 [2021-03-26 10:27:17,546 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:27:17,546 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1267 [2021-03-26 10:27:17,547 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-26 10:27:17,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:17,548 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:27:17,548 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:27:17,548 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:27:17,548 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:27:17,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:27:17,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1192546168, now seen corresponding path program 1 times [2021-03-26 10:27:17,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:27:17,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604345538] [2021-03-26 10:27:17,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:27:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:27:17,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:17,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:27:17,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:17,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:17,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:17,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:27:17,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604345538] [2021-03-26 10:27:17,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:27:17,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:27:17,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073121235] [2021-03-26 10:27:17,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:27:17,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:27:17,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:27:17,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:27:17,686 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2021-03-26 10:27:17,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:17,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:27:17,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2021-03-26 10:27:17,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:27:17,720 INFO L129 PetriNetUnfolder]: 13/71 cut-off events. [2021-03-26 10:27:17,720 INFO L130 PetriNetUnfolder]: For 14/18 co-relation queries the response was YES. [2021-03-26 10:27:17,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 71 events. 13/71 cut-off events. For 14/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 272 event pairs, 3 based on Foata normal form. 8/77 useless extension candidates. Maximal degree in co-relation 117. Up to 15 conditions per place. [2021-03-26 10:27:17,721 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 5 selfloop transitions, 3 changer transitions 4/27 dead transitions. [2021-03-26 10:27:17,721 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 95 flow [2021-03-26 10:27:17,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:27:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:27:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2021-03-26 10:27:17,723 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8391812865497076 [2021-03-26 10:27:17,724 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2021-03-26 10:27:17,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2021-03-26 10:27:17,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:27:17,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2021-03-26 10:27:17,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:17,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:17,727 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:17,727 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 4 states and 574 transitions. [2021-03-26 10:27:17,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 95 flow [2021-03-26 10:27:17,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 89 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:27:17,729 INFO L241 Difference]: Finished difference. Result has 34 places, 21 transitions, 68 flow [2021-03-26 10:27:17,729 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2021-03-26 10:27:17,729 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-26 10:27:17,729 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:27:17,730 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 68 flow [2021-03-26 10:27:17,730 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 68 flow [2021-03-26 10:27:17,730 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 21 transitions, 68 flow [2021-03-26 10:27:17,736 INFO L129 PetriNetUnfolder]: 1/25 cut-off events. [2021-03-26 10:27:17,736 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 10:27:17,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 25 events. 1/25 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 40. Up to 6 conditions per place. [2021-03-26 10:27:17,736 INFO L142 LiptonReduction]: Number of co-enabled transitions 192 [2021-03-26 10:27:17,980 INFO L154 LiptonReduction]: Checked pairs total: 199 [2021-03-26 10:27:17,980 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:27:17,980 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 251 [2021-03-26 10:27:17,981 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 68 flow [2021-03-26 10:27:17,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:17,982 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:27:17,982 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:27:17,982 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:27:17,982 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:27:17,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:27:17,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1360024109, now seen corresponding path program 1 times [2021-03-26 10:27:17,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:27:17,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111650330] [2021-03-26 10:27:17,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:27:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:27:18,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:18,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:27:18,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111650330] [2021-03-26 10:27:18,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:27:18,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:27:18,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243158608] [2021-03-26 10:27:18,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:27:18,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:27:18,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:27:18,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:27:18,109 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 171 [2021-03-26 10:27:18,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:27:18,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 171 [2021-03-26 10:27:18,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:27:18,120 INFO L129 PetriNetUnfolder]: 1/25 cut-off events. [2021-03-26 10:27:18,121 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-03-26 10:27:18,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 25 events. 1/25 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 1 based on Foata normal form. 2/27 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2021-03-26 10:27:18,122 INFO L132 encePairwiseOnDemand]: 168/171 looper letters, 1 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-03-26 10:27:18,122 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 21 transitions, 74 flow [2021-03-26 10:27:18,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:27:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:27:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-26 10:27:18,125 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8966861598440545 [2021-03-26 10:27:18,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-26 10:27:18,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-26 10:27:18,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:27:18,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-26 10:27:18,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,128 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,128 INFO L185 Difference]: Start difference. First operand has 34 places, 21 transitions, 68 flow. Second operand 3 states and 460 transitions. [2021-03-26 10:27:18,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 21 transitions, 74 flow [2021-03-26 10:27:18,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 21 transitions, 66 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:27:18,129 INFO L241 Difference]: Finished difference. Result has 34 places, 21 transitions, 68 flow [2021-03-26 10:27:18,130 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2021-03-26 10:27:18,130 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-26 10:27:18,132 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:27:18,133 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 68 flow [2021-03-26 10:27:18,133 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 68 flow [2021-03-26 10:27:18,133 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 21 transitions, 68 flow [2021-03-26 10:27:18,137 INFO L129 PetriNetUnfolder]: 1/25 cut-off events. [2021-03-26 10:27:18,137 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 10:27:18,137 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 25 events. 1/25 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 40. Up to 6 conditions per place. [2021-03-26 10:27:18,139 INFO L142 LiptonReduction]: Number of co-enabled transitions 190 [2021-03-26 10:27:18,140 INFO L154 LiptonReduction]: Checked pairs total: 184 [2021-03-26 10:27:18,141 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:27:18,141 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-26 10:27:18,145 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 68 flow [2021-03-26 10:27:18,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,146 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:27:18,146 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:27:18,146 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:27:18,146 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:27:18,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:27:18,146 INFO L82 PathProgramCache]: Analyzing trace with hash 799765819, now seen corresponding path program 1 times [2021-03-26 10:27:18,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:27:18,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921748033] [2021-03-26 10:27:18,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:27:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:27:18,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:18,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:27:18,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:18,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:18,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:18,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:27:18,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921748033] [2021-03-26 10:27:18,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:27:18,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:27:18,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992456960] [2021-03-26 10:27:18,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:27:18,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:27:18,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:27:18,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:27:18,248 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2021-03-26 10:27:18,249 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,249 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:27:18,249 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2021-03-26 10:27:18,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:27:18,286 INFO L129 PetriNetUnfolder]: 2/42 cut-off events. [2021-03-26 10:27:18,286 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-03-26 10:27:18,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 42 events. 2/42 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 126 event pairs, 1 based on Foata normal form. 3/44 useless extension candidates. Maximal degree in co-relation 78. Up to 7 conditions per place. [2021-03-26 10:27:18,287 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 4 selfloop transitions, 2 changer transitions 3/24 dead transitions. [2021-03-26 10:27:18,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 24 transitions, 99 flow [2021-03-26 10:27:18,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:27:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:27:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2021-03-26 10:27:18,290 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8327485380116959 [2021-03-26 10:27:18,290 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2021-03-26 10:27:18,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2021-03-26 10:27:18,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:27:18,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2021-03-26 10:27:18,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,294 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,295 INFO L185 Difference]: Start difference. First operand has 34 places, 21 transitions, 68 flow. Second operand 5 states and 712 transitions. [2021-03-26 10:27:18,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 24 transitions, 99 flow [2021-03-26 10:27:18,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 24 transitions, 89 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 10:27:18,296 INFO L241 Difference]: Finished difference. Result has 39 places, 21 transitions, 76 flow [2021-03-26 10:27:18,297 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=39, PETRI_TRANSITIONS=21} [2021-03-26 10:27:18,297 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -9 predicate places. [2021-03-26 10:27:18,297 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:27:18,297 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 21 transitions, 76 flow [2021-03-26 10:27:18,297 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 21 transitions, 76 flow [2021-03-26 10:27:18,298 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 21 transitions, 76 flow [2021-03-26 10:27:18,302 INFO L129 PetriNetUnfolder]: 1/30 cut-off events. [2021-03-26 10:27:18,302 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-26 10:27:18,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 30 events. 1/30 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 54. Up to 6 conditions per place. [2021-03-26 10:27:18,302 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-26 10:27:18,331 INFO L154 LiptonReduction]: Checked pairs total: 328 [2021-03-26 10:27:18,331 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:27:18,331 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34 [2021-03-26 10:27:18,333 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 20 transitions, 74 flow [2021-03-26 10:27:18,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,334 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:27:18,334 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:27:18,334 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:27:18,334 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:27:18,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:27:18,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1313154008, now seen corresponding path program 1 times [2021-03-26 10:27:18,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:27:18,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815336649] [2021-03-26 10:27:18,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:27:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:27:18,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:18,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:27:18,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:18,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:27:18,438 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 10:27:18,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 10:27:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:27:18,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815336649] [2021-03-26 10:27:18,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:27:18,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:27:18,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597051517] [2021-03-26 10:27:18,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:27:18,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:27:18,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:27:18,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:27:18,455 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 172 [2021-03-26 10:27:18,456 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 20 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,456 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:27:18,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 172 [2021-03-26 10:27:18,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:27:18,523 INFO L129 PetriNetUnfolder]: 66/162 cut-off events. [2021-03-26 10:27:18,523 INFO L130 PetriNetUnfolder]: For 306/308 co-relation queries the response was YES. [2021-03-26 10:27:18,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 162 events. 66/162 cut-off events. For 306/308 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 717 event pairs, 27 based on Foata normal form. 1/152 useless extension candidates. Maximal degree in co-relation 394. Up to 107 conditions per place. [2021-03-26 10:27:18,528 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 9 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2021-03-26 10:27:18,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 118 flow [2021-03-26 10:27:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:27:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:27:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2021-03-26 10:27:18,530 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7790697674418605 [2021-03-26 10:27:18,531 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2021-03-26 10:27:18,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2021-03-26 10:27:18,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:27:18,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2021-03-26 10:27:18,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,538 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,538 INFO L185 Difference]: Start difference. First operand has 36 places, 20 transitions, 74 flow. Second operand 4 states and 536 transitions. [2021-03-26 10:27:18,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 118 flow [2021-03-26 10:27:18,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 106 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-26 10:27:18,541 INFO L241 Difference]: Finished difference. Result has 36 places, 25 transitions, 101 flow [2021-03-26 10:27:18,541 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2021-03-26 10:27:18,542 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -12 predicate places. [2021-03-26 10:27:18,542 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:27:18,542 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 25 transitions, 101 flow [2021-03-26 10:27:18,542 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 101 flow [2021-03-26 10:27:18,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 101 flow [2021-03-26 10:27:18,553 INFO L129 PetriNetUnfolder]: 9/59 cut-off events. [2021-03-26 10:27:18,553 INFO L130 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2021-03-26 10:27:18,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 59 events. 9/59 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 3 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 116. Up to 21 conditions per place. [2021-03-26 10:27:18,554 INFO L142 LiptonReduction]: Number of co-enabled transitions 206 [2021-03-26 10:27:18,774 INFO L154 LiptonReduction]: Checked pairs total: 208 [2021-03-26 10:27:18,774 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:27:18,775 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 233 [2021-03-26 10:27:18,775 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 106 flow [2021-03-26 10:27:18,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,776 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:27:18,776 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:27:18,776 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:27:18,776 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:27:18,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:27:18,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1120262708, now seen corresponding path program 1 times [2021-03-26 10:27:18,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:27:18,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065998172] [2021-03-26 10:27:18,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:27:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:27:18,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:18,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:18,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:18,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:27:18,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065998172] [2021-03-26 10:27:18,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:27:18,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:27:18,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597128533] [2021-03-26 10:27:18,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:27:18,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:27:18,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:27:18,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:27:18,826 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 174 [2021-03-26 10:27:18,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:27:18,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 174 [2021-03-26 10:27:18,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:27:18,858 INFO L129 PetriNetUnfolder]: 16/73 cut-off events. [2021-03-26 10:27:18,859 INFO L130 PetriNetUnfolder]: For 140/159 co-relation queries the response was YES. [2021-03-26 10:27:18,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 73 events. 16/73 cut-off events. For 140/159 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 277 event pairs, 7 based on Foata normal form. 9/79 useless extension candidates. Maximal degree in co-relation 175. Up to 34 conditions per place. [2021-03-26 10:27:18,860 INFO L132 encePairwiseOnDemand]: 169/174 looper letters, 2 selfloop transitions, 3 changer transitions 3/26 dead transitions. [2021-03-26 10:27:18,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 26 transitions, 127 flow [2021-03-26 10:27:18,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:27:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:27:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2021-03-26 10:27:18,862 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8175287356321839 [2021-03-26 10:27:18,862 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2021-03-26 10:27:18,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2021-03-26 10:27:18,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:27:18,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2021-03-26 10:27:18,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,865 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:18,865 INFO L185 Difference]: Start difference. First operand has 36 places, 25 transitions, 106 flow. Second operand 4 states and 569 transitions. [2021-03-26 10:27:18,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 26 transitions, 127 flow [2021-03-26 10:27:18,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 26 transitions, 127 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:27:18,867 INFO L241 Difference]: Finished difference. Result has 40 places, 23 transitions, 102 flow [2021-03-26 10:27:18,867 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2021-03-26 10:27:18,867 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2021-03-26 10:27:18,867 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:27:18,868 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 23 transitions, 102 flow [2021-03-26 10:27:18,868 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 23 transitions, 102 flow [2021-03-26 10:27:18,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 23 transitions, 102 flow [2021-03-26 10:27:18,898 INFO L129 PetriNetUnfolder]: 6/44 cut-off events. [2021-03-26 10:27:18,898 INFO L130 PetriNetUnfolder]: For 38/40 co-relation queries the response was YES. [2021-03-26 10:27:18,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 44 events. 6/44 cut-off events. For 38/40 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 107 event pairs, 2 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 94. Up to 18 conditions per place. [2021-03-26 10:27:18,899 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-26 10:27:19,112 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:27:19,516 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2021-03-26 10:27:19,651 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:27:19,876 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-26 10:27:20,154 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 85 [2021-03-26 10:27:20,313 INFO L154 LiptonReduction]: Checked pairs total: 268 [2021-03-26 10:27:20,313 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:27:20,314 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1447 [2021-03-26 10:27:20,314 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 113 flow [2021-03-26 10:27:20,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,315 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:27:20,315 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:27:20,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:27:20,315 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:27:20,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:27:20,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1495420800, now seen corresponding path program 2 times [2021-03-26 10:27:20,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:27:20,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880890910] [2021-03-26 10:27:20,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:27:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:27:20,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:20,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:20,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:20,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:27:20,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:20,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:27:20,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:20,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:27:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:27:20,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880890910] [2021-03-26 10:27:20,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:27:20,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:27:20,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38297641] [2021-03-26 10:27:20,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:27:20,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:27:20,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:27:20,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:27:20,379 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 178 [2021-03-26 10:27:20,380 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:27:20,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 178 [2021-03-26 10:27:20,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:27:20,440 INFO L129 PetriNetUnfolder]: 53/133 cut-off events. [2021-03-26 10:27:20,440 INFO L130 PetriNetUnfolder]: For 217/220 co-relation queries the response was YES. [2021-03-26 10:27:20,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 133 events. 53/133 cut-off events. For 217/220 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 555 event pairs, 19 based on Foata normal form. 4/129 useless extension candidates. Maximal degree in co-relation 383. Up to 83 conditions per place. [2021-03-26 10:27:20,442 INFO L132 encePairwiseOnDemand]: 171/178 looper letters, 9 selfloop transitions, 6 changer transitions 0/26 dead transitions. [2021-03-26 10:27:20,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 26 transitions, 155 flow [2021-03-26 10:27:20,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:27:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:27:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2021-03-26 10:27:20,444 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7851123595505618 [2021-03-26 10:27:20,444 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2021-03-26 10:27:20,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2021-03-26 10:27:20,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:27:20,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2021-03-26 10:27:20,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,447 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,447 INFO L185 Difference]: Start difference. First operand has 39 places, 22 transitions, 113 flow. Second operand 4 states and 559 transitions. [2021-03-26 10:27:20,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 26 transitions, 155 flow [2021-03-26 10:27:20,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 126 flow, removed 4 selfloop flow, removed 7 redundant places. [2021-03-26 10:27:20,449 INFO L241 Difference]: Finished difference. Result has 36 places, 25 transitions, 119 flow [2021-03-26 10:27:20,449 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2021-03-26 10:27:20,450 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -12 predicate places. [2021-03-26 10:27:20,450 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:27:20,450 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 25 transitions, 119 flow [2021-03-26 10:27:20,450 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 119 flow [2021-03-26 10:27:20,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 119 flow [2021-03-26 10:27:20,460 INFO L129 PetriNetUnfolder]: 27/78 cut-off events. [2021-03-26 10:27:20,460 INFO L130 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2021-03-26 10:27:20,461 INFO L84 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 78 events. 27/78 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 269 event pairs, 7 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 211. Up to 46 conditions per place. [2021-03-26 10:27:20,461 INFO L142 LiptonReduction]: Number of co-enabled transitions 124 [2021-03-26 10:27:20,474 INFO L154 LiptonReduction]: Checked pairs total: 81 [2021-03-26 10:27:20,474 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:27:20,474 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-26 10:27:20,475 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 119 flow [2021-03-26 10:27:20,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,475 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:27:20,475 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:27:20,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:27:20,475 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:27:20,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:27:20,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1358326890, now seen corresponding path program 1 times [2021-03-26 10:27:20,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:27:20,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685846645] [2021-03-26 10:27:20,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:27:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:27:20,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:20,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:20,524 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:27:20,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:27:20,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:20,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:27:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:27:20,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685846645] [2021-03-26 10:27:20,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:27:20,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:27:20,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743150128] [2021-03-26 10:27:20,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:27:20,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:27:20,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:27:20,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:27:20,534 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 178 [2021-03-26 10:27:20,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:27:20,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 178 [2021-03-26 10:27:20,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:27:20,594 INFO L129 PetriNetUnfolder]: 82/205 cut-off events. [2021-03-26 10:27:20,594 INFO L130 PetriNetUnfolder]: For 99/107 co-relation queries the response was YES. [2021-03-26 10:27:20,595 INFO L84 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 205 events. 82/205 cut-off events. For 99/107 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1014 event pairs, 30 based on Foata normal form. 18/211 useless extension candidates. Maximal degree in co-relation 507. Up to 95 conditions per place. [2021-03-26 10:27:20,595 INFO L132 encePairwiseOnDemand]: 172/178 looper letters, 8 selfloop transitions, 8 changer transitions 0/35 dead transitions. [2021-03-26 10:27:20,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 171 flow [2021-03-26 10:27:20,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:27:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:27:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2021-03-26 10:27:20,598 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.851685393258427 [2021-03-26 10:27:20,598 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2021-03-26 10:27:20,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2021-03-26 10:27:20,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:27:20,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2021-03-26 10:27:20,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,602 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,602 INFO L185 Difference]: Start difference. First operand has 36 places, 25 transitions, 119 flow. Second operand 5 states and 758 transitions. [2021-03-26 10:27:20,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 171 flow [2021-03-26 10:27:20,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 160 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 10:27:20,604 INFO L241 Difference]: Finished difference. Result has 41 places, 32 transitions, 168 flow [2021-03-26 10:27:20,604 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2021-03-26 10:27:20,604 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2021-03-26 10:27:20,605 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:27:20,605 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 168 flow [2021-03-26 10:27:20,605 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 168 flow [2021-03-26 10:27:20,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 168 flow [2021-03-26 10:27:20,664 INFO L129 PetriNetUnfolder]: 85/208 cut-off events. [2021-03-26 10:27:20,665 INFO L130 PetriNetUnfolder]: For 175/207 co-relation queries the response was YES. [2021-03-26 10:27:20,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 208 events. 85/208 cut-off events. For 175/207 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1082 event pairs, 29 based on Foata normal form. 5/199 useless extension candidates. Maximal degree in co-relation 601. Up to 93 conditions per place. [2021-03-26 10:27:20,667 INFO L142 LiptonReduction]: Number of co-enabled transitions 170 [2021-03-26 10:27:20,672 INFO L154 LiptonReduction]: Checked pairs total: 13 [2021-03-26 10:27:20,672 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:27:20,672 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 67 [2021-03-26 10:27:20,674 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 162 flow [2021-03-26 10:27:20,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,674 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:27:20,674 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:27:20,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:27:20,674 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:27:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:27:20,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1705050581, now seen corresponding path program 1 times [2021-03-26 10:27:20,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:27:20,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264076335] [2021-03-26 10:27:20,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:27:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:27:20,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:20,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:20,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:20,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:20,728 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:27:20,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:27:20,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:20,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:27:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:27:20,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264076335] [2021-03-26 10:27:20,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:27:20,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:27:20,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143844453] [2021-03-26 10:27:20,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:27:20,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:27:20,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:27:20,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:27:20,738 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 178 [2021-03-26 10:27:20,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:27:20,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 178 [2021-03-26 10:27:20,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:27:20,794 INFO L129 PetriNetUnfolder]: 37/119 cut-off events. [2021-03-26 10:27:20,794 INFO L130 PetriNetUnfolder]: For 123/149 co-relation queries the response was YES. [2021-03-26 10:27:20,795 INFO L84 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 119 events. 37/119 cut-off events. For 123/149 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 485 event pairs, 5 based on Foata normal form. 29/146 useless extension candidates. Maximal degree in co-relation 398. Up to 65 conditions per place. [2021-03-26 10:27:20,795 INFO L132 encePairwiseOnDemand]: 172/178 looper letters, 5 selfloop transitions, 11 changer transitions 3/38 dead transitions. [2021-03-26 10:27:20,796 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 240 flow [2021-03-26 10:27:20,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:27:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:27:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 909 transitions. [2021-03-26 10:27:20,798 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.851123595505618 [2021-03-26 10:27:20,798 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 909 transitions. [2021-03-26 10:27:20,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 909 transitions. [2021-03-26 10:27:20,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:27:20,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 909 transitions. [2021-03-26 10:27:20,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,803 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,803 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 162 flow. Second operand 6 states and 909 transitions. [2021-03-26 10:27:20,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 240 flow [2021-03-26 10:27:20,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 234 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:27:20,808 INFO L241 Difference]: Finished difference. Result has 45 places, 35 transitions, 226 flow [2021-03-26 10:27:20,808 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2021-03-26 10:27:20,809 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-26 10:27:20,809 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:27:20,809 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 226 flow [2021-03-26 10:27:20,809 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 226 flow [2021-03-26 10:27:20,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 226 flow [2021-03-26 10:27:20,822 INFO L129 PetriNetUnfolder]: 36/117 cut-off events. [2021-03-26 10:27:20,822 INFO L130 PetriNetUnfolder]: For 205/216 co-relation queries the response was YES. [2021-03-26 10:27:20,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 117 events. 36/117 cut-off events. For 205/216 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 5 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 414. Up to 62 conditions per place. [2021-03-26 10:27:20,823 INFO L142 LiptonReduction]: Number of co-enabled transitions 144 [2021-03-26 10:27:20,830 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-26 10:27:20,830 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:27:20,830 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-26 10:27:20,831 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 218 flow [2021-03-26 10:27:20,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,832 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:27:20,832 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:27:20,832 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:27:20,832 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:27:20,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:27:20,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1324032183, now seen corresponding path program 1 times [2021-03-26 10:27:20,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:27:20,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446124539] [2021-03-26 10:27:20,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:27:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:27:20,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:20,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:20,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:20,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:20,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:20,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:27:20,899 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:27:20,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:27:20,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:20,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:27:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:27:20,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446124539] [2021-03-26 10:27:20,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:27:20,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:27:20,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461607758] [2021-03-26 10:27:20,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:27:20,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:27:20,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:27:20,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:27:20,909 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 178 [2021-03-26 10:27:20,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:27:20,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 178 [2021-03-26 10:27:20,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:27:20,961 INFO L129 PetriNetUnfolder]: 21/73 cut-off events. [2021-03-26 10:27:20,961 INFO L130 PetriNetUnfolder]: For 147/155 co-relation queries the response was YES. [2021-03-26 10:27:20,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 73 events. 21/73 cut-off events. For 147/155 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 217 event pairs, 1 based on Foata normal form. 15/87 useless extension candidates. Maximal degree in co-relation 269. Up to 36 conditions per place. [2021-03-26 10:27:20,962 INFO L132 encePairwiseOnDemand]: 172/178 looper letters, 2 selfloop transitions, 11 changer transitions 3/35 dead transitions. [2021-03-26 10:27:20,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 35 transitions, 250 flow [2021-03-26 10:27:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:27:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:27:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1054 transitions. [2021-03-26 10:27:20,965 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8459069020866774 [2021-03-26 10:27:20,965 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1054 transitions. [2021-03-26 10:27:20,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1054 transitions. [2021-03-26 10:27:20,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:27:20,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1054 transitions. [2021-03-26 10:27:20,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 150.57142857142858) internal successors, (1054), 7 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,970 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:20,971 INFO L185 Difference]: Start difference. First operand has 45 places, 34 transitions, 218 flow. Second operand 7 states and 1054 transitions. [2021-03-26 10:27:20,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 35 transitions, 250 flow [2021-03-26 10:27:20,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 221 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-26 10:27:20,972 INFO L241 Difference]: Finished difference. Result has 48 places, 32 transitions, 201 flow [2021-03-26 10:27:20,973 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=201, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2021-03-26 10:27:20,973 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2021-03-26 10:27:20,973 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:27:20,973 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 32 transitions, 201 flow [2021-03-26 10:27:20,973 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 32 transitions, 201 flow [2021-03-26 10:27:20,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 32 transitions, 201 flow [2021-03-26 10:27:20,982 INFO L129 PetriNetUnfolder]: 19/70 cut-off events. [2021-03-26 10:27:20,982 INFO L130 PetriNetUnfolder]: For 96/98 co-relation queries the response was YES. [2021-03-26 10:27:20,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 70 events. 19/70 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 223 event pairs, 1 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 232. Up to 21 conditions per place. [2021-03-26 10:27:20,983 INFO L142 LiptonReduction]: Number of co-enabled transitions 84 [2021-03-26 10:27:21,304 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 10:27:21,448 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 10:27:22,061 WARN L205 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 194 [2021-03-26 10:27:22,279 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:27:23,701 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 348 DAG size of output: 276 [2021-03-26 10:27:24,327 WARN L205 SmtUtils]: Spent 623.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-26 10:27:24,332 INFO L154 LiptonReduction]: Checked pairs total: 14 [2021-03-26 10:27:24,332 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:27:24,333 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3360 [2021-03-26 10:27:24,333 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 185 flow [2021-03-26 10:27:24,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:24,334 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:27:24,334 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 10:27:24,334 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:27:24,334 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:27:24,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:27:24,334 INFO L82 PathProgramCache]: Analyzing trace with hash -128286261, now seen corresponding path program 1 times [2021-03-26 10:27:24,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:27:24,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032761637] [2021-03-26 10:27:24,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:27:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:27:24,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:27:24,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:27:24,434 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 10:27:24,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 10:27:24,455 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-26 10:27:24,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 10:27:24,484 INFO L142 QuantifierPusher]: treesize reduction 23, result has 80.8 percent of original size [2021-03-26 10:27:24,488 INFO L147 QuantifierPusher]: treesize reduction 9, result has 90.7 percent of original size 88 [2021-03-26 10:27:24,529 INFO L142 QuantifierPusher]: treesize reduction 29, result has 56.1 percent of original size [2021-03-26 10:27:24,530 INFO L147 QuantifierPusher]: treesize reduction 8, result has 78.4 percent of original size 29 [2021-03-26 10:27:24,552 INFO L142 QuantifierPusher]: treesize reduction 12, result has 73.3 percent of original size [2021-03-26 10:27:24,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 10:27:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:27:24,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032761637] [2021-03-26 10:27:24,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:27:24,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:27:24,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300851025] [2021-03-26 10:27:24,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:27:24,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:27:24,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:27:24,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:27:24,576 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 181 [2021-03-26 10:27:24,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 185 flow. Second operand has 8 states, 8 states have (on average 126.875) internal successors, (1015), 8 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:24,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:27:24,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 181 [2021-03-26 10:27:24,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:27:24,684 INFO L129 PetriNetUnfolder]: 25/81 cut-off events. [2021-03-26 10:27:24,684 INFO L130 PetriNetUnfolder]: For 196/216 co-relation queries the response was YES. [2021-03-26 10:27:24,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 81 events. 25/81 cut-off events. For 196/216 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 303 event pairs, 1 based on Foata normal form. 13/92 useless extension candidates. Maximal degree in co-relation 315. Up to 29 conditions per place. [2021-03-26 10:27:24,685 INFO L132 encePairwiseOnDemand]: 177/181 looper letters, 10 selfloop transitions, 2 changer transitions 7/34 dead transitions. [2021-03-26 10:27:24,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 255 flow [2021-03-26 10:27:24,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:27:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:27:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2021-03-26 10:27:24,688 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7154696132596685 [2021-03-26 10:27:24,688 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2021-03-26 10:27:24,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2021-03-26 10:27:24,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:27:24,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2021-03-26 10:27:24,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:24,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:24,691 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:24,691 INFO L185 Difference]: Start difference. First operand has 43 places, 28 transitions, 185 flow. Second operand 4 states and 518 transitions. [2021-03-26 10:27:24,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 255 flow [2021-03-26 10:27:24,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 213 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-26 10:27:24,693 INFO L241 Difference]: Finished difference. Result has 41 places, 27 transitions, 147 flow [2021-03-26 10:27:24,693 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2021-03-26 10:27:24,693 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2021-03-26 10:27:24,693 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:27:24,693 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 147 flow [2021-03-26 10:27:24,693 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 27 transitions, 147 flow [2021-03-26 10:27:24,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 147 flow [2021-03-26 10:27:24,699 INFO L129 PetriNetUnfolder]: 16/53 cut-off events. [2021-03-26 10:27:24,699 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2021-03-26 10:27:24,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 53 events. 16/53 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 144 event pairs, 1 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 147. Up to 17 conditions per place. [2021-03-26 10:27:24,700 INFO L142 LiptonReduction]: Number of co-enabled transitions 46 [2021-03-26 10:27:24,980 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2021-03-26 10:27:25,466 WARN L205 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 97 [2021-03-26 10:27:25,637 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-26 10:27:25,641 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:27:25,641 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:27:25,641 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 948 [2021-03-26 10:27:25,641 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 149 flow [2021-03-26 10:27:25,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 126.875) internal successors, (1015), 8 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:27:25,642 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:27:25,642 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:27:25,642 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:27:25,642 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:27:25,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:27:25,643 INFO L82 PathProgramCache]: Analyzing trace with hash 196762574, now seen corresponding path program 1 times [2021-03-26 10:27:25,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:27:25,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156126657] [2021-03-26 10:27:25,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:27:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:27:25,670 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:27:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:27:25,698 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:27:25,723 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:27:25,723 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:27:25,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:27:25,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:27:25 BasicIcfg [2021-03-26 10:27:25,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:27:25,792 INFO L168 Benchmark]: Toolchain (without parser) took 24372.41 ms. Allocated memory was 255.9 MB in the beginning and 629.1 MB in the end (delta: 373.3 MB). Free memory was 232.3 MB in the beginning and 449.2 MB in the end (delta: -217.0 MB). Peak memory consumption was 155.4 MB. Max. memory is 16.0 GB. [2021-03-26 10:27:25,793 INFO L168 Benchmark]: CDTParser took 0.63 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.6 MB in the end (delta: 171.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:27:25,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.39 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 232.3 MB in the beginning and 307.1 MB in the end (delta: -74.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:27:25,794 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.08 ms. Allocated memory is still 348.1 MB. Free memory was 307.1 MB in the beginning and 304.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:27:25,794 INFO L168 Benchmark]: Boogie Preprocessor took 47.59 ms. Allocated memory is still 348.1 MB. Free memory was 304.3 MB in the beginning and 301.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:27:25,794 INFO L168 Benchmark]: RCFGBuilder took 2030.86 ms. Allocated memory is still 348.1 MB. Free memory was 301.5 MB in the beginning and 284.4 MB in the end (delta: 17.1 MB). Peak memory consumption was 65.4 MB. Max. memory is 16.0 GB. [2021-03-26 10:27:25,795 INFO L168 Benchmark]: TraceAbstraction took 21570.82 ms. Allocated memory was 348.1 MB in the beginning and 629.1 MB in the end (delta: 281.0 MB). Free memory was 284.4 MB in the beginning and 449.2 MB in the end (delta: -164.8 MB). Peak memory consumption was 116.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:27:25,800 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.63 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.6 MB in the end (delta: 171.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 633.39 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 232.3 MB in the beginning and 307.1 MB in the end (delta: -74.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 83.08 ms. Allocated memory is still 348.1 MB. Free memory was 307.1 MB in the beginning and 304.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 47.59 ms. Allocated memory is still 348.1 MB. Free memory was 304.3 MB in the beginning and 301.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2030.86 ms. Allocated memory is still 348.1 MB. Free memory was 301.5 MB in the beginning and 284.4 MB in the end (delta: 17.1 MB). Peak memory consumption was 65.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 21570.82 ms. Allocated memory was 348.1 MB in the beginning and 629.1 MB in the end (delta: 281.0 MB). Free memory was 284.4 MB in the beginning and 449.2 MB in the end (delta: -164.8 MB). Peak memory consumption was 116.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: 8032.3ms, 102 PlacesBefore, 48 PlacesAfterwards, 94 TransitionsBefore, 39 TransitionsAfterwards, 1686 CoEnabledTransitionPairs, 4 FixpointIterations, 26 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 2882 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1376, positive: 1304, positive conditional: 1304, positive unconditional: 0, negative: 72, negative conditional: 72, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1376, positive: 1304, positive conditional: 0, positive unconditional: 1304, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1376, positive: 1304, positive conditional: 0, positive unconditional: 1304, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1081, positive: 1047, positive conditional: 0, positive unconditional: 1047, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1081, positive: 1038, positive conditional: 0, positive unconditional: 1038, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 620, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 587, negative conditional: 0, negative unconditional: 587, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1376, positive: 257, positive conditional: 0, positive unconditional: 257, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 1081, unknown conditional: 0, unknown unconditional: 1081] , Statistics on independence cache: Total cache size (in pairs): 1081, Positive cache size: 1047, Positive conditional cache size: 0, Positive unconditional cache size: 1047, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3185.3ms, 45 PlacesBefore, 33 PlacesAfterwards, 32 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 1242 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 351, positive: 262, positive conditional: 262, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 351, positive: 262, positive conditional: 15, positive unconditional: 247, negative: 89, negative conditional: 4, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 351, positive: 262, positive conditional: 15, positive unconditional: 247, negative: 89, negative conditional: 4, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 58, positive: 49, positive conditional: 1, positive unconditional: 48, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 58, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 255, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 168, negative conditional: 19, negative unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 351, positive: 213, positive conditional: 14, positive unconditional: 199, negative: 80, negative conditional: 3, negative unconditional: 77, unknown: 58, unknown conditional: 2, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 1139, Positive cache size: 1096, Positive conditional cache size: 1, Positive unconditional cache size: 1095, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1267.0ms, 34 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 777 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, positive: 156, positive conditional: 156, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 216, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 216, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 216, positive: 146, positive conditional: 0, positive unconditional: 146, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 1151, Positive cache size: 1106, Positive conditional cache size: 1, Positive unconditional cache size: 1105, Negative cache size: 45, Negative conditional cache size: 1, Negative unconditional cache size: 44, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 250.1ms, 34 PlacesBefore, 34 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 199 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 241, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 241, negative conditional: 4, negative unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 12, unknown conditional: 1, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 1163, Positive cache size: 1110, Positive conditional cache size: 1, Positive unconditional cache size: 1109, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7ms, 34 PlacesBefore, 34 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 184 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 60, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1171, Positive cache size: 1118, Positive conditional cache size: 1, Positive unconditional cache size: 1117, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.5ms, 39 PlacesBefore, 36 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 328 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, positive: 84, positive conditional: 84, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 84, positive conditional: 2, positive unconditional: 82, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 84, positive conditional: 2, positive unconditional: 82, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1175, Positive cache size: 1122, Positive conditional cache size: 3, Positive unconditional cache size: 1119, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 232.5ms, 36 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 208 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, positive: 65, positive conditional: 3, positive unconditional: 62, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, positive: 65, positive conditional: 3, positive unconditional: 62, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, positive: 52, positive conditional: 3, positive unconditional: 49, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 1193, Positive cache size: 1135, Positive conditional cache size: 3, Positive unconditional cache size: 1132, Negative cache size: 58, Negative conditional cache size: 2, Negative unconditional cache size: 56, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1445.7ms, 40 PlacesBefore, 39 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 268 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113, positive: 85, positive conditional: 85, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 113, positive: 85, positive conditional: 16, positive unconditional: 69, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113, positive: 85, positive conditional: 16, positive unconditional: 69, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 11, positive conditional: 9, positive unconditional: 2, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 125, positive: 40, positive conditional: 37, positive unconditional: 3, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 113, positive: 74, positive conditional: 7, positive unconditional: 67, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 16, unknown conditional: 9, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 1209, Positive cache size: 1146, Positive conditional cache size: 12, Positive unconditional cache size: 1134, Negative cache size: 63, Negative conditional cache size: 2, Negative unconditional cache size: 61, Eliminated conditions: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.1ms, 36 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 81 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1210, Positive cache size: 1146, Positive conditional cache size: 12, Positive unconditional cache size: 1134, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.9ms, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 13 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, positive: 13, positive conditional: 12, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 12, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 12, positive unconditional: 1, 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: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 13, unknown conditional: 12, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1223, Positive cache size: 1159, Positive conditional cache size: 24, Positive unconditional cache size: 1135, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.9ms, 45 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 9, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1229, Positive cache size: 1165, Positive conditional cache size: 30, Positive unconditional cache size: 1135, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3359.2ms, 48 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 28 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 14 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, positive: 14, positive conditional: 10, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 10, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 4, positive unconditional: 1, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 14, positive: 9, positive conditional: 6, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1234, Positive cache size: 1170, Positive conditional cache size: 34, Positive unconditional cache size: 1136, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 947.6ms, 41 PlacesBefore, 40 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1234, Positive cache size: 1170, Positive conditional cache size: 34, Positive unconditional cache size: 1136, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1816; [L819] FCALL, FORK 0 pthread_create(&t1816, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1817; [L821] FCALL, FORK 0 pthread_create(&t1817, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1818; [L823] FCALL, FORK 0 pthread_create(&t1818, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L741] 1 __unbuffered_p0_EAX = y [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 21401.2ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 840.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8118.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 46 SDtfs, 32 SDslu, 20 SDs, 0 SdLazy, 215 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 252.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 282.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=10, InterpolantAutomatonStates: 52, 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: 38.1ms SsaConstructionTime, 382.4ms SatisfiabilityAnalysisTime, 867.7ms InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...