/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:45:06,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:45:06,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:45:06,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:45:06,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:45:06,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:45:06,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:45:06,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:45:06,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:45:06,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:45:06,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:45:06,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:45:06,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:45:06,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:45:06,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:45:06,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:45:06,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:45:06,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:45:06,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:45:06,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:45:06,896 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:45:06,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:45:06,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:45:06,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:45:06,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:45:06,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:45:06,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:45:06,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:45:06,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:45:06,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:45:06,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:45:06,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:45:06,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:45:06,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:45:06,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:45:06,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:45:06,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:45:06,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:45:06,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:45:06,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:45:06,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:45:06,918 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-RepeatedVariableLbe.epf [2021-03-25 04:45:06,951 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:45:06,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:45:06,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:45:06,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:45:06,955 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:45:06,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:45:06,956 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:45:06,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:45:06,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:45:06,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:45:06,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:45:06,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:45:06,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:45:06,958 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:45:06,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:45:06,958 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:45:06,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:45:06,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:45:06,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:45:06,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:45:06,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:45:06,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:45:06,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:45:06,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:45:06,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:45:06,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:45:06,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:45:06,960 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:45:06,960 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:45:06,960 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:45:06,960 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-25 04:45:07,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:45:07,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:45:07,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:45:07,319 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:45:07,319 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:45:07,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2021-03-25 04:45:07,383 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac15cfa8/83f0507ccf5547cd9588237acb25252b/FLAG79a633876 [2021-03-25 04:45:07,913 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:45:07,913 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2021-03-25 04:45:07,926 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac15cfa8/83f0507ccf5547cd9588237acb25252b/FLAG79a633876 [2021-03-25 04:45:08,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac15cfa8/83f0507ccf5547cd9588237acb25252b [2021-03-25 04:45:08,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:45:08,262 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:45:08,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:45:08,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:45:08,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:45:08,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:45:08" (1/1) ... [2021-03-25 04:45:08,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123da53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:08, skipping insertion in model container [2021-03-25 04:45:08,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:45:08" (1/1) ... [2021-03-25 04:45:08,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:45:08,332 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:45:08,444 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/mix042_tso.opt.i[948,961] [2021-03-25 04:45:08,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:45:08,714 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:45:08,724 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/mix042_tso.opt.i[948,961] [2021-03-25 04:45:08,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:45:08,844 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:45:08,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:08 WrapperNode [2021-03-25 04:45:08,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:45:08,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:45:08,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:45:08,846 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:45:08,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:08" (1/1) ... [2021-03-25 04:45:08,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:08" (1/1) ... [2021-03-25 04:45:08,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:45:08,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:45:08,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:45:08,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:45:08,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:08" (1/1) ... [2021-03-25 04:45:08,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:08" (1/1) ... [2021-03-25 04:45:08,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:08" (1/1) ... [2021-03-25 04:45:08,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:08" (1/1) ... [2021-03-25 04:45:08,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:08" (1/1) ... [2021-03-25 04:45:08,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:08" (1/1) ... [2021-03-25 04:45:08,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:08" (1/1) ... [2021-03-25 04:45:08,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:45:08,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:45:08,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:45:08,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:45:08,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:08" (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-25 04:45:09,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:45:09,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:45:09,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:45:09,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:45:09,058 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:45:09,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:45:09,058 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:45:09,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:45:09,059 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:45:09,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:45:09,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:45:09,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:45:09,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:45:09,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:45:09,061 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:45:10,653 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:45:10,653 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:45:10,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:45:10 BoogieIcfgContainer [2021-03-25 04:45:10,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:45:10,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:45:10,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:45:10,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:45:10,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:45:08" (1/3) ... [2021-03-25 04:45:10,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4c1aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:45:10, skipping insertion in model container [2021-03-25 04:45:10,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:45:08" (2/3) ... [2021-03-25 04:45:10,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4c1aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:45:10, skipping insertion in model container [2021-03-25 04:45:10,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:45:10" (3/3) ... [2021-03-25 04:45:10,663 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_tso.opt.i [2021-03-25 04:45:10,668 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:45:10,672 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:45:10,672 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:45:10,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,714 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,714 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,714 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,714 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,715 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,715 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,716 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,716 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,721 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,721 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,721 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,721 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,722 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,722 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,722 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,726 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,731 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,733 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,734 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,736 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,736 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,738 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,738 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,740 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:45:10,741 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:45:10,759 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 04:45:10,789 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:45:10,789 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:45:10,789 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:45:10,794 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:45:10,794 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:45:10,794 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:45:10,794 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:45:10,794 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:45:10,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2021-03-25 04:45:10,855 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-25 04:45:10,856 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:10,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 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/94 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-25 04:45:10,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 101 transitions, 217 flow [2021-03-25 04:45:10,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 98 transitions, 205 flow [2021-03-25 04:45:10,878 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:10,885 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-25 04:45:10,888 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-25 04:45:10,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 205 flow [2021-03-25 04:45:10,906 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-25 04:45:10,907 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:10,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-25 04:45:10,909 INFO L142 LiptonReduction]: Number of co-enabled transitions 1738 [2021-03-25 04:45:11,901 WARN L205 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-25 04:45:12,484 WARN L205 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-25 04:45:13,894 WARN L205 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2021-03-25 04:45:14,469 WARN L205 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-25 04:45:15,211 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:45:15,595 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:45:15,713 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 04:45:16,728 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 04:45:17,020 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 04:45:17,612 WARN L205 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 04:45:18,255 WARN L205 SmtUtils]: Spent 641.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 04:45:18,348 INFO L154 LiptonReduction]: Checked pairs total: 2986 [2021-03-25 04:45:18,348 INFO L156 LiptonReduction]: Total number of compositions: 67 [2021-03-25 04:45:18,350 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7473 [2021-03-25 04:45:18,359 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-25 04:45:18,359 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:18,363 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:18,365 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:18,365 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:18,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:18,371 INFO L82 PathProgramCache]: Analyzing trace with hash 684331068, now seen corresponding path program 1 times [2021-03-25 04:45:18,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:18,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383552177] [2021-03-25 04:45:18,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:18,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:18,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:18,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:18,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:18,660 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-25 04:45:18,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383552177] [2021-03-25 04:45:18,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:18,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:45:18,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92301939] [2021-03-25 04:45:18,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:45:18,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:18,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:45:18,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:45:18,683 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 168 [2021-03-25 04:45:18,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:18,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:18,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 168 [2021-03-25 04:45:18,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:18,792 INFO L129 PetriNetUnfolder]: 23/100 cut-off events. [2021-03-25 04:45:18,792 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:18,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 100 events. 23/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 325 event pairs, 9 based on Foata normal form. 5/98 useless extension candidates. Maximal degree in co-relation 139. Up to 37 conditions per place. [2021-03-25 04:45:18,796 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 7 selfloop transitions, 2 changer transitions 5/40 dead transitions. [2021-03-25 04:45:18,796 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 111 flow [2021-03-25 04:45:18,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:45:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:45:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2021-03-25 04:45:18,814 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2021-03-25 04:45:18,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2021-03-25 04:45:18,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2021-03-25 04:45:18,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:18,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2021-03-25 04:45:18,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:18,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:18,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:18,838 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 455 transitions. [2021-03-25 04:45:18,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 111 flow [2021-03-25 04:45:18,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 04:45:18,843 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 74 flow [2021-03-25 04:45:18,845 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-25 04:45:18,846 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-25 04:45:18,846 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:18,846 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-25 04:45:18,847 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-25 04:45:18,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2021-03-25 04:45:18,855 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-25 04:45:18,855 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:18,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:45:18,857 INFO L142 LiptonReduction]: Number of co-enabled transitions 254 [2021-03-25 04:45:19,165 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:45:19,296 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:45:19,803 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 04:45:20,113 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 04:45:20,787 WARN L205 SmtUtils]: Spent 670.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:45:21,372 WARN L205 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:45:21,880 INFO L154 LiptonReduction]: Checked pairs total: 1104 [2021-03-25 04:45:21,881 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-25 04:45:21,881 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3035 [2021-03-25 04:45:21,881 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-03-25 04:45:21,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:21,882 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:21,882 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-25 04:45:21,882 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:45:21,882 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:21,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:21,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1683336467, now seen corresponding path program 1 times [2021-03-25 04:45:21,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:21,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710299831] [2021-03-25 04:45:21,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:21,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:21,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:21,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:21,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:22,001 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:45:22,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:45:22,005 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-25 04:45:22,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710299831] [2021-03-25 04:45:22,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:22,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:45:22,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72324182] [2021-03-25 04:45:22,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:45:22,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:22,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:45:22,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:45:22,009 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 177 [2021-03-25 04:45:22,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:22,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:22,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 177 [2021-03-25 04:45:22,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:22,024 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-25 04:45:22,024 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:45:22,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:45:22,024 INFO L132 encePairwiseOnDemand]: 174/177 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-25 04:45:22,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 62 flow [2021-03-25 04:45:22,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:45:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:45:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2021-03-25 04:45:22,026 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8775894538606404 [2021-03-25 04:45:22,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2021-03-25 04:45:22,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2021-03-25 04:45:22,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:22,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2021-03-25 04:45:22,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:22,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:22,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:22,061 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 466 transitions. [2021-03-25 04:45:22,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 62 flow [2021-03-25 04:45:22,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:45:22,062 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 60 flow [2021-03-25 04:45:22,062 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-03-25 04:45:22,063 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -15 predicate places. [2021-03-25 04:45:22,063 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:22,063 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 60 flow [2021-03-25 04:45:22,063 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 60 flow [2021-03-25 04:45:22,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-25 04:45:22,067 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-25 04:45:22,068 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 04:45:22,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:45:22,068 INFO L142 LiptonReduction]: Number of co-enabled transitions 202 [2021-03-25 04:45:22,792 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-25 04:45:22,934 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 04:45:23,231 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-25 04:45:23,398 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 04:45:23,401 INFO L154 LiptonReduction]: Checked pairs total: 666 [2021-03-25 04:45:23,401 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:45:23,401 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1338 [2021-03-25 04:45:23,402 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2021-03-25 04:45:23,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:23,402 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:23,402 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:23,402 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:45:23,402 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:23,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:23,403 INFO L82 PathProgramCache]: Analyzing trace with hash -546362387, now seen corresponding path program 1 times [2021-03-25 04:45:23,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:23,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537901716] [2021-03-25 04:45:23,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:23,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:23,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:23,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:23,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:45:23,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:23,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 04:45:23,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:23,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:45:23,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:23,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:45:23,571 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-25 04:45:23,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537901716] [2021-03-25 04:45:23,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:23,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:45:23,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986202124] [2021-03-25 04:45:23,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:45:23,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:23,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:45:23,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:45:23,576 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 180 [2021-03-25 04:45:23,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:23,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:23,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 180 [2021-03-25 04:45:23,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:23,623 INFO L129 PetriNetUnfolder]: 21/67 cut-off events. [2021-03-25 04:45:23,623 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-25 04:45:23,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 67 events. 21/67 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 205 event pairs, 13 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 129. Up to 40 conditions per place. [2021-03-25 04:45:23,624 INFO L132 encePairwiseOnDemand]: 175/180 looper letters, 8 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2021-03-25 04:45:23,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 95 flow [2021-03-25 04:45:23,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:45:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:45:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2021-03-25 04:45:23,626 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.775 [2021-03-25 04:45:23,626 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 558 transitions. [2021-03-25 04:45:23,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 558 transitions. [2021-03-25 04:45:23,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:23,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 558 transitions. [2021-03-25 04:45:23,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:23,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:23,630 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:23,630 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 4 states and 558 transitions. [2021-03-25 04:45:23,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 95 flow [2021-03-25 04:45:23,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 89 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:45:23,632 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 83 flow [2021-03-25 04:45:23,632 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2021-03-25 04:45:23,632 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -15 predicate places. [2021-03-25 04:45:23,632 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:23,632 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 24 transitions, 83 flow [2021-03-25 04:45:23,632 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 83 flow [2021-03-25 04:45:23,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 83 flow [2021-03-25 04:45:23,637 INFO L129 PetriNetUnfolder]: 2/31 cut-off events. [2021-03-25 04:45:23,637 INFO L130 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2021-03-25 04:45:23,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 31 events. 2/31 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 51. Up to 7 conditions per place. [2021-03-25 04:45:23,638 INFO L142 LiptonReduction]: Number of co-enabled transitions 218 [2021-03-25 04:45:23,640 INFO L154 LiptonReduction]: Checked pairs total: 229 [2021-03-25 04:45:23,640 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:23,640 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-25 04:45:23,641 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 83 flow [2021-03-25 04:45:23,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:23,641 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:23,641 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:23,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:45:23,642 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:23,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:23,642 INFO L82 PathProgramCache]: Analyzing trace with hash 506806928, now seen corresponding path program 1 times [2021-03-25 04:45:23,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:23,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475950756] [2021-03-25 04:45:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:23,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:23,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:45:23,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:23,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:45:23,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:23,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 04:45:23,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:23,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 04:45:23,770 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-25 04:45:23,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475950756] [2021-03-25 04:45:23,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:23,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:45:23,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682912983] [2021-03-25 04:45:23,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:45:23,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:23,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:45:23,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:45:23,773 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 180 [2021-03-25 04:45:23,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 83 flow. Second operand has 6 states, 6 states have (on average 136.83333333333334) internal successors, (821), 6 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:23,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:23,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 180 [2021-03-25 04:45:23,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:23,866 INFO L129 PetriNetUnfolder]: 21/69 cut-off events. [2021-03-25 04:45:23,866 INFO L130 PetriNetUnfolder]: For 30/32 co-relation queries the response was YES. [2021-03-25 04:45:23,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 69 events. 21/69 cut-off events. For 30/32 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 211 event pairs, 1 based on Foata normal form. 4/72 useless extension candidates. Maximal degree in co-relation 162. Up to 26 conditions per place. [2021-03-25 04:45:23,868 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 9 selfloop transitions, 10 changer transitions 0/32 dead transitions. [2021-03-25 04:45:23,868 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 142 flow [2021-03-25 04:45:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:45:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:45:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2021-03-25 04:45:23,871 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7755555555555556 [2021-03-25 04:45:23,871 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2021-03-25 04:45:23,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2021-03-25 04:45:23,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:23,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2021-03-25 04:45:23,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:23,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:23,875 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:23,876 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 83 flow. Second operand 5 states and 698 transitions. [2021-03-25 04:45:23,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 142 flow [2021-03-25 04:45:23,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:45:23,878 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 138 flow [2021-03-25 04:45:23,878 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-25 04:45:23,878 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -9 predicate places. [2021-03-25 04:45:23,878 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:23,878 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 138 flow [2021-03-25 04:45:23,878 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 138 flow [2021-03-25 04:45:23,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 138 flow [2021-03-25 04:45:23,887 INFO L129 PetriNetUnfolder]: 12/59 cut-off events. [2021-03-25 04:45:23,887 INFO L130 PetriNetUnfolder]: For 44/46 co-relation queries the response was YES. [2021-03-25 04:45:23,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 59 events. 12/59 cut-off events. For 44/46 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 174 event pairs, 1 based on Foata normal form. 2/60 useless extension candidates. Maximal degree in co-relation 146. Up to 19 conditions per place. [2021-03-25 04:45:23,890 INFO L142 LiptonReduction]: Number of co-enabled transitions 252 [2021-03-25 04:45:24,036 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 04:45:24,402 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 04:45:24,550 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 04:45:24,555 INFO L154 LiptonReduction]: Checked pairs total: 452 [2021-03-25 04:45:24,556 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:45:24,556 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 678 [2021-03-25 04:45:24,556 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 142 flow [2021-03-25 04:45:24,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 136.83333333333334) internal successors, (821), 6 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:24,557 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:24,557 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:24,557 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:45:24,557 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:24,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1104098436, now seen corresponding path program 1 times [2021-03-25 04:45:24,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:24,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822859331] [2021-03-25 04:45:24,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:24,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:24,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:24,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:24,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:45:24,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:24,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:45:24,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822859331] [2021-03-25 04:45:24,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:24,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:45:24,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202801556] [2021-03-25 04:45:24,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:45:24,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:24,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:45:24,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:45:24,655 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 181 [2021-03-25 04:45:24,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:24,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:24,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 181 [2021-03-25 04:45:24,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:24,712 INFO L129 PetriNetUnfolder]: 61/156 cut-off events. [2021-03-25 04:45:24,712 INFO L130 PetriNetUnfolder]: For 85/95 co-relation queries the response was YES. [2021-03-25 04:45:24,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 156 events. 61/156 cut-off events. For 85/95 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 763 event pairs, 17 based on Foata normal form. 20/163 useless extension candidates. Maximal degree in co-relation 388. Up to 81 conditions per place. [2021-03-25 04:45:24,714 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 9 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2021-03-25 04:45:24,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 196 flow [2021-03-25 04:45:24,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:45:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:45:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 788 transitions. [2021-03-25 04:45:24,717 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8707182320441988 [2021-03-25 04:45:24,717 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 788 transitions. [2021-03-25 04:45:24,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 788 transitions. [2021-03-25 04:45:24,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:24,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 788 transitions. [2021-03-25 04:45:24,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.6) internal successors, (788), 5 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:24,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:24,722 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:24,722 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 142 flow. Second operand 5 states and 788 transitions. [2021-03-25 04:45:24,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 196 flow [2021-03-25 04:45:24,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 184 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-25 04:45:24,726 INFO L241 Difference]: Finished difference. Result has 45 places, 36 transitions, 194 flow [2021-03-25 04:45:24,726 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=130, 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=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2021-03-25 04:45:24,727 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-25 04:45:24,727 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:24,727 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 194 flow [2021-03-25 04:45:24,727 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 194 flow [2021-03-25 04:45:24,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 194 flow [2021-03-25 04:45:24,748 INFO L129 PetriNetUnfolder]: 61/156 cut-off events. [2021-03-25 04:45:24,748 INFO L130 PetriNetUnfolder]: For 156/188 co-relation queries the response was YES. [2021-03-25 04:45:24,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 156 events. 61/156 cut-off events. For 156/188 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 770 event pairs, 18 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 451. Up to 83 conditions per place. [2021-03-25 04:45:24,751 INFO L142 LiptonReduction]: Number of co-enabled transitions 354 [2021-03-25 04:45:24,754 INFO L154 LiptonReduction]: Checked pairs total: 208 [2021-03-25 04:45:24,754 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:24,754 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27 [2021-03-25 04:45:24,756 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 194 flow [2021-03-25 04:45:24,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:24,757 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:24,757 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:24,757 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:45:24,757 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2119980214, now seen corresponding path program 1 times [2021-03-25 04:45:24,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:24,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131493627] [2021-03-25 04:45:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:24,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:24,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:24,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:24,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:24,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:24,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:45:24,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:24,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:24,874 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-25 04:45:24,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131493627] [2021-03-25 04:45:24,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:24,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:45:24,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473453875] [2021-03-25 04:45:24,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:45:24,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:24,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:45:24,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:45:24,877 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 181 [2021-03-25 04:45:24,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:24,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:24,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 181 [2021-03-25 04:45:24,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:24,953 INFO L129 PetriNetUnfolder]: 37/119 cut-off events. [2021-03-25 04:45:24,954 INFO L130 PetriNetUnfolder]: For 220/368 co-relation queries the response was YES. [2021-03-25 04:45:24,954 INFO L84 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 119 events. 37/119 cut-off events. For 220/368 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 539 event pairs, 2 based on Foata normal form. 53/166 useless extension candidates. Maximal degree in co-relation 416. Up to 72 conditions per place. [2021-03-25 04:45:24,955 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 5 selfloop transitions, 15 changer transitions 3/45 dead transitions. [2021-03-25 04:45:24,955 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 289 flow [2021-03-25 04:45:24,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:45:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:45:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1103 transitions. [2021-03-25 04:45:24,958 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8705603788476717 [2021-03-25 04:45:24,958 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1103 transitions. [2021-03-25 04:45:24,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1103 transitions. [2021-03-25 04:45:24,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:24,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1103 transitions. [2021-03-25 04:45:24,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.57142857142858) internal successors, (1103), 7 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:24,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:24,964 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:24,964 INFO L185 Difference]: Start difference. First operand has 45 places, 36 transitions, 194 flow. Second operand 7 states and 1103 transitions. [2021-03-25 04:45:24,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 289 flow [2021-03-25 04:45:24,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 283 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 04:45:24,969 INFO L241 Difference]: Finished difference. Result has 53 places, 42 transitions, 278 flow [2021-03-25 04:45:24,969 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2021-03-25 04:45:24,969 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2021-03-25 04:45:24,970 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:24,970 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 42 transitions, 278 flow [2021-03-25 04:45:24,970 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 42 transitions, 278 flow [2021-03-25 04:45:24,970 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 278 flow [2021-03-25 04:45:24,985 INFO L129 PetriNetUnfolder]: 33/113 cut-off events. [2021-03-25 04:45:24,986 INFO L130 PetriNetUnfolder]: For 297/375 co-relation queries the response was YES. [2021-03-25 04:45:24,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 113 events. 33/113 cut-off events. For 297/375 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 545 event pairs, 2 based on Foata normal form. 3/110 useless extension candidates. Maximal degree in co-relation 434. Up to 66 conditions per place. [2021-03-25 04:45:24,988 INFO L142 LiptonReduction]: Number of co-enabled transitions 400 [2021-03-25 04:45:24,998 INFO L154 LiptonReduction]: Checked pairs total: 560 [2021-03-25 04:45:24,998 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:45:24,998 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-25 04:45:25,001 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 262 flow [2021-03-25 04:45:25,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:25,001 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:25,002 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:25,002 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:45:25,002 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:25,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:25,002 INFO L82 PathProgramCache]: Analyzing trace with hash 440348981, now seen corresponding path program 1 times [2021-03-25 04:45:25,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:25,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386709259] [2021-03-25 04:45:25,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:25,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:25,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:25,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:25,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:25,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:25,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:25,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:25,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:45:25,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:25,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:25,138 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-25 04:45:25,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386709259] [2021-03-25 04:45:25,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:25,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:45:25,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031309427] [2021-03-25 04:45:25,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:45:25,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:25,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:45:25,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:45:25,141 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 181 [2021-03-25 04:45:25,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:25,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:25,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 181 [2021-03-25 04:45:25,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:25,196 INFO L129 PetriNetUnfolder]: 14/58 cut-off events. [2021-03-25 04:45:25,196 INFO L130 PetriNetUnfolder]: For 194/227 co-relation queries the response was YES. [2021-03-25 04:45:25,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 58 events. 14/58 cut-off events. For 194/227 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 151 event pairs, 0 based on Foata normal form. 23/80 useless extension candidates. Maximal degree in co-relation 220. Up to 32 conditions per place. [2021-03-25 04:45:25,197 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 2 selfloop transitions, 11 changer transitions 3/38 dead transitions. [2021-03-25 04:45:25,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 38 transitions, 267 flow [2021-03-25 04:45:25,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:45:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:45:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1096 transitions. [2021-03-25 04:45:25,201 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8650355169692187 [2021-03-25 04:45:25,201 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1096 transitions. [2021-03-25 04:45:25,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1096 transitions. [2021-03-25 04:45:25,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:25,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1096 transitions. [2021-03-25 04:45:25,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.57142857142858) internal successors, (1096), 7 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:25,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:25,206 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:25,207 INFO L185 Difference]: Start difference. First operand has 53 places, 40 transitions, 262 flow. Second operand 7 states and 1096 transitions. [2021-03-25 04:45:25,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 38 transitions, 267 flow [2021-03-25 04:45:25,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 237 flow, removed 11 selfloop flow, removed 5 redundant places. [2021-03-25 04:45:25,210 INFO L241 Difference]: Finished difference. Result has 52 places, 35 transitions, 217 flow [2021-03-25 04:45:25,210 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2021-03-25 04:45:25,211 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2021-03-25 04:45:25,211 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:25,211 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 35 transitions, 217 flow [2021-03-25 04:45:25,211 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 35 transitions, 217 flow [2021-03-25 04:45:25,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 35 transitions, 217 flow [2021-03-25 04:45:25,219 INFO L129 PetriNetUnfolder]: 12/55 cut-off events. [2021-03-25 04:45:25,220 INFO L130 PetriNetUnfolder]: For 102/108 co-relation queries the response was YES. [2021-03-25 04:45:25,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 55 events. 12/55 cut-off events. For 102/108 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 159 event pairs, 0 based on Foata normal form. 2/56 useless extension candidates. Maximal degree in co-relation 185. Up to 20 conditions per place. [2021-03-25 04:45:25,221 INFO L142 LiptonReduction]: Number of co-enabled transitions 218 [2021-03-25 04:45:25,808 WARN L205 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-25 04:45:26,037 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-25 04:45:27,324 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 338 DAG size of output: 260 [2021-03-25 04:45:27,777 WARN L205 SmtUtils]: Spent 450.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-25 04:45:28,006 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 04:45:28,225 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 04:45:28,708 WARN L205 SmtUtils]: Spent 481.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-25 04:45:29,232 WARN L205 SmtUtils]: Spent 522.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-25 04:45:29,237 INFO L154 LiptonReduction]: Checked pairs total: 537 [2021-03-25 04:45:29,238 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:45:29,238 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4027 [2021-03-25 04:45:29,238 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 203 flow [2021-03-25 04:45:29,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:29,239 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:29,239 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-25 04:45:29,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:45:29,239 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:29,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:29,239 INFO L82 PathProgramCache]: Analyzing trace with hash 125399039, now seen corresponding path program 1 times [2021-03-25 04:45:29,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:29,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597704528] [2021-03-25 04:45:29,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:29,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:29,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:29,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:29,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:29,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:29,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:29,291 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-25 04:45:29,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597704528] [2021-03-25 04:45:29,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:29,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:45:29,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898352470] [2021-03-25 04:45:29,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:45:29,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:29,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:45:29,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:45:29,293 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2021-03-25 04:45:29,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:29,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:29,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2021-03-25 04:45:29,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:29,324 INFO L129 PetriNetUnfolder]: 24/82 cut-off events. [2021-03-25 04:45:29,324 INFO L130 PetriNetUnfolder]: For 277/295 co-relation queries the response was YES. [2021-03-25 04:45:29,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 82 events. 24/82 cut-off events. For 277/295 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 297 event pairs, 0 based on Foata normal form. 7/83 useless extension candidates. Maximal degree in co-relation 277. Up to 31 conditions per place. [2021-03-25 04:45:29,325 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 3 selfloop transitions, 1 changer transitions 1/33 dead transitions. [2021-03-25 04:45:29,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 33 transitions, 215 flow [2021-03-25 04:45:29,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:45:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:45:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 614 transitions. [2021-03-25 04:45:29,327 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8387978142076503 [2021-03-25 04:45:29,327 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 614 transitions. [2021-03-25 04:45:29,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 614 transitions. [2021-03-25 04:45:29,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:29,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 614 transitions. [2021-03-25 04:45:29,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:29,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:29,331 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:29,331 INFO L185 Difference]: Start difference. First operand has 48 places, 32 transitions, 203 flow. Second operand 4 states and 614 transitions. [2021-03-25 04:45:29,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 33 transitions, 215 flow [2021-03-25 04:45:29,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 173 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-25 04:45:29,333 INFO L241 Difference]: Finished difference. Result has 46 places, 32 transitions, 168 flow [2021-03-25 04:45:29,333 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2021-03-25 04:45:29,333 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2021-03-25 04:45:29,333 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:29,333 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 32 transitions, 168 flow [2021-03-25 04:45:29,334 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 32 transitions, 168 flow [2021-03-25 04:45:29,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 32 transitions, 168 flow [2021-03-25 04:45:29,341 INFO L129 PetriNetUnfolder]: 17/67 cut-off events. [2021-03-25 04:45:29,341 INFO L130 PetriNetUnfolder]: For 83/87 co-relation queries the response was YES. [2021-03-25 04:45:29,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 67 events. 17/67 cut-off events. For 83/87 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 231 event pairs, 0 based on Foata normal form. 3/67 useless extension candidates. Maximal degree in co-relation 175. Up to 16 conditions per place. [2021-03-25 04:45:29,342 INFO L142 LiptonReduction]: Number of co-enabled transitions 172 [2021-03-25 04:45:29,683 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-25 04:45:29,803 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-25 04:45:29,828 INFO L154 LiptonReduction]: Checked pairs total: 163 [2021-03-25 04:45:29,829 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 04:45:29,829 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 496 [2021-03-25 04:45:29,829 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 175 flow [2021-03-25 04:45:29,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:29,829 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:29,830 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:29,830 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:45:29,830 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:29,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:29,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1637243468, now seen corresponding path program 1 times [2021-03-25 04:45:29,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:29,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874790601] [2021-03-25 04:45:29,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:29,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:29,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:29,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:29,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:29,886 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-25 04:45:29,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 04:45:29,902 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-25 04:45:29,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 04:45:29,918 INFO L142 QuantifierPusher]: treesize reduction 10, result has 56.5 percent of original size [2021-03-25 04:45:29,918 INFO L147 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size 9 [2021-03-25 04:45:29,931 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-25 04:45:29,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874790601] [2021-03-25 04:45:29,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:29,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:45:29,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382884553] [2021-03-25 04:45:29,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:45:29,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:29,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:45:29,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:45:29,934 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 187 [2021-03-25 04:45:29,934 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 141.16666666666666) internal successors, (847), 6 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:29,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:29,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 187 [2021-03-25 04:45:29,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:30,044 INFO L129 PetriNetUnfolder]: 46/139 cut-off events. [2021-03-25 04:45:30,044 INFO L130 PetriNetUnfolder]: For 618/670 co-relation queries the response was YES. [2021-03-25 04:45:30,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 139 events. 46/139 cut-off events. For 618/670 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 634 event pairs, 1 based on Foata normal form. 26/161 useless extension candidates. Maximal degree in co-relation 420. Up to 37 conditions per place. [2021-03-25 04:45:30,046 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 11 selfloop transitions, 6 changer transitions 12/47 dead transitions. [2021-03-25 04:45:30,046 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 321 flow [2021-03-25 04:45:30,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:45:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:45:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 859 transitions. [2021-03-25 04:45:30,048 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7655971479500892 [2021-03-25 04:45:30,048 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 859 transitions. [2021-03-25 04:45:30,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 859 transitions. [2021-03-25 04:45:30,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:30,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 859 transitions. [2021-03-25 04:45:30,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.16666666666666) internal successors, (859), 6 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,054 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,054 INFO L185 Difference]: Start difference. First operand has 44 places, 31 transitions, 175 flow. Second operand 6 states and 859 transitions. [2021-03-25 04:45:30,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 321 flow [2021-03-25 04:45:30,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 314 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:45:30,059 INFO L241 Difference]: Finished difference. Result has 51 places, 33 transitions, 209 flow [2021-03-25 04:45:30,059 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2021-03-25 04:45:30,059 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2021-03-25 04:45:30,059 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:30,059 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 33 transitions, 209 flow [2021-03-25 04:45:30,060 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 33 transitions, 209 flow [2021-03-25 04:45:30,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 33 transitions, 209 flow [2021-03-25 04:45:30,068 INFO L129 PetriNetUnfolder]: 18/67 cut-off events. [2021-03-25 04:45:30,068 INFO L130 PetriNetUnfolder]: For 132/136 co-relation queries the response was YES. [2021-03-25 04:45:30,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 67 events. 18/67 cut-off events. For 132/136 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 229 event pairs, 0 based on Foata normal form. 3/66 useless extension candidates. Maximal degree in co-relation 208. Up to 16 conditions per place. [2021-03-25 04:45:30,070 INFO L142 LiptonReduction]: Number of co-enabled transitions 118 [2021-03-25 04:45:30,072 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 04:45:30,072 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:45:30,072 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-25 04:45:30,072 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 209 flow [2021-03-25 04:45:30,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 141.16666666666666) internal successors, (847), 6 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,074 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:30,074 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:30,074 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:45:30,074 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:30,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:30,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1922675992, now seen corresponding path program 1 times [2021-03-25 04:45:30,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:30,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861938841] [2021-03-25 04:45:30,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:45:30,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:30,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:45:30,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:30,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:30,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:45:30,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:45:30,132 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-25 04:45:30,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861938841] [2021-03-25 04:45:30,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:45:30,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:45:30,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683251269] [2021-03-25 04:45:30,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:45:30,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:45:30,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:45:30,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:45:30,134 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 187 [2021-03-25 04:45:30,135 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,135 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:45:30,135 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 187 [2021-03-25 04:45:30,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:45:30,163 INFO L129 PetriNetUnfolder]: 31/111 cut-off events. [2021-03-25 04:45:30,163 INFO L130 PetriNetUnfolder]: For 274/281 co-relation queries the response was YES. [2021-03-25 04:45:30,164 INFO L84 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 111 events. 31/111 cut-off events. For 274/281 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 0 based on Foata normal form. 8/115 useless extension candidates. Maximal degree in co-relation 348. Up to 30 conditions per place. [2021-03-25 04:45:30,164 INFO L132 encePairwiseOnDemand]: 184/187 looper letters, 3 selfloop transitions, 1 changer transitions 7/34 dead transitions. [2021-03-25 04:45:30,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 34 transitions, 225 flow [2021-03-25 04:45:30,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:45:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:45:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2021-03-25 04:45:30,167 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8582887700534759 [2021-03-25 04:45:30,167 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 642 transitions. [2021-03-25 04:45:30,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 642 transitions. [2021-03-25 04:45:30,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:45:30,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 642 transitions. [2021-03-25 04:45:30,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.5) internal successors, (642), 4 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,170 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,170 INFO L185 Difference]: Start difference. First operand has 50 places, 33 transitions, 209 flow. Second operand 4 states and 642 transitions. [2021-03-25 04:45:30,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 34 transitions, 225 flow [2021-03-25 04:45:30,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 34 transitions, 214 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-25 04:45:30,173 INFO L241 Difference]: Finished difference. Result has 51 places, 27 transitions, 154 flow [2021-03-25 04:45:30,174 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=51, PETRI_TRANSITIONS=27} [2021-03-25 04:45:30,174 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2021-03-25 04:45:30,174 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:45:30,174 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 27 transitions, 154 flow [2021-03-25 04:45:30,174 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 27 transitions, 154 flow [2021-03-25 04:45:30,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 27 transitions, 154 flow [2021-03-25 04:45:30,181 INFO L129 PetriNetUnfolder]: 13/63 cut-off events. [2021-03-25 04:45:30,181 INFO L130 PetriNetUnfolder]: For 85/87 co-relation queries the response was YES. [2021-03-25 04:45:30,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 63 events. 13/63 cut-off events. For 85/87 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 211 event pairs, 0 based on Foata normal form. 2/64 useless extension candidates. Maximal degree in co-relation 182. Up to 18 conditions per place. [2021-03-25 04:45:30,182 INFO L142 LiptonReduction]: Number of co-enabled transitions 80 [2021-03-25 04:45:30,505 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 71 [2021-03-25 04:45:30,775 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 90 [2021-03-25 04:45:30,834 INFO L154 LiptonReduction]: Checked pairs total: 16 [2021-03-25 04:45:30,834 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:45:30,834 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 660 [2021-03-25 04:45:30,835 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 25 transitions, 157 flow [2021-03-25 04:45:30,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:45:30,835 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:45:30,835 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:45:30,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:45:30,835 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:45:30,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:45:30,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1875540717, now seen corresponding path program 1 times [2021-03-25 04:45:30,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:45:30,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403122561] [2021-03-25 04:45:30,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:45:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:45:30,892 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:45:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:45:30,915 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:45:30,955 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:45:30,956 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:45:30,956 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:45:31,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:45:31 BasicIcfg [2021-03-25 04:45:31,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:45:31,047 INFO L168 Benchmark]: Toolchain (without parser) took 22784.44 ms. Allocated memory was 255.9 MB in the beginning and 633.3 MB in the end (delta: 377.5 MB). Free memory was 236.1 MB in the beginning and 586.7 MB in the end (delta: -350.6 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.0 GB. [2021-03-25 04:45:31,047 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:45:31,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 579.91 ms. Allocated memory was 255.9 MB in the beginning and 364.9 MB in the end (delta: 109.1 MB). Free memory was 236.1 MB in the beginning and 325.0 MB in the end (delta: -88.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 04:45:31,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.37 ms. Allocated memory is still 364.9 MB. Free memory was 325.0 MB in the beginning and 321.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:45:31,048 INFO L168 Benchmark]: Boogie Preprocessor took 57.96 ms. Allocated memory is still 364.9 MB. Free memory was 321.7 MB in the beginning and 319.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:45:31,048 INFO L168 Benchmark]: RCFGBuilder took 1671.08 ms. Allocated memory is still 364.9 MB. Free memory was 319.6 MB in the beginning and 246.9 MB in the end (delta: 72.7 MB). Peak memory consumption was 76.0 MB. Max. memory is 16.0 GB. [2021-03-25 04:45:31,048 INFO L168 Benchmark]: TraceAbstraction took 20388.43 ms. Allocated memory was 364.9 MB in the beginning and 633.3 MB in the end (delta: 268.4 MB). Free memory was 245.9 MB in the beginning and 586.7 MB in the end (delta: -340.8 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:45:31,049 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.54 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 579.91 ms. Allocated memory was 255.9 MB in the beginning and 364.9 MB in the end (delta: 109.1 MB). Free memory was 236.1 MB in the beginning and 325.0 MB in the end (delta: -88.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 79.37 ms. Allocated memory is still 364.9 MB. Free memory was 325.0 MB in the beginning and 321.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 57.96 ms. Allocated memory is still 364.9 MB. Free memory was 321.7 MB in the beginning and 319.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1671.08 ms. Allocated memory is still 364.9 MB. Free memory was 319.6 MB in the beginning and 246.9 MB in the end (delta: 72.7 MB). Peak memory consumption was 76.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20388.43 ms. Allocated memory was 364.9 MB in the beginning and 633.3 MB in the end (delta: 268.4 MB). Free memory was 245.9 MB in the beginning and 586.7 MB in the end (delta: -340.8 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7460.8ms, 106 PlacesBefore, 48 PlacesAfterwards, 98 TransitionsBefore, 39 TransitionsAfterwards, 1738 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, 2986 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1482, positive: 1398, positive conditional: 0, positive unconditional: 1398, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 843, positive: 816, positive conditional: 0, positive unconditional: 816, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 843, positive: 816, positive conditional: 0, positive unconditional: 816, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1482, positive: 582, positive conditional: 0, positive unconditional: 582, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 843, unknown conditional: 0, unknown unconditional: 843] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3033.6ms, 45 PlacesBefore, 32 PlacesAfterwards, 32 TransitionsBefore, 23 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 1104 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 376, positive: 291, positive conditional: 0, positive unconditional: 291, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 39, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 376, positive: 260, positive conditional: 0, positive unconditional: 260, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 39, unknown conditional: 0, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1337.6ms, 33 PlacesBefore, 30 PlacesAfterwards, 23 TransitionsBefore, 20 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 666 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 226, positive: 172, positive conditional: 0, positive unconditional: 172, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 226, positive: 165, positive conditional: 0, positive unconditional: 165, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5ms, 33 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 229 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 79, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 79, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 677.2ms, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 452 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 212, positive: 184, positive conditional: 0, positive unconditional: 184, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 212, positive: 175, positive conditional: 0, positive unconditional: 175, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.0ms, 45 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 208 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 73, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 73, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.0ms, 53 PlacesBefore, 53 PlacesAfterwards, 42 TransitionsBefore, 40 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 560 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 253, positive: 229, positive conditional: 0, positive unconditional: 229, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 253, positive: 222, positive conditional: 0, positive unconditional: 222, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4026.4ms, 52 PlacesBefore, 48 PlacesAfterwards, 35 TransitionsBefore, 32 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 537 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 299, positive: 263, positive conditional: 0, positive unconditional: 263, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 299, positive: 259, positive conditional: 0, positive unconditional: 259, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 495.0ms, 46 PlacesBefore, 44 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 163 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 95, positive: 85, positive conditional: 0, positive unconditional: 85, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 95, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.5ms, 51 PlacesBefore, 50 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 659.8ms, 51 PlacesBefore, 45 PlacesAfterwards, 27 TransitionsBefore, 25 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 16 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1126; [L826] FCALL, FORK 0 pthread_create(&t1126, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1127; [L828] FCALL, FORK 0 pthread_create(&t1127, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t1128; [L830] FCALL, FORK 0 pthread_create(&t1128, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 [L794] 3 z = 1 [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 1 [L765] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L848] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L849] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L851] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L852] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20172.9ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 833.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7560.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 41 SDtfs, 22 SDslu, 20 SDs, 0 SdLazy, 203 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 239.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 254.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=6, InterpolantAutomatonStates: 48, 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: 40.8ms SsaConstructionTime, 418.2ms SatisfiabilityAnalysisTime, 757.4ms InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 618 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...