/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:23:12,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:23:12,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:23:12,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:23:12,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:23:12,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:23:12,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:23:12,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:23:12,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:23:12,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:23:12,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:23:12,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:23:12,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:23:12,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:23:12,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:23:12,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:23:12,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:23:12,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:23:12,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:23:12,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:23:12,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:23:13,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:23:13,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:23:13,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:23:13,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:23:13,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:23:13,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:23:13,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:23:13,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:23:13,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:23:13,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:23:13,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:23:13,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:23:13,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:23:13,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:23:13,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:23:13,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:23:13,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:23:13,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:23:13,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:23:13,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:23:13,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:23:13,052 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:23:13,052 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:23:13,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:23:13,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:23:13,056 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:23:13,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:23:13,056 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:23:13,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:23:13,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:23:13,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:23:13,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:23:13,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:23:13,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:23:13,058 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:23:13,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:23:13,058 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:23:13,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:23:13,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:23:13,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:23:13,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:23:13,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:23:13,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:23:13,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:23:13,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:23:13,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:23:13,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:23:13,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:23:13,060 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:23:13,060 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:23:13,060 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:23:13,060 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:23:13,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:23:13,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:23:13,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:23:13,389 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:23:13,390 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:23:13,391 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.opt.i [2021-03-26 00:23:13,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c1b809b/ed747e0e27db44f2ad821b5a993962bf/FLAGdaee4a594 [2021-03-26 00:23:13,896 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:23:13,897 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.opt.i [2021-03-26 00:23:13,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c1b809b/ed747e0e27db44f2ad821b5a993962bf/FLAGdaee4a594 [2021-03-26 00:23:14,190 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c1b809b/ed747e0e27db44f2ad821b5a993962bf [2021-03-26 00:23:14,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:23:14,195 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:23:14,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:23:14,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:23:14,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:23:14,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:23:14" (1/1) ... [2021-03-26 00:23:14,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3266bb30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:14, skipping insertion in model container [2021-03-26 00:23:14,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:23:14" (1/1) ... [2021-03-26 00:23:14,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:23:14,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:23:14,363 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/mix053_tso.opt.i[948,961] [2021-03-26 00:23:14,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:23:14,595 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:23:14,605 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/mix053_tso.opt.i[948,961] [2021-03-26 00:23:14,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:23:14,735 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:23:14,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:14 WrapperNode [2021-03-26 00:23:14,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:23:14,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:23:14,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:23:14,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:23:14,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:14" (1/1) ... [2021-03-26 00:23:14,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:14" (1/1) ... [2021-03-26 00:23:14,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:23:14,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:23:14,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:23:14,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:23:14,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:14" (1/1) ... [2021-03-26 00:23:14,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:14" (1/1) ... [2021-03-26 00:23:14,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:14" (1/1) ... [2021-03-26 00:23:14,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:14" (1/1) ... [2021-03-26 00:23:14,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:14" (1/1) ... [2021-03-26 00:23:14,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:14" (1/1) ... [2021-03-26 00:23:14,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:14" (1/1) ... [2021-03-26 00:23:14,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:23:14,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:23:14,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:23:14,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:23:14,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:23:14,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:23:14,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:23:14,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:23:14,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:23:14,934 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:23:14,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:23:14,935 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:23:14,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:23:14,935 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:23:14,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:23:14,935 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:23:14,936 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:23:14,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:23:14,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:23:14,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:23:14,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:23:14,938 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:23:16,342 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:23:16,343 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:23:16,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:23:16 BoogieIcfgContainer [2021-03-26 00:23:16,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:23:16,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:23:16,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:23:16,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:23:16,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:23:14" (1/3) ... [2021-03-26 00:23:16,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228f34ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:23:16, skipping insertion in model container [2021-03-26 00:23:16,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:23:14" (2/3) ... [2021-03-26 00:23:16,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228f34ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:23:16, skipping insertion in model container [2021-03-26 00:23:16,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:23:16" (3/3) ... [2021-03-26 00:23:16,350 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_tso.opt.i [2021-03-26 00:23:16,356 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:23:16,360 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:23:16,361 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:23:16,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,403 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,404 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,404 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,404 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,405 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,405 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,405 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,405 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,405 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,405 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,405 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,406 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,407 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,407 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,407 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,407 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,417 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,418 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,418 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,418 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,419 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,419 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,419 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,419 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,420 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,420 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,424 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,424 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,427 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,427 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,429 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,430 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,430 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,432 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,432 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:23:16,433 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:23:16,449 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:23:16,465 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:23:16,465 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:23:16,466 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:23:16,466 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:23:16,466 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:23:16,466 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:23:16,466 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:23:16,466 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:23:16,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2021-03-26 00:23:16,511 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-03-26 00:23:16,511 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:23:16,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-03-26 00:23:16,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow [2021-03-26 00:23:16,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow [2021-03-26 00:23:16,522 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:16,532 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow [2021-03-26 00:23:16,534 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow [2021-03-26 00:23:16,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow [2021-03-26 00:23:16,554 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-03-26 00:23:16,554 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:23:16,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-03-26 00:23:16,557 INFO L142 LiptonReduction]: Number of co-enabled transitions 2300 [2021-03-26 00:23:17,830 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:23:18,166 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:23:18,289 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:23:19,815 INFO L154 LiptonReduction]: Checked pairs total: 3631 [2021-03-26 00:23:19,815 INFO L156 LiptonReduction]: Total number of compositions: 72 [2021-03-26 00:23:19,818 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3297 [2021-03-26 00:23:19,837 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-26 00:23:19,837 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:23:19,840 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:19,841 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 00:23:19,841 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:19,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:19,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1070938441, now seen corresponding path program 1 times [2021-03-26 00:23:19,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:19,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122275666] [2021-03-26 00:23:19,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:20,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:20,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:20,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:20,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:20,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122275666] [2021-03-26 00:23:20,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:20,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:23:20,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699283231] [2021-03-26 00:23:20,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:23:20,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:20,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:23:20,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:23:20,122 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 184 [2021-03-26 00:23:20,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:20,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:20,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 184 [2021-03-26 00:23:20,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:20,162 INFO L129 PetriNetUnfolder]: 9/63 cut-off events. [2021-03-26 00:23:20,162 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:23:20,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 63 events. 9/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 1 based on Foata normal form. 5/65 useless extension candidates. Maximal degree in co-relation 77. Up to 17 conditions per place. [2021-03-26 00:23:20,163 INFO L132 encePairwiseOnDemand]: 180/184 looper letters, 5 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2021-03-26 00:23:20,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 42 transitions, 110 flow [2021-03-26 00:23:20,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:23:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:23:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2021-03-26 00:23:20,176 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202898550724637 [2021-03-26 00:23:20,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2021-03-26 00:23:20,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2021-03-26 00:23:20,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:20,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2021-03-26 00:23:20,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:20,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:20,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:20,192 INFO L185 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 3 states and 508 transitions. [2021-03-26 00:23:20,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 42 transitions, 110 flow [2021-03-26 00:23:20,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 106 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:23:20,197 INFO L241 Difference]: Finished difference. Result has 51 places, 40 transitions, 92 flow [2021-03-26 00:23:20,198 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2021-03-26 00:23:20,199 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2021-03-26 00:23:20,199 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:20,199 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 40 transitions, 92 flow [2021-03-26 00:23:20,199 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 92 flow [2021-03-26 00:23:20,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 92 flow [2021-03-26 00:23:20,204 INFO L129 PetriNetUnfolder]: 0/40 cut-off events. [2021-03-26 00:23:20,205 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:23:20,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:23:20,205 INFO L142 LiptonReduction]: Number of co-enabled transitions 432 [2021-03-26 00:23:21,289 INFO L154 LiptonReduction]: Checked pairs total: 1559 [2021-03-26 00:23:21,289 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 00:23:21,289 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1090 [2021-03-26 00:23:21,291 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-26 00:23:21,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:21,292 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:21,292 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:21,292 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:23:21,292 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:21,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:21,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1308224493, now seen corresponding path program 1 times [2021-03-26 00:23:21,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:21,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122453624] [2021-03-26 00:23:21,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:21,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:21,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:21,452 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:23:21,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:23:21,463 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:23:21,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:23:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:21,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122453624] [2021-03-26 00:23:21,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:21,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:23:21,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305224274] [2021-03-26 00:23:21,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:23:21,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:21,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:23:21,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:23:21,473 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 196 [2021-03-26 00:23:21,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand 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 00:23:21,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:21,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 196 [2021-03-26 00:23:21,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:21,638 INFO L129 PetriNetUnfolder]: 303/672 cut-off events. [2021-03-26 00:23:21,638 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:23:21,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 672 events. 303/672 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4166 event pairs, 54 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 1157. Up to 189 conditions per place. [2021-03-26 00:23:21,643 INFO L132 encePairwiseOnDemand]: 187/196 looper letters, 7 selfloop transitions, 7 changer transitions 15/48 dead transitions. [2021-03-26 00:23:21,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 164 flow [2021-03-26 00:23:21,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:23:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:23:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 829 transitions. [2021-03-26 00:23:21,647 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8459183673469388 [2021-03-26 00:23:21,647 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 829 transitions. [2021-03-26 00:23:21,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 829 transitions. [2021-03-26 00:23:21,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:21,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 829 transitions. [2021-03-26 00:23:21,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:21,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:21,653 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:21,653 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 5 states and 829 transitions. [2021-03-26 00:23:21,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 164 flow [2021-03-26 00:23:21,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:23:21,655 INFO L241 Difference]: Finished difference. Result has 46 places, 33 transitions, 128 flow [2021-03-26 00:23:21,655 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2021-03-26 00:23:21,655 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -9 predicate places. [2021-03-26 00:23:21,656 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:21,656 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 128 flow [2021-03-26 00:23:21,656 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 33 transitions, 128 flow [2021-03-26 00:23:21,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 128 flow [2021-03-26 00:23:21,697 INFO L129 PetriNetUnfolder]: 158/387 cut-off events. [2021-03-26 00:23:21,697 INFO L130 PetriNetUnfolder]: For 135/187 co-relation queries the response was YES. [2021-03-26 00:23:21,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 387 events. 158/387 cut-off events. For 135/187 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2328 event pairs, 66 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 895. Up to 189 conditions per place. [2021-03-26 00:23:21,703 INFO L142 LiptonReduction]: Number of co-enabled transitions 392 [2021-03-26 00:23:22,420 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 00:23:22,559 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:23:22,877 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 00:23:23,039 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:23:23,052 INFO L154 LiptonReduction]: Checked pairs total: 288 [2021-03-26 00:23:23,052 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:23:23,052 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1396 [2021-03-26 00:23:23,056 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 124 flow [2021-03-26 00:23:23,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 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 00:23:23,056 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:23,056 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:23,056 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:23:23,057 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:23,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:23,057 INFO L82 PathProgramCache]: Analyzing trace with hash -265045011, now seen corresponding path program 1 times [2021-03-26 00:23:23,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:23,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803442176] [2021-03-26 00:23:23,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:23,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:23,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:23,160 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:23:23,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:23:23,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:23,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803442176] [2021-03-26 00:23:23,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:23,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:23:23,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063254678] [2021-03-26 00:23:23,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:23:23,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:23,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:23:23,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:23:23,175 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 198 [2021-03-26 00:23:23,176 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:23,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:23,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 198 [2021-03-26 00:23:23,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:23,256 INFO L129 PetriNetUnfolder]: 133/352 cut-off events. [2021-03-26 00:23:23,256 INFO L130 PetriNetUnfolder]: For 170/718 co-relation queries the response was YES. [2021-03-26 00:23:23,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 352 events. 133/352 cut-off events. For 170/718 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2040 event pairs, 30 based on Foata normal form. 7/338 useless extension candidates. Maximal degree in co-relation 1026. Up to 163 conditions per place. [2021-03-26 00:23:23,260 INFO L132 encePairwiseOnDemand]: 190/198 looper letters, 13 selfloop transitions, 11 changer transitions 0/41 dead transitions. [2021-03-26 00:23:23,260 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 232 flow [2021-03-26 00:23:23,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:23:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:23:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 680 transitions. [2021-03-26 00:23:23,263 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8585858585858586 [2021-03-26 00:23:23,263 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 680 transitions. [2021-03-26 00:23:23,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 680 transitions. [2021-03-26 00:23:23,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:23,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 680 transitions. [2021-03-26 00:23:23,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:23,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:23,267 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:23,267 INFO L185 Difference]: Start difference. First operand has 40 places, 31 transitions, 124 flow. Second operand 4 states and 680 transitions. [2021-03-26 00:23:23,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 232 flow [2021-03-26 00:23:23,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 186 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-26 00:23:23,271 INFO L241 Difference]: Finished difference. Result has 42 places, 38 transitions, 182 flow [2021-03-26 00:23:23,271 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2021-03-26 00:23:23,272 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -13 predicate places. [2021-03-26 00:23:23,272 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:23,272 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 182 flow [2021-03-26 00:23:23,273 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 38 transitions, 182 flow [2021-03-26 00:23:23,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 182 flow [2021-03-26 00:23:23,305 INFO L129 PetriNetUnfolder]: 133/326 cut-off events. [2021-03-26 00:23:23,306 INFO L130 PetriNetUnfolder]: For 196/274 co-relation queries the response was YES. [2021-03-26 00:23:23,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 326 events. 133/326 cut-off events. For 196/274 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1820 event pairs, 34 based on Foata normal form. 1/309 useless extension candidates. Maximal degree in co-relation 821. Up to 163 conditions per place. [2021-03-26 00:23:23,310 INFO L142 LiptonReduction]: Number of co-enabled transitions 508 [2021-03-26 00:23:23,474 INFO L154 LiptonReduction]: Checked pairs total: 315 [2021-03-26 00:23:23,475 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:23:23,475 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 203 [2021-03-26 00:23:23,476 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 182 flow [2021-03-26 00:23:23,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:23,477 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:23,477 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:23,477 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:23:23,477 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:23,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1244652095, now seen corresponding path program 1 times [2021-03-26 00:23:23,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:23,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986916829] [2021-03-26 00:23:23,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:23,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:23,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:23,543 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:23:23,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:23:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:23,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986916829] [2021-03-26 00:23:23,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:23,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:23:23,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050596655] [2021-03-26 00:23:23,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:23:23,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:23,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:23:23,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:23:23,554 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 198 [2021-03-26 00:23:23,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:23,555 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:23,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 198 [2021-03-26 00:23:23,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:23,605 INFO L129 PetriNetUnfolder]: 117/295 cut-off events. [2021-03-26 00:23:23,605 INFO L130 PetriNetUnfolder]: For 255/903 co-relation queries the response was YES. [2021-03-26 00:23:23,606 INFO L84 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 295 events. 117/295 cut-off events. For 255/903 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1574 event pairs, 30 based on Foata normal form. 11/289 useless extension candidates. Maximal degree in co-relation 946. Up to 143 conditions per place. [2021-03-26 00:23:23,608 INFO L132 encePairwiseOnDemand]: 190/198 looper letters, 14 selfloop transitions, 17 changer transitions 0/48 dead transitions. [2021-03-26 00:23:23,608 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 302 flow [2021-03-26 00:23:23,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:23:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:23:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 680 transitions. [2021-03-26 00:23:23,610 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8585858585858586 [2021-03-26 00:23:23,610 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 680 transitions. [2021-03-26 00:23:23,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 680 transitions. [2021-03-26 00:23:23,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:23,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 680 transitions. [2021-03-26 00:23:23,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:23,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:23,614 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:23,614 INFO L185 Difference]: Start difference. First operand has 42 places, 38 transitions, 182 flow. Second operand 4 states and 680 transitions. [2021-03-26 00:23:23,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 302 flow [2021-03-26 00:23:23,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 302 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:23:23,619 INFO L241 Difference]: Finished difference. Result has 47 places, 45 transitions, 288 flow [2021-03-26 00:23:23,619 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2021-03-26 00:23:23,619 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -8 predicate places. [2021-03-26 00:23:23,619 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:23,620 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 45 transitions, 288 flow [2021-03-26 00:23:23,620 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 45 transitions, 288 flow [2021-03-26 00:23:23,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 45 transitions, 288 flow [2021-03-26 00:23:23,652 INFO L129 PetriNetUnfolder]: 117/294 cut-off events. [2021-03-26 00:23:23,652 INFO L130 PetriNetUnfolder]: For 533/722 co-relation queries the response was YES. [2021-03-26 00:23:23,653 INFO L84 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 294 events. 117/294 cut-off events. For 533/722 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1561 event pairs, 30 based on Foata normal form. 1/279 useless extension candidates. Maximal degree in co-relation 938. Up to 143 conditions per place. [2021-03-26 00:23:23,656 INFO L142 LiptonReduction]: Number of co-enabled transitions 604 [2021-03-26 00:23:23,667 INFO L154 LiptonReduction]: Checked pairs total: 555 [2021-03-26 00:23:23,667 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:23:23,668 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-03-26 00:23:23,671 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 288 flow [2021-03-26 00:23:23,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:23,671 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:23,671 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:23,671 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:23:23,672 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:23,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:23,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1189369242, now seen corresponding path program 1 times [2021-03-26 00:23:23,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:23,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605492930] [2021-03-26 00:23:23,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:23,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:23,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:23,760 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:23:23,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:23:23,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:23,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:23,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605492930] [2021-03-26 00:23:23,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:23,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:23:23,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548417682] [2021-03-26 00:23:23,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:23:23,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:23,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:23:23,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:23:23,774 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-26 00:23:23,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:23,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:23,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-26 00:23:23,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:23,967 INFO L129 PetriNetUnfolder]: 881/1637 cut-off events. [2021-03-26 00:23:23,967 INFO L130 PetriNetUnfolder]: For 858/1071 co-relation queries the response was YES. [2021-03-26 00:23:23,976 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3895 conditions, 1637 events. 881/1637 cut-off events. For 858/1071 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 11842 event pairs, 367 based on Foata normal form. 113/1426 useless extension candidates. Maximal degree in co-relation 3877. Up to 1111 conditions per place. [2021-03-26 00:23:23,985 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 12 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2021-03-26 00:23:23,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 360 flow [2021-03-26 00:23:23,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:23:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:23:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2021-03-26 00:23:23,988 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8424242424242424 [2021-03-26 00:23:23,988 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 834 transitions. [2021-03-26 00:23:23,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 834 transitions. [2021-03-26 00:23:23,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:23,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 834 transitions. [2021-03-26 00:23:23,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:23,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:23,993 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:23,993 INFO L185 Difference]: Start difference. First operand has 47 places, 45 transitions, 288 flow. Second operand 5 states and 834 transitions. [2021-03-26 00:23:23,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 360 flow [2021-03-26 00:23:23,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 360 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:23:23,999 INFO L241 Difference]: Finished difference. Result has 54 places, 54 transitions, 363 flow [2021-03-26 00:23:23,999 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=363, PETRI_PLACES=54, PETRI_TRANSITIONS=54} [2021-03-26 00:23:23,999 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2021-03-26 00:23:23,999 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:23,999 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 54 transitions, 363 flow [2021-03-26 00:23:24,000 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 54 transitions, 363 flow [2021-03-26 00:23:24,000 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 54 transitions, 363 flow [2021-03-26 00:23:24,136 INFO L129 PetriNetUnfolder]: 677/1312 cut-off events. [2021-03-26 00:23:24,136 INFO L130 PetriNetUnfolder]: For 1362/1877 co-relation queries the response was YES. [2021-03-26 00:23:24,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4099 conditions, 1312 events. 677/1312 cut-off events. For 1362/1877 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 9413 event pairs, 261 based on Foata normal form. 8/1147 useless extension candidates. Maximal degree in co-relation 4078. Up to 864 conditions per place. [2021-03-26 00:23:24,157 INFO L142 LiptonReduction]: Number of co-enabled transitions 888 [2021-03-26 00:23:24,291 INFO L154 LiptonReduction]: Checked pairs total: 575 [2021-03-26 00:23:24,291 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:23:24,291 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 292 [2021-03-26 00:23:24,292 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 357 flow [2021-03-26 00:23:24,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:24,293 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:24,293 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:24,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:23:24,293 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:24,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:24,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1084019877, now seen corresponding path program 1 times [2021-03-26 00:23:24,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:24,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788306635] [2021-03-26 00:23:24,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:24,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:24,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:24,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:24,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:24,328 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:23:24,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:23:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:24,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788306635] [2021-03-26 00:23:24,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:24,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:23:24,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008078787] [2021-03-26 00:23:24,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:23:24,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:24,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:23:24,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:23:24,338 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 198 [2021-03-26 00:23:24,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 357 flow. Second operand has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:24,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:24,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 198 [2021-03-26 00:23:24,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:24,521 INFO L129 PetriNetUnfolder]: 834/1573 cut-off events. [2021-03-26 00:23:24,521 INFO L130 PetriNetUnfolder]: For 2192/3510 co-relation queries the response was YES. [2021-03-26 00:23:24,530 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5184 conditions, 1573 events. 834/1573 cut-off events. For 2192/3510 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 11055 event pairs, 393 based on Foata normal form. 81/1468 useless extension candidates. Maximal degree in co-relation 5161. Up to 1078 conditions per place. [2021-03-26 00:23:24,538 INFO L132 encePairwiseOnDemand]: 190/198 looper letters, 19 selfloop transitions, 18 changer transitions 0/58 dead transitions. [2021-03-26 00:23:24,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 484 flow [2021-03-26 00:23:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:23:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:23:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 679 transitions. [2021-03-26 00:23:24,541 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8573232323232324 [2021-03-26 00:23:24,541 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 679 transitions. [2021-03-26 00:23:24,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 679 transitions. [2021-03-26 00:23:24,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:24,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 679 transitions. [2021-03-26 00:23:24,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:24,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:24,544 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:24,544 INFO L185 Difference]: Start difference. First operand has 54 places, 53 transitions, 357 flow. Second operand 4 states and 679 transitions. [2021-03-26 00:23:24,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 484 flow [2021-03-26 00:23:24,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 477 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:23:24,555 INFO L241 Difference]: Finished difference. Result has 56 places, 54 transitions, 465 flow [2021-03-26 00:23:24,556 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=465, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2021-03-26 00:23:24,556 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 1 predicate places. [2021-03-26 00:23:24,556 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:24,556 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 54 transitions, 465 flow [2021-03-26 00:23:24,556 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 54 transitions, 465 flow [2021-03-26 00:23:24,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 54 transitions, 465 flow [2021-03-26 00:23:24,710 INFO L129 PetriNetUnfolder]: 860/1614 cut-off events. [2021-03-26 00:23:24,710 INFO L130 PetriNetUnfolder]: For 2483/3038 co-relation queries the response was YES. [2021-03-26 00:23:24,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5114 conditions, 1614 events. 860/1614 cut-off events. For 2483/3038 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 11451 event pairs, 389 based on Foata normal form. 6/1471 useless extension candidates. Maximal degree in co-relation 5090. Up to 1088 conditions per place. [2021-03-26 00:23:24,736 INFO L142 LiptonReduction]: Number of co-enabled transitions 818 [2021-03-26 00:23:24,830 INFO L154 LiptonReduction]: Checked pairs total: 291 [2021-03-26 00:23:24,830 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:23:24,830 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 274 [2021-03-26 00:23:24,834 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 465 flow [2021-03-26 00:23:24,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:24,834 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:24,834 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:24,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:23:24,835 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:24,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:24,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1186813785, now seen corresponding path program 1 times [2021-03-26 00:23:24,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:24,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735794004] [2021-03-26 00:23:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:24,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:24,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:24,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:24,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:24,900 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:23:24,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:23:24,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:24,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:24,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735794004] [2021-03-26 00:23:24,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:24,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:23:24,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325159317] [2021-03-26 00:23:24,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:23:24,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:24,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:23:24,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:23:24,915 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-26 00:23:24,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 465 flow. Second operand has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:24,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:24,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-26 00:23:24,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:25,199 INFO L129 PetriNetUnfolder]: 888/1723 cut-off events. [2021-03-26 00:23:25,200 INFO L130 PetriNetUnfolder]: For 2288/3737 co-relation queries the response was YES. [2021-03-26 00:23:25,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6414 conditions, 1723 events. 888/1723 cut-off events. For 2288/3737 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 12684 event pairs, 114 based on Foata normal form. 263/1791 useless extension candidates. Maximal degree in co-relation 6388. Up to 1232 conditions per place. [2021-03-26 00:23:25,218 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 13 selfloop transitions, 14 changer transitions 0/69 dead transitions. [2021-03-26 00:23:25,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 599 flow [2021-03-26 00:23:25,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:23:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:23:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1001 transitions. [2021-03-26 00:23:25,221 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8425925925925926 [2021-03-26 00:23:25,221 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1001 transitions. [2021-03-26 00:23:25,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1001 transitions. [2021-03-26 00:23:25,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:25,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1001 transitions. [2021-03-26 00:23:25,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:25,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:25,226 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:25,226 INFO L185 Difference]: Start difference. First operand has 56 places, 54 transitions, 465 flow. Second operand 6 states and 1001 transitions. [2021-03-26 00:23:25,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 599 flow [2021-03-26 00:23:25,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 69 transitions, 593 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-03-26 00:23:25,232 INFO L241 Difference]: Finished difference. Result has 64 places, 63 transitions, 579 flow [2021-03-26 00:23:25,232 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=579, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2021-03-26 00:23:25,232 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2021-03-26 00:23:25,232 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:25,232 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 63 transitions, 579 flow [2021-03-26 00:23:25,232 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 63 transitions, 579 flow [2021-03-26 00:23:25,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 63 transitions, 579 flow [2021-03-26 00:23:25,361 INFO L129 PetriNetUnfolder]: 594/1283 cut-off events. [2021-03-26 00:23:25,362 INFO L130 PetriNetUnfolder]: For 4088/5151 co-relation queries the response was YES. [2021-03-26 00:23:25,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5885 conditions, 1283 events. 594/1283 cut-off events. For 4088/5151 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 9716 event pairs, 97 based on Foata normal form. 35/1247 useless extension candidates. Maximal degree in co-relation 5856. Up to 934 conditions per place. [2021-03-26 00:23:25,383 INFO L142 LiptonReduction]: Number of co-enabled transitions 1146 [2021-03-26 00:23:25,629 INFO L154 LiptonReduction]: Checked pairs total: 810 [2021-03-26 00:23:25,629 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:23:25,629 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 397 [2021-03-26 00:23:25,630 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 571 flow [2021-03-26 00:23:25,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:25,630 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:25,630 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:25,630 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:23:25,631 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:25,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:25,631 INFO L82 PathProgramCache]: Analyzing trace with hash -807138052, now seen corresponding path program 1 times [2021-03-26 00:23:25,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:25,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451343967] [2021-03-26 00:23:25,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:25,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:25,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:25,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:25,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:25,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:25,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:25,723 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:23:25,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:23:25,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:25,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:25,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451343967] [2021-03-26 00:23:25,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:25,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:23:25,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656518526] [2021-03-26 00:23:25,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:23:25,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:25,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:23:25,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:23:25,733 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-26 00:23:25,734 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 571 flow. Second operand has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:25,734 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:25,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-26 00:23:25,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:25,915 INFO L129 PetriNetUnfolder]: 611/1196 cut-off events. [2021-03-26 00:23:25,916 INFO L130 PetriNetUnfolder]: For 3935/5778 co-relation queries the response was YES. [2021-03-26 00:23:25,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5897 conditions, 1196 events. 611/1196 cut-off events. For 3935/5778 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 8083 event pairs, 21 based on Foata normal form. 274/1326 useless extension candidates. Maximal degree in co-relation 5866. Up to 831 conditions per place. [2021-03-26 00:23:25,930 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 10 selfloop transitions, 18 changer transitions 4/74 dead transitions. [2021-03-26 00:23:25,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 74 transitions, 727 flow [2021-03-26 00:23:25,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:23:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:23:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1168 transitions. [2021-03-26 00:23:25,934 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8427128427128427 [2021-03-26 00:23:25,934 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1168 transitions. [2021-03-26 00:23:25,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1168 transitions. [2021-03-26 00:23:25,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:25,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1168 transitions. [2021-03-26 00:23:25,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 166.85714285714286) internal successors, (1168), 7 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:25,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:25,940 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:25,940 INFO L185 Difference]: Start difference. First operand has 64 places, 62 transitions, 571 flow. Second operand 7 states and 1168 transitions. [2021-03-26 00:23:25,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 74 transitions, 727 flow [2021-03-26 00:23:25,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 74 transitions, 665 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 00:23:25,971 INFO L241 Difference]: Finished difference. Result has 67 places, 67 transitions, 631 flow [2021-03-26 00:23:25,971 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=631, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2021-03-26 00:23:25,972 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2021-03-26 00:23:25,972 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:25,972 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 67 transitions, 631 flow [2021-03-26 00:23:25,972 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 67 transitions, 631 flow [2021-03-26 00:23:25,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 67 transitions, 631 flow [2021-03-26 00:23:26,036 INFO L129 PetriNetUnfolder]: 305/736 cut-off events. [2021-03-26 00:23:26,036 INFO L130 PetriNetUnfolder]: For 2227/2625 co-relation queries the response was YES. [2021-03-26 00:23:26,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3414 conditions, 736 events. 305/736 cut-off events. For 2227/2625 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5125 event pairs, 17 based on Foata normal form. 1/704 useless extension candidates. Maximal degree in co-relation 3384. Up to 468 conditions per place. [2021-03-26 00:23:26,048 INFO L142 LiptonReduction]: Number of co-enabled transitions 1084 [2021-03-26 00:23:26,110 INFO L154 LiptonReduction]: Checked pairs total: 807 [2021-03-26 00:23:26,110 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:23:26,110 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 138 [2021-03-26 00:23:26,111 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 621 flow [2021-03-26 00:23:26,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:26,112 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:26,112 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:26,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:23:26,112 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:26,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:26,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2110534856, now seen corresponding path program 1 times [2021-03-26 00:23:26,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:26,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846264353] [2021-03-26 00:23:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:26,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:26,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:26,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:26,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:26,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:26,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:26,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:26,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:26,227 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:23:26,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:23:26,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:26,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:26,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846264353] [2021-03-26 00:23:26,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:26,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:23:26,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688654833] [2021-03-26 00:23:26,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:23:26,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:26,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:23:26,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:23:26,238 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-26 00:23:26,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 621 flow. Second operand has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:26,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:26,239 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-26 00:23:26,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:26,458 INFO L129 PetriNetUnfolder]: 518/963 cut-off events. [2021-03-26 00:23:26,459 INFO L130 PetriNetUnfolder]: For 2967/4153 co-relation queries the response was YES. [2021-03-26 00:23:26,466 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4447 conditions, 963 events. 518/963 cut-off events. For 2967/4153 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 5917 event pairs, 11 based on Foata normal form. 143/969 useless extension candidates. Maximal degree in co-relation 4415. Up to 532 conditions per place. [2021-03-26 00:23:26,470 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 6 selfloop transitions, 18 changer transitions 14/71 dead transitions. [2021-03-26 00:23:26,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 71 transitions, 687 flow [2021-03-26 00:23:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:23:26,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:23:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1327 transitions. [2021-03-26 00:23:26,474 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8377525252525253 [2021-03-26 00:23:26,474 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1327 transitions. [2021-03-26 00:23:26,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1327 transitions. [2021-03-26 00:23:26,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:26,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1327 transitions. [2021-03-26 00:23:26,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 165.875) internal successors, (1327), 8 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:26,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:26,481 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:26,481 INFO L185 Difference]: Start difference. First operand has 67 places, 66 transitions, 621 flow. Second operand 8 states and 1327 transitions. [2021-03-26 00:23:26,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 71 transitions, 687 flow [2021-03-26 00:23:26,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 71 transitions, 642 flow, removed 16 selfloop flow, removed 4 redundant places. [2021-03-26 00:23:26,508 INFO L241 Difference]: Finished difference. Result has 71 places, 54 transitions, 486 flow [2021-03-26 00:23:26,508 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=486, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2021-03-26 00:23:26,508 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2021-03-26 00:23:26,508 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:26,509 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 54 transitions, 486 flow [2021-03-26 00:23:26,509 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 54 transitions, 486 flow [2021-03-26 00:23:26,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 54 transitions, 486 flow [2021-03-26 00:23:26,541 INFO L129 PetriNetUnfolder]: 116/294 cut-off events. [2021-03-26 00:23:26,542 INFO L130 PetriNetUnfolder]: For 830/968 co-relation queries the response was YES. [2021-03-26 00:23:26,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 294 events. 116/294 cut-off events. For 830/968 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1565 event pairs, 8 based on Foata normal form. 1/277 useless extension candidates. Maximal degree in co-relation 1282. Up to 109 conditions per place. [2021-03-26 00:23:26,547 INFO L142 LiptonReduction]: Number of co-enabled transitions 620 [2021-03-26 00:23:26,654 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-03-26 00:23:26,910 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 00:23:27,035 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 00:23:27,355 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:23:27,510 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:23:27,523 INFO L154 LiptonReduction]: Checked pairs total: 839 [2021-03-26 00:23:27,523 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:23:27,523 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1015 [2021-03-26 00:23:27,524 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 470 flow [2021-03-26 00:23:27,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:27,524 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:27,525 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:27,525 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:23:27,525 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:27,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:27,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1307434838, now seen corresponding path program 1 times [2021-03-26 00:23:27,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:27,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681363287] [2021-03-26 00:23:27,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:27,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:27,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:27,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:27,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:27,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:27,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:27,577 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:23:27,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:23:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:27,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681363287] [2021-03-26 00:23:27,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:27,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:23:27,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695402567] [2021-03-26 00:23:27,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:23:27,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:27,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:23:27,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:23:27,588 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2021-03-26 00:23:27,589 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 470 flow. Second operand has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:27,589 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:27,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2021-03-26 00:23:27,589 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:27,689 INFO L129 PetriNetUnfolder]: 224/516 cut-off events. [2021-03-26 00:23:27,690 INFO L130 PetriNetUnfolder]: For 2236/2701 co-relation queries the response was YES. [2021-03-26 00:23:27,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2340 conditions, 516 events. 224/516 cut-off events. For 2236/2701 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3103 event pairs, 7 based on Foata normal form. 45/531 useless extension candidates. Maximal degree in co-relation 2308. Up to 170 conditions per place. [2021-03-26 00:23:27,694 INFO L132 encePairwiseOnDemand]: 191/200 looper letters, 9 selfloop transitions, 14 changer transitions 28/77 dead transitions. [2021-03-26 00:23:27,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 77 transitions, 867 flow [2021-03-26 00:23:27,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:23:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:23:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 995 transitions. [2021-03-26 00:23:27,698 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8291666666666667 [2021-03-26 00:23:27,698 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 995 transitions. [2021-03-26 00:23:27,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 995 transitions. [2021-03-26 00:23:27,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:27,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 995 transitions. [2021-03-26 00:23:27,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:27,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:27,703 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:27,703 INFO L185 Difference]: Start difference. First operand has 67 places, 51 transitions, 470 flow. Second operand 6 states and 995 transitions. [2021-03-26 00:23:27,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 77 transitions, 867 flow [2021-03-26 00:23:27,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 695 flow, removed 21 selfloop flow, removed 12 redundant places. [2021-03-26 00:23:27,716 INFO L241 Difference]: Finished difference. Result has 62 places, 46 transitions, 350 flow [2021-03-26 00:23:27,716 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2021-03-26 00:23:27,716 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2021-03-26 00:23:27,716 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:27,717 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 46 transitions, 350 flow [2021-03-26 00:23:27,717 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 46 transitions, 350 flow [2021-03-26 00:23:27,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 46 transitions, 350 flow [2021-03-26 00:23:27,735 INFO L129 PetriNetUnfolder]: 83/214 cut-off events. [2021-03-26 00:23:27,735 INFO L130 PetriNetUnfolder]: For 568/607 co-relation queries the response was YES. [2021-03-26 00:23:27,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 214 events. 83/214 cut-off events. For 568/607 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1048 event pairs, 5 based on Foata normal form. 10/206 useless extension candidates. Maximal degree in co-relation 742. Up to 68 conditions per place. [2021-03-26 00:23:27,738 INFO L142 LiptonReduction]: Number of co-enabled transitions 416 [2021-03-26 00:23:27,937 INFO L154 LiptonReduction]: Checked pairs total: 162 [2021-03-26 00:23:27,937 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:23:27,939 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 223 [2021-03-26 00:23:27,939 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 347 flow [2021-03-26 00:23:27,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:27,940 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:27,940 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:27,940 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:23:27,940 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:27,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:27,940 INFO L82 PathProgramCache]: Analyzing trace with hash -618844559, now seen corresponding path program 1 times [2021-03-26 00:23:27,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:27,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774427267] [2021-03-26 00:23:27,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:27,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:28,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:28,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:28,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:23:28,005 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:23:28,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:23:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:28,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774427267] [2021-03-26 00:23:28,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:28,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:23:28,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500919121] [2021-03-26 00:23:28,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:23:28,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:28,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:23:28,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:23:28,016 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 202 [2021-03-26 00:23:28,016 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 347 flow. Second operand has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:28,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:28,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 202 [2021-03-26 00:23:28,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:28,060 INFO L129 PetriNetUnfolder]: 86/204 cut-off events. [2021-03-26 00:23:28,060 INFO L130 PetriNetUnfolder]: For 459/502 co-relation queries the response was YES. [2021-03-26 00:23:28,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 204 events. 86/204 cut-off events. For 459/502 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 923 event pairs, 7 based on Foata normal form. 10/197 useless extension candidates. Maximal degree in co-relation 724. Up to 64 conditions per place. [2021-03-26 00:23:28,062 INFO L132 encePairwiseOnDemand]: 193/202 looper letters, 4 selfloop transitions, 7 changer transitions 8/45 dead transitions. [2021-03-26 00:23:28,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 45 transitions, 385 flow [2021-03-26 00:23:28,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:23:28,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:23:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 676 transitions. [2021-03-26 00:23:28,064 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8366336633663366 [2021-03-26 00:23:28,064 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 676 transitions. [2021-03-26 00:23:28,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 676 transitions. [2021-03-26 00:23:28,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:28,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 676 transitions. [2021-03-26 00:23:28,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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 00:23:28,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:28,067 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:28,067 INFO L185 Difference]: Start difference. First operand has 60 places, 45 transitions, 347 flow. Second operand 4 states and 676 transitions. [2021-03-26 00:23:28,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 45 transitions, 385 flow [2021-03-26 00:23:28,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 45 transitions, 342 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-26 00:23:28,071 INFO L241 Difference]: Finished difference. Result has 59 places, 37 transitions, 239 flow [2021-03-26 00:23:28,071 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=59, PETRI_TRANSITIONS=37} [2021-03-26 00:23:28,071 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2021-03-26 00:23:28,071 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:28,071 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 37 transitions, 239 flow [2021-03-26 00:23:28,071 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 37 transitions, 239 flow [2021-03-26 00:23:28,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 37 transitions, 239 flow [2021-03-26 00:23:28,078 INFO L129 PetriNetUnfolder]: 28/77 cut-off events. [2021-03-26 00:23:28,078 INFO L130 PetriNetUnfolder]: For 143/155 co-relation queries the response was YES. [2021-03-26 00:23:28,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 77 events. 28/77 cut-off events. For 143/155 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 244 event pairs, 0 based on Foata normal form. 4/75 useless extension candidates. Maximal degree in co-relation 228. Up to 24 conditions per place. [2021-03-26 00:23:28,079 INFO L142 LiptonReduction]: Number of co-enabled transitions 176 [2021-03-26 00:23:28,751 WARN L205 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 00:23:29,021 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:23:30,285 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 00:23:30,845 WARN L205 SmtUtils]: Spent 558.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 00:23:31,124 INFO L154 LiptonReduction]: Checked pairs total: 168 [2021-03-26 00:23:31,124 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:23:31,124 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3053 [2021-03-26 00:23:31,125 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 35 transitions, 237 flow [2021-03-26 00:23:31,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:31,125 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:31,125 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:31,125 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:23:31,125 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:31,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:31,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1245964632, now seen corresponding path program 1 times [2021-03-26 00:23:31,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:31,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608617839] [2021-03-26 00:23:31,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:23:31,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:31,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:23:31,193 INFO L142 QuantifierPusher]: treesize reduction 12, result has 55.6 percent of original size [2021-03-26 00:23:31,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:23:31,205 INFO L142 QuantifierPusher]: treesize reduction 12, result has 80.3 percent of original size [2021-03-26 00:23:31,208 INFO L147 QuantifierPusher]: treesize reduction 9, result has 81.6 percent of original size 40 [2021-03-26 00:23:31,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:23:31,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:23:31,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:23:31,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608617839] [2021-03-26 00:23:31,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:23:31,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:23:31,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995796269] [2021-03-26 00:23:31,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:23:31,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:23:31,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:23:31,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:23:31,241 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 206 [2021-03-26 00:23:31,242 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 35 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:31,242 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:23:31,242 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 206 [2021-03-26 00:23:31,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:23:31,358 INFO L129 PetriNetUnfolder]: 50/127 cut-off events. [2021-03-26 00:23:31,358 INFO L130 PetriNetUnfolder]: For 256/267 co-relation queries the response was YES. [2021-03-26 00:23:31,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 127 events. 50/127 cut-off events. For 256/267 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 524 event pairs, 0 based on Foata normal form. 5/127 useless extension candidates. Maximal degree in co-relation 398. Up to 42 conditions per place. [2021-03-26 00:23:31,359 INFO L132 encePairwiseOnDemand]: 198/206 looper letters, 3 selfloop transitions, 5 changer transitions 10/42 dead transitions. [2021-03-26 00:23:31,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 42 transitions, 328 flow [2021-03-26 00:23:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:23:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:23:31,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1013 transitions. [2021-03-26 00:23:31,362 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.70249653259362 [2021-03-26 00:23:31,362 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1013 transitions. [2021-03-26 00:23:31,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1013 transitions. [2021-03-26 00:23:31,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:23:31,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1013 transitions. [2021-03-26 00:23:31,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.71428571428572) internal successors, (1013), 7 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:31,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:31,367 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:31,367 INFO L185 Difference]: Start difference. First operand has 57 places, 35 transitions, 237 flow. Second operand 7 states and 1013 transitions. [2021-03-26 00:23:31,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 42 transitions, 328 flow [2021-03-26 00:23:31,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 42 transitions, 263 flow, removed 7 selfloop flow, removed 11 redundant places. [2021-03-26 00:23:31,370 INFO L241 Difference]: Finished difference. Result has 55 places, 32 transitions, 190 flow [2021-03-26 00:23:31,370 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=55, PETRI_TRANSITIONS=32} [2021-03-26 00:23:31,371 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2021-03-26 00:23:31,371 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:23:31,371 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 32 transitions, 190 flow [2021-03-26 00:23:31,371 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 32 transitions, 190 flow [2021-03-26 00:23:31,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 32 transitions, 190 flow [2021-03-26 00:23:31,376 INFO L129 PetriNetUnfolder]: 21/56 cut-off events. [2021-03-26 00:23:31,377 INFO L130 PetriNetUnfolder]: For 78/81 co-relation queries the response was YES. [2021-03-26 00:23:31,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 56 events. 21/56 cut-off events. For 78/81 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 120 event pairs, 0 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 162. Up to 18 conditions per place. [2021-03-26 00:23:31,377 INFO L142 LiptonReduction]: Number of co-enabled transitions 88 [2021-03-26 00:23:31,429 INFO L154 LiptonReduction]: Checked pairs total: 5 [2021-03-26 00:23:31,429 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:23:31,429 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 58 [2021-03-26 00:23:31,431 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 202 flow [2021-03-26 00:23:31,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:23:31,431 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:23:31,432 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:23:31,432 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:23:31,432 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:23:31,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:23:31,432 INFO L82 PathProgramCache]: Analyzing trace with hash -414698274, now seen corresponding path program 1 times [2021-03-26 00:23:31,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:23:31,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950488408] [2021-03-26 00:23:31,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:23:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:23:31,472 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:23:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:23:31,502 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:23:31,540 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:23:31,540 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:23:31,541 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:23:31,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:23:31 BasicIcfg [2021-03-26 00:23:31,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:23:31,625 INFO L168 Benchmark]: Toolchain (without parser) took 17430.24 ms. Allocated memory was 255.9 MB in the beginning and 736.1 MB in the end (delta: 480.2 MB). Free memory was 236.6 MB in the beginning and 563.5 MB in the end (delta: -326.9 MB). Peak memory consumption was 152.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:31,625 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:23:31,625 INFO L168 Benchmark]: CACSL2BoogieTranslator took 539.22 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 236.6 MB in the beginning and 308.3 MB in the end (delta: -71.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:31,626 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.53 ms. Allocated memory is still 348.1 MB. Free memory was 308.3 MB in the beginning and 305.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:31,626 INFO L168 Benchmark]: Boogie Preprocessor took 39.89 ms. Allocated memory is still 348.1 MB. Free memory was 305.6 MB in the beginning and 303.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:31,626 INFO L168 Benchmark]: RCFGBuilder took 1483.94 ms. Allocated memory is still 348.1 MB. Free memory was 303.5 MB in the beginning and 247.7 MB in the end (delta: 55.8 MB). Peak memory consumption was 58.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:31,626 INFO L168 Benchmark]: TraceAbstraction took 15278.94 ms. Allocated memory was 348.1 MB in the beginning and 736.1 MB in the end (delta: 388.0 MB). Free memory was 247.7 MB in the beginning and 563.5 MB in the end (delta: -315.9 MB). Peak memory consumption was 72.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:23:31,627 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.49 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 539.22 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 236.6 MB in the beginning and 308.3 MB in the end (delta: -71.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 69.53 ms. Allocated memory is still 348.1 MB. Free memory was 308.3 MB in the beginning and 305.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 39.89 ms. Allocated memory is still 348.1 MB. Free memory was 305.6 MB in the beginning and 303.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1483.94 ms. Allocated memory is still 348.1 MB. Free memory was 303.5 MB in the beginning and 247.7 MB in the end (delta: 55.8 MB). Peak memory consumption was 58.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 15278.94 ms. Allocated memory was 348.1 MB in the beginning and 736.1 MB in the end (delta: 388.0 MB). Free memory was 247.7 MB in the beginning and 563.5 MB in the end (delta: -315.9 MB). Peak memory consumption was 72.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3280.9ms, 119 PlacesBefore, 55 PlacesAfterwards, 108 TransitionsBefore, 43 TransitionsAfterwards, 2300 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, 3631 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1980, positive: 1901, positive conditional: 1901, positive unconditional: 0, negative: 79, negative conditional: 79, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1537, positive: 1497, positive conditional: 0, positive unconditional: 1497, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1537, positive: 1497, positive conditional: 0, positive unconditional: 1497, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1537, positive: 1480, positive conditional: 0, positive unconditional: 1480, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 57, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 420, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 368, negative conditional: 0, negative unconditional: 368, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1980, positive: 404, positive conditional: 404, positive unconditional: 0, negative: 39, negative conditional: 39, negative unconditional: 0, unknown: 1537, unknown conditional: 1537, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 80, Positive conditional cache size: 80, Positive unconditional cache size: 0, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1089.6ms, 51 PlacesBefore, 40 PlacesAfterwards, 40 TransitionsBefore, 29 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1559 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 591, positive: 506, positive conditional: 506, positive unconditional: 0, negative: 85, negative conditional: 85, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, positive: 135, positive conditional: 11, positive unconditional: 124, negative: 18, negative conditional: 2, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 153, positive: 135, positive conditional: 11, positive unconditional: 124, negative: 18, negative conditional: 2, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 153, positive: 127, positive conditional: 0, positive unconditional: 127, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 18, negative conditional: 2, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 322, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 287, negative conditional: 102, negative unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 591, positive: 371, positive conditional: 371, positive unconditional: 0, negative: 67, negative conditional: 67, negative unconditional: 0, unknown: 153, unknown conditional: 153, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 131, Positive conditional cache size: 131, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1396.2ms, 46 PlacesBefore, 40 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 288 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 94, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 19, positive conditional: 1, positive unconditional: 18, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 19, positive conditional: 1, positive unconditional: 18, 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: 21, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 150, Positive conditional cache size: 150, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 201.9ms, 42 PlacesBefore, 42 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 315 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 70, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, positive: 29, positive conditional: 13, positive unconditional: 16, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, positive: 29, positive conditional: 13, positive unconditional: 16, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 151, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 151, negative conditional: 0, negative unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 179, Positive conditional cache size: 179, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 47.6ms, 47 PlacesBefore, 47 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 555 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 101, positive conditional: 101, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 28, positive conditional: 14, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 28, positive conditional: 14, positive unconditional: 14, 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: 28, positive: 28, positive conditional: 0, positive unconditional: 28, 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: 121, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 207, Positive conditional cache size: 207, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 291.7ms, 54 PlacesBefore, 54 PlacesAfterwards, 54 TransitionsBefore, 53 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 575 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 65, positive: 49, positive conditional: 49, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 30, positive conditional: 29, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, positive: 30, positive conditional: 29, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 63, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 196, Positive conditional cache size: 196, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 274.0ms, 56 PlacesBefore, 56 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 818 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 291 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 21, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 202, Positive conditional cache size: 202, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 396.7ms, 64 PlacesBefore, 64 PlacesAfterwards, 63 TransitionsBefore, 62 TransitionsAfterwards, 1146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 810 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 88, positive conditional: 88, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, positive: 41, positive conditional: 38, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, positive: 41, positive conditional: 38, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, positive: 41, positive conditional: 0, positive unconditional: 41, 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: 108, positive: 47, positive conditional: 47, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 41, unknown conditional: 41, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 212, Positive conditional cache size: 212, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 138.2ms, 67 PlacesBefore, 67 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 1084 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 807 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 89, positive: 69, positive conditional: 69, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 34, positive conditional: 34, 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: 34, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 89, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 34, unknown conditional: 34, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 219, Positive conditional cache size: 219, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1014.3ms, 71 PlacesBefore, 67 PlacesAfterwards, 54 TransitionsBefore, 51 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 839 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 16, 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: 16, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 72, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 199, Positive conditional cache size: 199, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 220.6ms, 62 PlacesBefore, 60 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 162 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 15, positive conditional: 9, positive unconditional: 6, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 15, positive conditional: 9, positive unconditional: 6, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 144, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 144, negative conditional: 144, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 146, Positive conditional cache size: 146, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3052.7ms, 59 PlacesBefore, 57 PlacesAfterwards, 37 TransitionsBefore, 35 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 168 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 32, positive conditional: 31, positive unconditional: 1, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 32, positive conditional: 31, positive unconditional: 1, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 91, negative conditional: 91, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 34, unknown conditional: 34, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 15, Negative conditional cache size: 15, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.3ms, 55 PlacesBefore, 53 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 5 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, 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: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 33, Positive conditional cache size: 33, Positive unconditional cache size: 0, Negative cache size: 14, Negative conditional cache size: 14, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1437; [L845] FCALL, FORK 0 pthread_create(&t1437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1438; [L847] FCALL, FORK 0 pthread_create(&t1438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1439; [L849] FCALL, FORK 0 pthread_create(&t1439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1440; [L851] FCALL, FORK 0 pthread_create(&t1440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 [L819] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 2 [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 2 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L786] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L787] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L788] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L788] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L789] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L790] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 11.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15079.1ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2018.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3362.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 105 SDtfs, 66 SDslu, 69 SDs, 0 SdLazy, 274 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 300.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 249.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=631occurred in iteration=8, InterpolantAutomatonStates: 63, 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: 37.5ms SsaConstructionTime, 374.1ms SatisfiabilityAnalysisTime, 819.8ms InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 1396 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...