/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:22:09,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:22:09,794 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:22:09,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:22:09,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:22:09,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:22:09,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:22:09,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:22:09,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:22:09,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:22:09,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:22:09,853 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:22:09,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:22:09,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:22:09,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:22:09,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:22:09,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:22:09,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:22:09,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:22:09,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:22:09,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:22:09,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:22:09,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:22:09,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:22:09,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:22:09,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:22:09,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:22:09,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:22:09,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:22:09,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:22:09,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:22:09,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:22:09,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:22:09,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:22:09,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:22:09,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:22:09,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:22:09,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:22:09,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:22:09,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:22:09,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:22:09,888 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-RepeatedSemanticLbe.epf [2021-03-25 14:22:09,926 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:22:09,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:22:09,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:22:09,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:22:09,929 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:22:09,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:22:09,930 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:22:09,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:22:09,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:22:09,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:22:09,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:22:09,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:22:09,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:22:09,931 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:22:09,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:22:09,932 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:22:09,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:22:09,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:22:09,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:22:09,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:22:09,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:22:09,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:22:09,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:22:09,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:22:09,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:22:09,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:22:09,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:22:09,933 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:22:09,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:22:09,933 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 14:22:10,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:22:10,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:22:10,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:22:10,262 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:22:10,263 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:22:10,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2021-03-25 14:22:10,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5efc704c4/c6eac52b96af45ef91325ba92822907f/FLAG1d224317a [2021-03-25 14:22:10,895 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:22:10,896 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2021-03-25 14:22:10,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5efc704c4/c6eac52b96af45ef91325ba92822907f/FLAG1d224317a [2021-03-25 14:22:11,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5efc704c4/c6eac52b96af45ef91325ba92822907f [2021-03-25 14:22:11,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:22:11,341 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:22:11,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:22:11,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:22:11,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:22:11,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:22:11" (1/1) ... [2021-03-25 14:22:11,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ceee96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:11, skipping insertion in model container [2021-03-25 14:22:11,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:22:11" (1/1) ... [2021-03-25 14:22:11,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:22:11,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:22:11,569 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/mix018_tso.oepc.i[949,962] [2021-03-25 14:22:11,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:22:11,816 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:22:11,829 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/mix018_tso.oepc.i[949,962] [2021-03-25 14:22:11,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:22:11,929 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:22:11,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:11 WrapperNode [2021-03-25 14:22:11,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:22:11,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:22:11,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:22:11,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:22:11,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:11" (1/1) ... [2021-03-25 14:22:11,950 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:11" (1/1) ... [2021-03-25 14:22:11,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:22:11,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:22:11,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:22:11,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:22:11,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:11" (1/1) ... [2021-03-25 14:22:12,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:11" (1/1) ... [2021-03-25 14:22:12,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:11" (1/1) ... [2021-03-25 14:22:12,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:11" (1/1) ... [2021-03-25 14:22:12,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:11" (1/1) ... [2021-03-25 14:22:12,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:11" (1/1) ... [2021-03-25 14:22:12,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:11" (1/1) ... [2021-03-25 14:22:12,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:22:12,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:22:12,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:22:12,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:22:12,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:11" (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 14:22:12,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:22:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:22:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:22:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:22:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:22:12,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:22:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:22:12,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:22:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:22:12,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:22:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:22:12,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:22:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:22:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:22:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:22:12,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:22:12,133 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 14:22:14,042 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:22:14,042 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:22:14,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:22:14 BoogieIcfgContainer [2021-03-25 14:22:14,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:22:14,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:22:14,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:22:14,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:22:14,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:22:11" (1/3) ... [2021-03-25 14:22:14,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e416c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:22:14, skipping insertion in model container [2021-03-25 14:22:14,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:11" (2/3) ... [2021-03-25 14:22:14,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e416c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:22:14, skipping insertion in model container [2021-03-25 14:22:14,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:22:14" (3/3) ... [2021-03-25 14:22:14,050 INFO L111 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2021-03-25 14:22:14,056 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:22:14,060 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:22:14,060 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:22:14,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,099 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,100 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,100 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,100 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,104 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,104 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,105 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,105 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,113 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,114 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,114 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,114 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,118 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,118 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,119 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,119 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,134 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,134 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,137 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,137 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,138 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,138 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,138 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,138 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,139 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,140 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,140 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:14,142 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:22:14,158 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:22:14,184 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:22:14,184 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:22:14,185 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:22:14,185 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:22:14,185 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:22:14,185 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:22:14,185 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:22:14,185 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:22:14,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 118 transitions, 256 flow [2021-03-25 14:22:14,250 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-25 14:22:14,250 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:14,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-25 14:22:14,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 118 transitions, 256 flow [2021-03-25 14:22:14,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 114 transitions, 240 flow [2021-03-25 14:22:14,261 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:14,271 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-25 14:22:14,273 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-25 14:22:14,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 240 flow [2021-03-25 14:22:14,310 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-25 14:22:14,310 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:14,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2021-03-25 14:22:14,315 INFO L142 LiptonReduction]: Number of co-enabled transitions 2766 [2021-03-25 14:22:15,995 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:22:16,457 WARN L205 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:22:16,572 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:22:17,587 WARN L205 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-25 14:22:17,920 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:22:19,276 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-25 14:22:19,907 WARN L205 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:22:21,163 INFO L154 LiptonReduction]: Checked pairs total: 5208 [2021-03-25 14:22:21,164 INFO L156 LiptonReduction]: Total number of compositions: 73 [2021-03-25 14:22:21,166 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6906 [2021-03-25 14:22:21,174 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 14:22:21,174 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:21,174 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:21,175 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:21,175 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:21,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:21,179 INFO L82 PathProgramCache]: Analyzing trace with hash -984520006, now seen corresponding path program 1 times [2021-03-25 14:22:21,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:21,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377912646] [2021-03-25 14:22:21,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:21,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:21,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:21,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:21,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:21,391 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 14:22:21,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377912646] [2021-03-25 14:22:21,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:21,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:22:21,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412535860] [2021-03-25 14:22:21,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:22:21,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:21,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:22:21,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:22:21,414 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 191 [2021-03-25 14:22:21,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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 14:22:21,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:21,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 191 [2021-03-25 14:22:21,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:21,570 INFO L129 PetriNetUnfolder]: 133/384 cut-off events. [2021-03-25 14:22:21,570 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:21,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 384 events. 133/384 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2154 event pairs, 87 based on Foata normal form. 20/365 useless extension candidates. Maximal degree in co-relation 581. Up to 153 conditions per place. [2021-03-25 14:22:21,578 INFO L132 encePairwiseOnDemand]: 187/191 looper letters, 11 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2021-03-25 14:22:21,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 50 transitions, 138 flow [2021-03-25 14:22:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:22:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:22:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2021-03-25 14:22:21,603 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9179755671902269 [2021-03-25 14:22:21,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2021-03-25 14:22:21,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2021-03-25 14:22:21,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:21,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2021-03-25 14:22:21,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states 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 14:22:21,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 14:22:21,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 14:22:21,626 INFO L185 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 3 states and 526 transitions. [2021-03-25 14:22:21,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 50 transitions, 138 flow [2021-03-25 14:22:21,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:22:21,631 INFO L241 Difference]: Finished difference. Result has 56 places, 45 transitions, 102 flow [2021-03-25 14:22:21,632 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2021-03-25 14:22:21,633 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2021-03-25 14:22:21,633 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:21,633 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 102 flow [2021-03-25 14:22:21,634 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 102 flow [2021-03-25 14:22:21,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 102 flow [2021-03-25 14:22:21,642 INFO L129 PetriNetUnfolder]: 0/45 cut-off events. [2021-03-25 14:22:21,642 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:21,642 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 45 events. 0/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:22:21,644 INFO L142 LiptonReduction]: Number of co-enabled transitions 618 [2021-03-25 14:22:22,185 WARN L205 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-25 14:22:22,535 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-25 14:22:23,888 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 270 DAG size of output: 269 [2021-03-25 14:22:24,500 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 14:22:24,793 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:22:24,901 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:22:25,446 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 199 [2021-03-25 14:22:25,738 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 199 [2021-03-25 14:22:26,979 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 281 DAG size of output: 280 [2021-03-25 14:22:27,638 WARN L205 SmtUtils]: Spent 657.00 ms on a formula simplification that was a NOOP. DAG size: 280 [2021-03-25 14:22:28,366 INFO L154 LiptonReduction]: Checked pairs total: 2452 [2021-03-25 14:22:28,367 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-25 14:22:28,367 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6734 [2021-03-25 14:22:28,368 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 76 flow [2021-03-25 14:22:28,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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 14:22:28,368 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:28,368 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:28,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:22:28,369 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:28,369 INFO L82 PathProgramCache]: Analyzing trace with hash 388611904, now seen corresponding path program 1 times [2021-03-25 14:22:28,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:28,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907943985] [2021-03-25 14:22:28,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:28,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:28,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:28,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:28,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:28,506 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:22:28,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:22:28,510 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 14:22:28,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907943985] [2021-03-25 14:22:28,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:28,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:28,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748728667] [2021-03-25 14:22:28,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:28,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:28,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:28,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:28,513 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 205 [2021-03-25 14:22:28,514 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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 14:22:28,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:28,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 205 [2021-03-25 14:22:28,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:28,554 INFO L129 PetriNetUnfolder]: 1/35 cut-off events. [2021-03-25 14:22:28,554 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:28,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 43. Up to 3 conditions per place. [2021-03-25 14:22:28,555 INFO L132 encePairwiseOnDemand]: 201/205 looper letters, 1 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2021-03-25 14:22:28,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 92 flow [2021-03-25 14:22:28,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:22:28,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:22:28,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 922 transitions. [2021-03-25 14:22:28,557 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8995121951219512 [2021-03-25 14:22:28,557 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 922 transitions. [2021-03-25 14:22:28,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 922 transitions. [2021-03-25 14:22:28,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:28,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 922 transitions. [2021-03-25 14:22:28,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.4) internal successors, (922), 5 states have internal predecessors, (922), 0 states have call successors, (0), 0 states 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 14:22:28,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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 14:22:28,563 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states 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 14:22:28,563 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 76 flow. Second operand 5 states and 922 transitions. [2021-03-25 14:22:28,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 92 flow [2021-03-25 14:22:28,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:22:28,564 INFO L241 Difference]: Finished difference. Result has 46 places, 30 transitions, 76 flow [2021-03-25 14:22:28,564 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2021-03-25 14:22:28,565 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -14 predicate places. [2021-03-25 14:22:28,565 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:28,565 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 30 transitions, 76 flow [2021-03-25 14:22:28,565 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 30 transitions, 76 flow [2021-03-25 14:22:28,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 76 flow [2021-03-25 14:22:28,569 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-25 14:22:28,569 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:28,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:22:28,569 INFO L142 LiptonReduction]: Number of co-enabled transitions 410 [2021-03-25 14:22:28,753 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-25 14:22:29,319 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 14:22:29,464 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:22:29,761 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 14:22:29,900 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:22:29,906 INFO L154 LiptonReduction]: Checked pairs total: 1444 [2021-03-25 14:22:29,906 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:22:29,906 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1341 [2021-03-25 14:22:29,907 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2021-03-25 14:22:29,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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 14:22:29,907 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:29,908 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:29,908 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:22:29,908 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:29,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:29,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1175110612, now seen corresponding path program 1 times [2021-03-25 14:22:29,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:29,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224217952] [2021-03-25 14:22:29,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:30,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:30,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:30,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:30,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:22:30,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:30,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:22:30,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:30,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:22:30,050 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 14:22:30,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224217952] [2021-03-25 14:22:30,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:30,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:22:30,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430846203] [2021-03-25 14:22:30,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:22:30,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:30,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:22:30,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:22:30,053 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 208 [2021-03-25 14:22:30,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:30,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:30,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 208 [2021-03-25 14:22:30,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:30,173 INFO L129 PetriNetUnfolder]: 225/404 cut-off events. [2021-03-25 14:22:30,174 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-03-25 14:22:30,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 404 events. 225/404 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1965 event pairs, 150 based on Foata normal form. 4/389 useless extension candidates. Maximal degree in co-relation 781. Up to 316 conditions per place. [2021-03-25 14:22:30,177 INFO L132 encePairwiseOnDemand]: 200/208 looper letters, 11 selfloop transitions, 9 changer transitions 0/38 dead transitions. [2021-03-25 14:22:30,177 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 134 flow [2021-03-25 14:22:30,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:22:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:22:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 669 transitions. [2021-03-25 14:22:30,180 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8040865384615384 [2021-03-25 14:22:30,180 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 669 transitions. [2021-03-25 14:22:30,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 669 transitions. [2021-03-25 14:22:30,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:30,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 669 transitions. [2021-03-25 14:22:30,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states 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 14:22:30,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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 14:22:30,185 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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 14:22:30,185 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 4 states and 669 transitions. [2021-03-25 14:22:30,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 134 flow [2021-03-25 14:22:30,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:22:30,187 INFO L241 Difference]: Finished difference. Result has 42 places, 35 transitions, 128 flow [2021-03-25 14:22:30,188 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2021-03-25 14:22:30,188 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -18 predicate places. [2021-03-25 14:22:30,188 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:30,188 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 35 transitions, 128 flow [2021-03-25 14:22:30,189 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 128 flow [2021-03-25 14:22:30,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 128 flow [2021-03-25 14:22:30,218 INFO L129 PetriNetUnfolder]: 74/205 cut-off events. [2021-03-25 14:22:30,218 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2021-03-25 14:22:30,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 205 events. 74/205 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 981 event pairs, 30 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 417. Up to 113 conditions per place. [2021-03-25 14:22:30,221 INFO L142 LiptonReduction]: Number of co-enabled transitions 516 [2021-03-25 14:22:30,343 INFO L154 LiptonReduction]: Checked pairs total: 275 [2021-03-25 14:22:30,343 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:22:30,343 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 155 [2021-03-25 14:22:30,344 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 128 flow [2021-03-25 14:22:30,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:30,345 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:30,345 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:30,345 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:22:30,345 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:30,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:30,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2113176427, now seen corresponding path program 1 times [2021-03-25 14:22:30,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:30,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198509658] [2021-03-25 14:22:30,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:30,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:30,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:22:30,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:30,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:22:30,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:30,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:22:30,484 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 14:22:30,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198509658] [2021-03-25 14:22:30,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:30,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:30,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687392498] [2021-03-25 14:22:30,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:22:30,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:30,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:22:30,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:22:30,487 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 208 [2021-03-25 14:22:30,488 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 0 states have call successors, (0), 0 states 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 14:22:30,488 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:30,488 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 208 [2021-03-25 14:22:30,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:30,627 INFO L129 PetriNetUnfolder]: 222/414 cut-off events. [2021-03-25 14:22:30,628 INFO L130 PetriNetUnfolder]: For 235/369 co-relation queries the response was YES. [2021-03-25 14:22:30,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 414 events. 222/414 cut-off events. For 235/369 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2088 event pairs, 49 based on Foata normal form. 17/412 useless extension candidates. Maximal degree in co-relation 1157. Up to 311 conditions per place. [2021-03-25 14:22:30,631 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 12 selfloop transitions, 11 changer transitions 0/41 dead transitions. [2021-03-25 14:22:30,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 195 flow [2021-03-25 14:22:30,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:22:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:22:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 664 transitions. [2021-03-25 14:22:30,634 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7980769230769231 [2021-03-25 14:22:30,634 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 664 transitions. [2021-03-25 14:22:30,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 664 transitions. [2021-03-25 14:22:30,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:30,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 664 transitions. [2021-03-25 14:22:30,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:30,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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 14:22:30,638 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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 14:22:30,639 INFO L185 Difference]: Start difference. First operand has 42 places, 35 transitions, 128 flow. Second operand 4 states and 664 transitions. [2021-03-25 14:22:30,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 195 flow [2021-03-25 14:22:30,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 195 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:22:30,642 INFO L241 Difference]: Finished difference. Result has 46 places, 38 transitions, 178 flow [2021-03-25 14:22:30,642 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2021-03-25 14:22:30,642 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -14 predicate places. [2021-03-25 14:22:30,642 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:30,642 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 38 transitions, 178 flow [2021-03-25 14:22:30,643 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 38 transitions, 178 flow [2021-03-25 14:22:30,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 38 transitions, 178 flow [2021-03-25 14:22:30,673 INFO L129 PetriNetUnfolder]: 115/266 cut-off events. [2021-03-25 14:22:30,673 INFO L130 PetriNetUnfolder]: For 160/192 co-relation queries the response was YES. [2021-03-25 14:22:30,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 266 events. 115/266 cut-off events. For 160/192 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1317 event pairs, 61 based on Foata normal form. 6/264 useless extension candidates. Maximal degree in co-relation 726. Up to 152 conditions per place. [2021-03-25 14:22:30,677 INFO L142 LiptonReduction]: Number of co-enabled transitions 542 [2021-03-25 14:22:30,693 INFO L154 LiptonReduction]: Checked pairs total: 411 [2021-03-25 14:22:30,693 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:22:30,694 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 52 [2021-03-25 14:22:30,698 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 178 flow [2021-03-25 14:22:30,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 0 states have call successors, (0), 0 states 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 14:22:30,699 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:30,699 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:30,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:22:30,699 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:30,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:30,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1085548018, now seen corresponding path program 1 times [2021-03-25 14:22:30,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:30,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526684474] [2021-03-25 14:22:30,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:30,824 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:22:30,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:22:30,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:30,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:22:30,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:30,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:22:30,859 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 14:22:30,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526684474] [2021-03-25 14:22:30,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:30,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:30,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444782159] [2021-03-25 14:22:30,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:22:30,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:30,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:22:30,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:22:30,862 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 208 [2021-03-25 14:22:30,862 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:30,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:30,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 208 [2021-03-25 14:22:30,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:31,002 INFO L129 PetriNetUnfolder]: 238/425 cut-off events. [2021-03-25 14:22:31,003 INFO L130 PetriNetUnfolder]: For 404/638 co-relation queries the response was YES. [2021-03-25 14:22:31,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 425 events. 238/425 cut-off events. For 404/638 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2016 event pairs, 97 based on Foata normal form. 16/425 useless extension candidates. Maximal degree in co-relation 1484. Up to 270 conditions per place. [2021-03-25 14:22:31,007 INFO L132 encePairwiseOnDemand]: 200/208 looper letters, 21 selfloop transitions, 9 changer transitions 0/48 dead transitions. [2021-03-25 14:22:31,007 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 288 flow [2021-03-25 14:22:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:22:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:22:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 669 transitions. [2021-03-25 14:22:31,010 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8040865384615384 [2021-03-25 14:22:31,010 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 669 transitions. [2021-03-25 14:22:31,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 669 transitions. [2021-03-25 14:22:31,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:31,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 669 transitions. [2021-03-25 14:22:31,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states 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 14:22:31,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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 14:22:31,014 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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 14:22:31,014 INFO L185 Difference]: Start difference. First operand has 46 places, 38 transitions, 178 flow. Second operand 4 states and 669 transitions. [2021-03-25 14:22:31,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 288 flow [2021-03-25 14:22:31,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 48 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:22:31,017 INFO L241 Difference]: Finished difference. Result has 48 places, 43 transitions, 221 flow [2021-03-25 14:22:31,018 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2021-03-25 14:22:31,018 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -12 predicate places. [2021-03-25 14:22:31,018 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:31,018 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 43 transitions, 221 flow [2021-03-25 14:22:31,018 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 43 transitions, 221 flow [2021-03-25 14:22:31,019 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 221 flow [2021-03-25 14:22:31,070 INFO L129 PetriNetUnfolder]: 216/416 cut-off events. [2021-03-25 14:22:31,070 INFO L130 PetriNetUnfolder]: For 541/599 co-relation queries the response was YES. [2021-03-25 14:22:31,072 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 416 events. 216/416 cut-off events. For 541/599 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2122 event pairs, 90 based on Foata normal form. 2/389 useless extension candidates. Maximal degree in co-relation 1355. Up to 240 conditions per place. [2021-03-25 14:22:31,076 INFO L142 LiptonReduction]: Number of co-enabled transitions 604 [2021-03-25 14:22:31,092 INFO L154 LiptonReduction]: Checked pairs total: 276 [2021-03-25 14:22:31,093 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:22:31,093 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 75 [2021-03-25 14:22:31,094 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 221 flow [2021-03-25 14:22:31,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:31,095 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:31,095 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:31,095 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:22:31,095 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:31,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:31,095 INFO L82 PathProgramCache]: Analyzing trace with hash 281947270, now seen corresponding path program 2 times [2021-03-25 14:22:31,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:31,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371739857] [2021-03-25 14:22:31,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:31,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:31,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:22:31,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:31,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:22:31,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:31,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:22:31,210 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 14:22:31,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371739857] [2021-03-25 14:22:31,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:31,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:31,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940166941] [2021-03-25 14:22:31,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:22:31,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:31,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:22:31,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:22:31,214 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 208 [2021-03-25 14:22:31,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:31,215 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:31,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 208 [2021-03-25 14:22:31,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:31,331 INFO L129 PetriNetUnfolder]: 239/428 cut-off events. [2021-03-25 14:22:31,331 INFO L130 PetriNetUnfolder]: For 544/899 co-relation queries the response was YES. [2021-03-25 14:22:31,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 428 events. 239/428 cut-off events. For 544/899 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2070 event pairs, 118 based on Foata normal form. 25/437 useless extension candidates. Maximal degree in co-relation 1738. Up to 272 conditions per place. [2021-03-25 14:22:31,336 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 22 selfloop transitions, 12 changer transitions 0/52 dead transitions. [2021-03-25 14:22:31,336 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 353 flow [2021-03-25 14:22:31,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:22:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:22:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 681 transitions. [2021-03-25 14:22:31,339 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8185096153846154 [2021-03-25 14:22:31,339 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 681 transitions. [2021-03-25 14:22:31,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 681 transitions. [2021-03-25 14:22:31,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:31,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 681 transitions. [2021-03-25 14:22:31,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.25) internal successors, (681), 4 states have internal predecessors, (681), 0 states have call successors, (0), 0 states 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 14:22:31,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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 14:22:31,342 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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 14:22:31,342 INFO L185 Difference]: Start difference. First operand has 48 places, 43 transitions, 221 flow. Second operand 4 states and 681 transitions. [2021-03-25 14:22:31,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 353 flow [2021-03-25 14:22:31,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 336 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-25 14:22:31,347 INFO L241 Difference]: Finished difference. Result has 51 places, 47 transitions, 271 flow [2021-03-25 14:22:31,347 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2021-03-25 14:22:31,347 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2021-03-25 14:22:31,348 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:31,348 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 47 transitions, 271 flow [2021-03-25 14:22:31,348 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 47 transitions, 271 flow [2021-03-25 14:22:31,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 47 transitions, 271 flow [2021-03-25 14:22:31,401 INFO L129 PetriNetUnfolder]: 218/432 cut-off events. [2021-03-25 14:22:31,401 INFO L130 PetriNetUnfolder]: For 830/942 co-relation queries the response was YES. [2021-03-25 14:22:31,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 432 events. 218/432 cut-off events. For 830/942 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2298 event pairs, 82 based on Foata normal form. 4/409 useless extension candidates. Maximal degree in co-relation 1557. Up to 225 conditions per place. [2021-03-25 14:22:31,407 INFO L142 LiptonReduction]: Number of co-enabled transitions 640 [2021-03-25 14:22:31,598 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 14:22:31,988 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-25 14:22:32,143 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-25 14:22:32,169 INFO L154 LiptonReduction]: Checked pairs total: 670 [2021-03-25 14:22:32,169 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:22:32,169 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 821 [2021-03-25 14:22:32,175 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 276 flow [2021-03-25 14:22:32,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:32,176 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:32,176 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:32,176 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:22:32,177 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:32,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:32,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1852339428, now seen corresponding path program 1 times [2021-03-25 14:22:32,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:32,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831759936] [2021-03-25 14:22:32,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:32,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:32,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:22:32,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:32,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:22:32,261 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 14:22:32,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 14:22:32,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:32,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:22:32,292 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 14:22:32,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831759936] [2021-03-25 14:22:32,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:32,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:22:32,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753513335] [2021-03-25 14:22:32,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:22:32,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:32,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:22:32,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:22:32,294 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 209 [2021-03-25 14:22:32,295 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:32,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:32,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 209 [2021-03-25 14:22:32,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:32,482 INFO L129 PetriNetUnfolder]: 259/461 cut-off events. [2021-03-25 14:22:32,482 INFO L130 PetriNetUnfolder]: For 981/1472 co-relation queries the response was YES. [2021-03-25 14:22:32,484 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 461 events. 259/461 cut-off events. For 981/1472 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2222 event pairs, 78 based on Foata normal form. 41/477 useless extension candidates. Maximal degree in co-relation 2082. Up to 288 conditions per place. [2021-03-25 14:22:32,487 INFO L132 encePairwiseOnDemand]: 200/209 looper letters, 26 selfloop transitions, 13 changer transitions 0/57 dead transitions. [2021-03-25 14:22:32,487 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 438 flow [2021-03-25 14:22:32,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:22:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:22:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 836 transitions. [2021-03-25 14:22:32,490 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8 [2021-03-25 14:22:32,490 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 836 transitions. [2021-03-25 14:22:32,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 836 transitions. [2021-03-25 14:22:32,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:32,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 836 transitions. [2021-03-25 14:22:32,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 0 states have call successors, (0), 0 states 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 14:22:32,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states 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 14:22:32,494 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states 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 14:22:32,495 INFO L185 Difference]: Start difference. First operand has 51 places, 47 transitions, 276 flow. Second operand 5 states and 836 transitions. [2021-03-25 14:22:32,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 438 flow [2021-03-25 14:22:32,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 419 flow, removed 7 selfloop flow, removed 1 redundant places. [2021-03-25 14:22:32,500 INFO L241 Difference]: Finished difference. Result has 55 places, 51 transitions, 330 flow [2021-03-25 14:22:32,501 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=330, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2021-03-25 14:22:32,501 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2021-03-25 14:22:32,501 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:32,501 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions, 330 flow [2021-03-25 14:22:32,501 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 51 transitions, 330 flow [2021-03-25 14:22:32,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 330 flow [2021-03-25 14:22:32,556 INFO L129 PetriNetUnfolder]: 241/458 cut-off events. [2021-03-25 14:22:32,556 INFO L130 PetriNetUnfolder]: For 1391/1583 co-relation queries the response was YES. [2021-03-25 14:22:32,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1875 conditions, 458 events. 241/458 cut-off events. For 1391/1583 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2396 event pairs, 92 based on Foata normal form. 4/443 useless extension candidates. Maximal degree in co-relation 1857. Up to 232 conditions per place. [2021-03-25 14:22:32,563 INFO L142 LiptonReduction]: Number of co-enabled transitions 708 [2021-03-25 14:22:32,588 INFO L154 LiptonReduction]: Checked pairs total: 747 [2021-03-25 14:22:32,588 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:22:32,588 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 87 [2021-03-25 14:22:32,590 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 330 flow [2021-03-25 14:22:32,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:32,591 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:32,591 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:32,591 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:22:32,591 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:32,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:32,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1706434804, now seen corresponding path program 1 times [2021-03-25 14:22:32,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:32,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578909182] [2021-03-25 14:22:32,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:32,659 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:22:32,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:22:32,680 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:22:32,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:22:32,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:32,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:22:32,691 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 14:22:32,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578909182] [2021-03-25 14:22:32,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:32,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:22:32,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199204606] [2021-03-25 14:22:32,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:32,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:32,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:32,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:32,693 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 209 [2021-03-25 14:22:32,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:32,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:32,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 209 [2021-03-25 14:22:32,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:32,836 INFO L129 PetriNetUnfolder]: 263/497 cut-off events. [2021-03-25 14:22:32,836 INFO L130 PetriNetUnfolder]: For 1383/2064 co-relation queries the response was YES. [2021-03-25 14:22:32,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 497 events. 263/497 cut-off events. For 1383/2064 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2518 event pairs, 42 based on Foata normal form. 27/508 useless extension candidates. Maximal degree in co-relation 2374. Up to 305 conditions per place. [2021-03-25 14:22:32,842 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 30 selfloop transitions, 15 changer transitions 0/63 dead transitions. [2021-03-25 14:22:32,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 546 flow [2021-03-25 14:22:32,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:22:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:22:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 684 transitions. [2021-03-25 14:22:32,845 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2021-03-25 14:22:32,845 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 684 transitions. [2021-03-25 14:22:32,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 684 transitions. [2021-03-25 14:22:32,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:32,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 684 transitions. [2021-03-25 14:22:32,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:32,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states 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 14:22:32,849 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states 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 14:22:32,849 INFO L185 Difference]: Start difference. First operand has 55 places, 51 transitions, 330 flow. Second operand 4 states and 684 transitions. [2021-03-25 14:22:32,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 546 flow [2021-03-25 14:22:32,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 507 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-03-25 14:22:32,853 INFO L241 Difference]: Finished difference. Result has 57 places, 57 transitions, 420 flow [2021-03-25 14:22:32,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=420, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2021-03-25 14:22:32,853 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2021-03-25 14:22:32,853 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:32,853 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 57 transitions, 420 flow [2021-03-25 14:22:32,854 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 57 transitions, 420 flow [2021-03-25 14:22:32,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 57 transitions, 420 flow [2021-03-25 14:22:32,911 INFO L129 PetriNetUnfolder]: 251/478 cut-off events. [2021-03-25 14:22:32,911 INFO L130 PetriNetUnfolder]: For 1871/2198 co-relation queries the response was YES. [2021-03-25 14:22:32,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2101 conditions, 478 events. 251/478 cut-off events. For 1871/2198 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2522 event pairs, 40 based on Foata normal form. 6/467 useless extension candidates. Maximal degree in co-relation 2081. Up to 243 conditions per place. [2021-03-25 14:22:32,919 INFO L142 LiptonReduction]: Number of co-enabled transitions 802 [2021-03-25 14:22:32,950 INFO L154 LiptonReduction]: Checked pairs total: 609 [2021-03-25 14:22:32,950 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:22:32,950 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 97 [2021-03-25 14:22:32,951 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 420 flow [2021-03-25 14:22:32,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:32,951 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:32,951 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:32,951 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:22:32,951 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:32,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1359871246, now seen corresponding path program 1 times [2021-03-25 14:22:32,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:32,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684886862] [2021-03-25 14:22:32,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:33,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:33,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:22:33,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:33,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:22:33,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:33,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:22:33,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:33,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:22:33,050 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 14:22:33,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684886862] [2021-03-25 14:22:33,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:33,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:33,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399257145] [2021-03-25 14:22:33,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:22:33,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:33,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:22:33,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:22:33,052 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 209 [2021-03-25 14:22:33,052 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 420 flow. Second operand has 5 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 0 states have call successors, (0), 0 states 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 14:22:33,052 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:33,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 209 [2021-03-25 14:22:33,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:33,229 INFO L129 PetriNetUnfolder]: 271/495 cut-off events. [2021-03-25 14:22:33,229 INFO L130 PetriNetUnfolder]: For 2393/3609 co-relation queries the response was YES. [2021-03-25 14:22:33,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2595 conditions, 495 events. 271/495 cut-off events. For 2393/3609 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2404 event pairs, 46 based on Foata normal form. 47/525 useless extension candidates. Maximal degree in co-relation 2573. Up to 269 conditions per place. [2021-03-25 14:22:33,235 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 27 selfloop transitions, 21 changer transitions 0/66 dead transitions. [2021-03-25 14:22:33,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 66 transitions, 608 flow [2021-03-25 14:22:33,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:22:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:22:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 659 transitions. [2021-03-25 14:22:33,238 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7882775119617225 [2021-03-25 14:22:33,238 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 659 transitions. [2021-03-25 14:22:33,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 659 transitions. [2021-03-25 14:22:33,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:33,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 659 transitions. [2021-03-25 14:22:33,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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 14:22:33,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states 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 14:22:33,243 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states 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 14:22:33,243 INFO L185 Difference]: Start difference. First operand has 57 places, 57 transitions, 420 flow. Second operand 4 states and 659 transitions. [2021-03-25 14:22:33,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 66 transitions, 608 flow [2021-03-25 14:22:33,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 593 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-25 14:22:33,247 INFO L241 Difference]: Finished difference. Result has 61 places, 61 transitions, 530 flow [2021-03-25 14:22:33,247 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=530, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2021-03-25 14:22:33,247 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2021-03-25 14:22:33,247 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:33,247 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 61 transitions, 530 flow [2021-03-25 14:22:33,248 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 61 transitions, 530 flow [2021-03-25 14:22:33,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 61 transitions, 530 flow [2021-03-25 14:22:33,310 INFO L129 PetriNetUnfolder]: 265/515 cut-off events. [2021-03-25 14:22:33,310 INFO L130 PetriNetUnfolder]: For 2390/3040 co-relation queries the response was YES. [2021-03-25 14:22:33,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2565 conditions, 515 events. 265/515 cut-off events. For 2390/3040 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2707 event pairs, 33 based on Foata normal form. 11/507 useless extension candidates. Maximal degree in co-relation 2542. Up to 265 conditions per place. [2021-03-25 14:22:33,318 INFO L142 LiptonReduction]: Number of co-enabled transitions 872 [2021-03-25 14:22:33,378 INFO L154 LiptonReduction]: Checked pairs total: 978 [2021-03-25 14:22:33,379 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:22:33,379 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 132 [2021-03-25 14:22:33,379 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 530 flow [2021-03-25 14:22:33,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 0 states have call successors, (0), 0 states 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 14:22:33,380 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:33,380 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:33,380 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:22:33,380 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:33,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:33,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2104062972, now seen corresponding path program 1 times [2021-03-25 14:22:33,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:33,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569820699] [2021-03-25 14:22:33,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:33,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:33,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:33,459 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:22:33,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:22:33,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:33,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:33,466 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 14:22:33,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569820699] [2021-03-25 14:22:33,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:33,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:33,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500272689] [2021-03-25 14:22:33,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:33,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:33,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:33,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:33,468 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 209 [2021-03-25 14:22:33,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 530 flow. Second operand has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 states 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 14:22:33,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:33,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 209 [2021-03-25 14:22:33,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:33,656 INFO L129 PetriNetUnfolder]: 697/1258 cut-off events. [2021-03-25 14:22:33,657 INFO L130 PetriNetUnfolder]: For 4890/5946 co-relation queries the response was YES. [2021-03-25 14:22:33,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5235 conditions, 1258 events. 697/1258 cut-off events. For 4890/5946 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 8110 event pairs, 240 based on Foata normal form. 224/1375 useless extension candidates. Maximal degree in co-relation 5210. Up to 567 conditions per place. [2021-03-25 14:22:33,675 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 12 selfloop transitions, 10 changer transitions 0/74 dead transitions. [2021-03-25 14:22:33,676 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 600 flow [2021-03-25 14:22:33,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:22:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:22:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 907 transitions. [2021-03-25 14:22:33,678 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8679425837320575 [2021-03-25 14:22:33,678 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 907 transitions. [2021-03-25 14:22:33,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 907 transitions. [2021-03-25 14:22:33,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:33,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 907 transitions. [2021-03-25 14:22:33,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 181.4) internal successors, (907), 5 states have internal predecessors, (907), 0 states have call successors, (0), 0 states 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 14:22:33,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states 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 14:22:33,685 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states 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 14:22:33,685 INFO L185 Difference]: Start difference. First operand has 61 places, 61 transitions, 530 flow. Second operand 5 states and 907 transitions. [2021-03-25 14:22:33,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 600 flow [2021-03-25 14:22:33,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 556 flow, removed 11 selfloop flow, removed 2 redundant places. [2021-03-25 14:22:33,695 INFO L241 Difference]: Finished difference. Result has 66 places, 70 transitions, 569 flow [2021-03-25 14:22:33,695 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=569, PETRI_PLACES=66, PETRI_TRANSITIONS=70} [2021-03-25 14:22:33,696 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 6 predicate places. [2021-03-25 14:22:33,696 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:33,696 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 70 transitions, 569 flow [2021-03-25 14:22:33,696 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 70 transitions, 569 flow [2021-03-25 14:22:33,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 70 transitions, 569 flow [2021-03-25 14:22:33,834 INFO L129 PetriNetUnfolder]: 694/1255 cut-off events. [2021-03-25 14:22:33,834 INFO L130 PetriNetUnfolder]: For 4465/5436 co-relation queries the response was YES. [2021-03-25 14:22:33,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5376 conditions, 1255 events. 694/1255 cut-off events. For 4465/5436 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 8045 event pairs, 189 based on Foata normal form. 55/1183 useless extension candidates. Maximal degree in co-relation 5350. Up to 573 conditions per place. [2021-03-25 14:22:33,860 INFO L142 LiptonReduction]: Number of co-enabled transitions 1182 [2021-03-25 14:22:33,922 INFO L154 LiptonReduction]: Checked pairs total: 513 [2021-03-25 14:22:33,922 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:22:33,923 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 227 [2021-03-25 14:22:33,924 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 569 flow [2021-03-25 14:22:33,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 0 states have call successors, (0), 0 states 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 14:22:33,924 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:33,925 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:33,925 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:22:33,925 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:33,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1946900378, now seen corresponding path program 1 times [2021-03-25 14:22:33,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:33,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059647696] [2021-03-25 14:22:33,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:33,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:33,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:33,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:33,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:33,985 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:22:33,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:22:33,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:33,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:33,993 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 14:22:33,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059647696] [2021-03-25 14:22:33,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:33,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:22:33,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976736297] [2021-03-25 14:22:33,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:22:33,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:33,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:22:33,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:22:33,995 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 209 [2021-03-25 14:22:33,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 569 flow. Second operand has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states 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 14:22:33,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:33,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 209 [2021-03-25 14:22:33,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:34,210 INFO L129 PetriNetUnfolder]: 403/864 cut-off events. [2021-03-25 14:22:34,210 INFO L130 PetriNetUnfolder]: For 3881/6787 co-relation queries the response was YES. [2021-03-25 14:22:34,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3912 conditions, 864 events. 403/864 cut-off events. For 3881/6787 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5909 event pairs, 64 based on Foata normal form. 451/1242 useless extension candidates. Maximal degree in co-relation 3884. Up to 478 conditions per place. [2021-03-25 14:22:34,222 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 12 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2021-03-25 14:22:34,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 79 transitions, 669 flow [2021-03-25 14:22:34,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:22:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:22:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1270 transitions. [2021-03-25 14:22:34,227 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8680792891319207 [2021-03-25 14:22:34,227 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1270 transitions. [2021-03-25 14:22:34,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1270 transitions. [2021-03-25 14:22:34,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:34,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1270 transitions. [2021-03-25 14:22:34,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 181.42857142857142) internal successors, (1270), 7 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states 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 14:22:34,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states 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 14:22:34,234 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 0 states have call successors, (0), 0 states 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 14:22:34,234 INFO L185 Difference]: Start difference. First operand has 66 places, 70 transitions, 569 flow. Second operand 7 states and 1270 transitions. [2021-03-25 14:22:34,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 79 transitions, 669 flow [2021-03-25 14:22:34,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 79 transitions, 664 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:22:34,241 INFO L241 Difference]: Finished difference. Result has 74 places, 75 transitions, 668 flow [2021-03-25 14:22:34,241 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=668, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2021-03-25 14:22:34,242 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2021-03-25 14:22:34,242 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:34,242 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 75 transitions, 668 flow [2021-03-25 14:22:34,242 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 75 transitions, 668 flow [2021-03-25 14:22:34,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 75 transitions, 668 flow [2021-03-25 14:22:34,364 INFO L129 PetriNetUnfolder]: 405/861 cut-off events. [2021-03-25 14:22:34,364 INFO L130 PetriNetUnfolder]: For 4726/6694 co-relation queries the response was YES. [2021-03-25 14:22:34,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4333 conditions, 861 events. 405/861 cut-off events. For 4726/6694 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5971 event pairs, 50 based on Foata normal form. 70/852 useless extension candidates. Maximal degree in co-relation 4303. Up to 473 conditions per place. [2021-03-25 14:22:34,385 INFO L142 LiptonReduction]: Number of co-enabled transitions 1396 [2021-03-25 14:22:34,406 INFO L154 LiptonReduction]: Checked pairs total: 562 [2021-03-25 14:22:34,406 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:22:34,407 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 165 [2021-03-25 14:22:34,407 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 668 flow [2021-03-25 14:22:34,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 0 states have call successors, (0), 0 states 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 14:22:34,408 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:34,408 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 14:22:34,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:22:34,408 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:34,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:34,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1819467498, now seen corresponding path program 1 times [2021-03-25 14:22:34,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:34,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113915324] [2021-03-25 14:22:34,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:34,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:34,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:34,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:34,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:34,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:34,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:34,479 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:22:34,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:22:34,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:34,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:34,488 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 14:22:34,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113915324] [2021-03-25 14:22:34,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:34,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:22:34,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473102251] [2021-03-25 14:22:34,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:22:34,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:34,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:22:34,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:22:34,491 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 209 [2021-03-25 14:22:34,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 668 flow. Second operand has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states 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 14:22:34,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:34,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 209 [2021-03-25 14:22:34,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:34,653 INFO L129 PetriNetUnfolder]: 284/677 cut-off events. [2021-03-25 14:22:34,654 INFO L130 PetriNetUnfolder]: For 5054/9744 co-relation queries the response was YES. [2021-03-25 14:22:34,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3696 conditions, 677 events. 284/677 cut-off events. For 5054/9744 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4762 event pairs, 9 based on Foata normal form. 587/1200 useless extension candidates. Maximal degree in co-relation 3664. Up to 451 conditions per place. [2021-03-25 14:22:34,663 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 6 selfloop transitions, 28 changer transitions 4/82 dead transitions. [2021-03-25 14:22:34,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 82 transitions, 813 flow [2021-03-25 14:22:34,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:22:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:22:34,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1633 transitions. [2021-03-25 14:22:34,666 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8681552365762892 [2021-03-25 14:22:34,666 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1633 transitions. [2021-03-25 14:22:34,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1633 transitions. [2021-03-25 14:22:34,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:34,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1633 transitions. [2021-03-25 14:22:34,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 181.44444444444446) internal successors, (1633), 9 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states 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 14:22:34,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states 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 14:22:34,673 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 209.0) internal successors, (2090), 10 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states 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 14:22:34,674 INFO L185 Difference]: Start difference. First operand has 74 places, 75 transitions, 668 flow. Second operand 9 states and 1633 transitions. [2021-03-25 14:22:34,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 82 transitions, 813 flow [2021-03-25 14:22:34,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 82 transitions, 710 flow, removed 31 selfloop flow, removed 7 redundant places. [2021-03-25 14:22:34,687 INFO L241 Difference]: Finished difference. Result has 78 places, 78 transitions, 686 flow [2021-03-25 14:22:34,687 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=686, PETRI_PLACES=78, PETRI_TRANSITIONS=78} [2021-03-25 14:22:34,687 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 18 predicate places. [2021-03-25 14:22:34,687 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:34,687 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 78 transitions, 686 flow [2021-03-25 14:22:34,688 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 78 transitions, 686 flow [2021-03-25 14:22:34,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 78 transitions, 686 flow [2021-03-25 14:22:34,750 INFO L129 PetriNetUnfolder]: 275/662 cut-off events. [2021-03-25 14:22:34,751 INFO L130 PetriNetUnfolder]: For 4145/5407 co-relation queries the response was YES. [2021-03-25 14:22:34,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3200 conditions, 662 events. 275/662 cut-off events. For 4145/5407 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4667 event pairs, 8 based on Foata normal form. 34/625 useless extension candidates. Maximal degree in co-relation 3169. Up to 274 conditions per place. [2021-03-25 14:22:34,760 INFO L142 LiptonReduction]: Number of co-enabled transitions 1500 [2021-03-25 14:22:34,791 INFO L154 LiptonReduction]: Checked pairs total: 1616 [2021-03-25 14:22:34,791 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:22:34,791 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 104 [2021-03-25 14:22:34,792 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 660 flow [2021-03-25 14:22:34,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states 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 14:22:34,792 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:34,792 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:34,793 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:22:34,793 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:34,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:34,793 INFO L82 PathProgramCache]: Analyzing trace with hash -680797186, now seen corresponding path program 1 times [2021-03-25 14:22:34,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:34,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222517485] [2021-03-25 14:22:34,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:34,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:34,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:34,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:34,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:34,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:34,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:34,845 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 14:22:34,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222517485] [2021-03-25 14:22:34,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:34,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:34,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615607835] [2021-03-25 14:22:34,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:34,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:34,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:34,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:34,847 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 209 [2021-03-25 14:22:34,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 660 flow. Second operand has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states 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 14:22:34,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:34,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 209 [2021-03-25 14:22:34,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:34,938 INFO L129 PetriNetUnfolder]: 295/653 cut-off events. [2021-03-25 14:22:34,938 INFO L130 PetriNetUnfolder]: For 3067/3785 co-relation queries the response was YES. [2021-03-25 14:22:34,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3012 conditions, 653 events. 295/653 cut-off events. For 3067/3785 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3775 event pairs, 16 based on Foata normal form. 15/624 useless extension candidates. Maximal degree in co-relation 2979. Up to 234 conditions per place. [2021-03-25 14:22:34,947 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 4 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2021-03-25 14:22:34,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 558 flow [2021-03-25 14:22:34,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:22:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:22:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 751 transitions. [2021-03-25 14:22:34,949 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8983253588516746 [2021-03-25 14:22:34,949 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 751 transitions. [2021-03-25 14:22:34,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 751 transitions. [2021-03-25 14:22:34,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:34,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 751 transitions. [2021-03-25 14:22:34,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states 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 14:22:34,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states 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 14:22:34,953 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states 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 14:22:34,953 INFO L185 Difference]: Start difference. First operand has 78 places, 75 transitions, 660 flow. Second operand 4 states and 751 transitions. [2021-03-25 14:22:34,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 558 flow [2021-03-25 14:22:34,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 495 flow, removed 25 selfloop flow, removed 7 redundant places. [2021-03-25 14:22:34,964 INFO L241 Difference]: Finished difference. Result has 68 places, 64 transitions, 478 flow [2021-03-25 14:22:34,964 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=478, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2021-03-25 14:22:34,964 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2021-03-25 14:22:34,964 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:34,964 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 64 transitions, 478 flow [2021-03-25 14:22:34,964 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 64 transitions, 478 flow [2021-03-25 14:22:34,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 64 transitions, 478 flow [2021-03-25 14:22:35,019 INFO L129 PetriNetUnfolder]: 294/647 cut-off events. [2021-03-25 14:22:35,019 INFO L130 PetriNetUnfolder]: For 1751/2386 co-relation queries the response was YES. [2021-03-25 14:22:35,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2539 conditions, 647 events. 294/647 cut-off events. For 1751/2386 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3822 event pairs, 15 based on Foata normal form. 5/610 useless extension candidates. Maximal degree in co-relation 2511. Up to 193 conditions per place. [2021-03-25 14:22:35,030 INFO L142 LiptonReduction]: Number of co-enabled transitions 964 [2021-03-25 14:22:35,043 INFO L154 LiptonReduction]: Checked pairs total: 429 [2021-03-25 14:22:35,043 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:22:35,043 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 79 [2021-03-25 14:22:35,044 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 478 flow [2021-03-25 14:22:35,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states 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 14:22:35,044 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:35,044 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:35,044 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:22:35,044 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:35,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:35,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1646997150, now seen corresponding path program 2 times [2021-03-25 14:22:35,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:35,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720253743] [2021-03-25 14:22:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:35,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:35,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:35,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:35,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:35,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:35,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:35,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:35,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:35,116 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:22:35,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:22:35,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:35,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:35,126 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 14:22:35,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720253743] [2021-03-25 14:22:35,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:35,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:22:35,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028640454] [2021-03-25 14:22:35,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:22:35,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:35,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:22:35,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:22:35,129 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 209 [2021-03-25 14:22:35,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 478 flow. Second operand has 7 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states 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 14:22:35,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:35,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 209 [2021-03-25 14:22:35,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:35,255 INFO L129 PetriNetUnfolder]: 269/594 cut-off events. [2021-03-25 14:22:35,255 INFO L130 PetriNetUnfolder]: For 1790/2693 co-relation queries the response was YES. [2021-03-25 14:22:35,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2548 conditions, 594 events. 269/594 cut-off events. For 1790/2693 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3419 event pairs, 6 based on Foata normal form. 167/720 useless extension candidates. Maximal degree in co-relation 2518. Up to 169 conditions per place. [2021-03-25 14:22:35,261 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 2 selfloop transitions, 18 changer transitions 4/69 dead transitions. [2021-03-25 14:22:35,261 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 69 transitions, 574 flow [2021-03-25 14:22:35,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:22:35,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:22:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1442 transitions. [2021-03-25 14:22:35,264 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8624401913875598 [2021-03-25 14:22:35,264 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1442 transitions. [2021-03-25 14:22:35,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1442 transitions. [2021-03-25 14:22:35,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:35,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1442 transitions. [2021-03-25 14:22:35,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 180.25) internal successors, (1442), 8 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states 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 14:22:35,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states 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 14:22:35,277 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states 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 14:22:35,277 INFO L185 Difference]: Start difference. First operand has 68 places, 64 transitions, 478 flow. Second operand 8 states and 1442 transitions. [2021-03-25 14:22:35,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 69 transitions, 574 flow [2021-03-25 14:22:35,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 69 transitions, 525 flow, removed 20 selfloop flow, removed 3 redundant places. [2021-03-25 14:22:35,285 INFO L241 Difference]: Finished difference. Result has 75 places, 65 transitions, 497 flow [2021-03-25 14:22:35,286 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=497, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2021-03-25 14:22:35,286 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 15 predicate places. [2021-03-25 14:22:35,286 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:35,286 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 65 transitions, 497 flow [2021-03-25 14:22:35,286 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 65 transitions, 497 flow [2021-03-25 14:22:35,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 65 transitions, 497 flow [2021-03-25 14:22:35,367 INFO L129 PetriNetUnfolder]: 263/586 cut-off events. [2021-03-25 14:22:35,367 INFO L130 PetriNetUnfolder]: For 1661/2121 co-relation queries the response was YES. [2021-03-25 14:22:35,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2445 conditions, 586 events. 263/586 cut-off events. For 1661/2121 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3477 event pairs, 4 based on Foata normal form. 2/546 useless extension candidates. Maximal degree in co-relation 2415. Up to 168 conditions per place. [2021-03-25 14:22:35,376 INFO L142 LiptonReduction]: Number of co-enabled transitions 930 [2021-03-25 14:22:35,922 WARN L205 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 186 [2021-03-25 14:22:36,122 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2021-03-25 14:22:37,293 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 340 DAG size of output: 262 [2021-03-25 14:22:37,766 WARN L205 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-25 14:22:38,016 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 14:22:38,235 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 14:22:38,703 WARN L205 SmtUtils]: Spent 465.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 14:22:39,166 WARN L205 SmtUtils]: Spent 462.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 14:22:39,185 INFO L154 LiptonReduction]: Checked pairs total: 1340 [2021-03-25 14:22:39,185 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:22:39,185 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3899 [2021-03-25 14:22:39,186 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 481 flow [2021-03-25 14:22:39,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 177.85714285714286) internal successors, (1245), 7 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states 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 14:22:39,186 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:39,186 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:39,186 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:22:39,186 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1770976091, now seen corresponding path program 1 times [2021-03-25 14:22:39,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:39,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142890714] [2021-03-25 14:22:39,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:39,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:39,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:39,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:39,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:39,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:39,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:39,235 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 14:22:39,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142890714] [2021-03-25 14:22:39,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:39,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:39,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272166844] [2021-03-25 14:22:39,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:39,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:39,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:39,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:39,237 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 211 [2021-03-25 14:22:39,237 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 481 flow. Second operand has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:39,238 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:39,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 211 [2021-03-25 14:22:39,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:39,366 INFO L129 PetriNetUnfolder]: 520/1088 cut-off events. [2021-03-25 14:22:39,366 INFO L130 PetriNetUnfolder]: For 8969/10282 co-relation queries the response was YES. [2021-03-25 14:22:39,372 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 1088 events. 520/1088 cut-off events. For 8969/10282 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 7295 event pairs, 12 based on Foata normal form. 84/1094 useless extension candidates. Maximal degree in co-relation 4450. Up to 327 conditions per place. [2021-03-25 14:22:39,375 INFO L132 encePairwiseOnDemand]: 208/211 looper letters, 3 selfloop transitions, 1 changer transitions 1/63 dead transitions. [2021-03-25 14:22:39,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 63 transitions, 493 flow [2021-03-25 14:22:39,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:22:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:22:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 722 transitions. [2021-03-25 14:22:39,378 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8554502369668247 [2021-03-25 14:22:39,378 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 722 transitions. [2021-03-25 14:22:39,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 722 transitions. [2021-03-25 14:22:39,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:39,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 722 transitions. [2021-03-25 14:22:39,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states 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 14:22:39,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states 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 14:22:39,381 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states 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 14:22:39,381 INFO L185 Difference]: Start difference. First operand has 71 places, 62 transitions, 481 flow. Second operand 4 states and 722 transitions. [2021-03-25 14:22:39,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 63 transitions, 493 flow [2021-03-25 14:22:39,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 432 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-25 14:22:39,403 INFO L241 Difference]: Finished difference. Result has 68 places, 62 transitions, 427 flow [2021-03-25 14:22:39,403 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=427, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2021-03-25 14:22:39,403 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2021-03-25 14:22:39,403 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:39,403 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 62 transitions, 427 flow [2021-03-25 14:22:39,403 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 62 transitions, 427 flow [2021-03-25 14:22:39,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 62 transitions, 427 flow [2021-03-25 14:22:39,461 INFO L129 PetriNetUnfolder]: 323/715 cut-off events. [2021-03-25 14:22:39,461 INFO L130 PetriNetUnfolder]: For 3061/4018 co-relation queries the response was YES. [2021-03-25 14:22:39,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2564 conditions, 715 events. 323/715 cut-off events. For 3061/4018 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4576 event pairs, 0 based on Foata normal form. 44/698 useless extension candidates. Maximal degree in co-relation 2537. Up to 215 conditions per place. [2021-03-25 14:22:39,471 INFO L142 LiptonReduction]: Number of co-enabled transitions 866 [2021-03-25 14:22:39,577 INFO L154 LiptonReduction]: Checked pairs total: 463 [2021-03-25 14:22:39,577 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:22:39,578 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 175 [2021-03-25 14:22:39,578 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 428 flow [2021-03-25 14:22:39,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:39,578 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:39,578 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:39,578 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 14:22:39,579 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:39,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:39,579 INFO L82 PathProgramCache]: Analyzing trace with hash -686679012, now seen corresponding path program 1 times [2021-03-25 14:22:39,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:39,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551559418] [2021-03-25 14:22:39,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:39,657 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:22:39,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:22:39,677 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 14:22:39,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 14:22:39,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:39,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:22:39,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:39,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:22:39,740 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 14:22:39,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551559418] [2021-03-25 14:22:39,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:39,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:22:39,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235568534] [2021-03-25 14:22:39,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:22:39,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:39,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:22:39,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:22:39,744 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 213 [2021-03-25 14:22:39,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 428 flow. Second operand has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 0 states 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 14:22:39,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:39,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 213 [2021-03-25 14:22:39,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:39,980 INFO L129 PetriNetUnfolder]: 714/1426 cut-off events. [2021-03-25 14:22:39,981 INFO L130 PetriNetUnfolder]: For 9532/10917 co-relation queries the response was YES. [2021-03-25 14:22:39,988 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5701 conditions, 1426 events. 714/1426 cut-off events. For 9532/10917 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 9915 event pairs, 20 based on Foata normal form. 208/1556 useless extension candidates. Maximal degree in co-relation 5672. Up to 513 conditions per place. [2021-03-25 14:22:39,991 INFO L132 encePairwiseOnDemand]: 208/213 looper letters, 14 selfloop transitions, 3 changer transitions 56/102 dead transitions. [2021-03-25 14:22:39,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 102 transitions, 907 flow [2021-03-25 14:22:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:22:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:22:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1017 transitions. [2021-03-25 14:22:39,995 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.795774647887324 [2021-03-25 14:22:39,995 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1017 transitions. [2021-03-25 14:22:39,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1017 transitions. [2021-03-25 14:22:39,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:39,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1017 transitions. [2021-03-25 14:22:39,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states 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 14:22:40,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states 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 14:22:40,000 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states 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 14:22:40,000 INFO L185 Difference]: Start difference. First operand has 66 places, 61 transitions, 428 flow. Second operand 6 states and 1017 transitions. [2021-03-25 14:22:40,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 102 transitions, 907 flow [2021-03-25 14:22:40,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 102 transitions, 903 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:22:40,022 INFO L241 Difference]: Finished difference. Result has 71 places, 45 transitions, 295 flow [2021-03-25 14:22:40,022 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=71, PETRI_TRANSITIONS=45} [2021-03-25 14:22:40,022 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 11 predicate places. [2021-03-25 14:22:40,022 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:40,023 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 45 transitions, 295 flow [2021-03-25 14:22:40,023 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 45 transitions, 295 flow [2021-03-25 14:22:40,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 45 transitions, 295 flow [2021-03-25 14:22:40,061 INFO L129 PetriNetUnfolder]: 200/456 cut-off events. [2021-03-25 14:22:40,061 INFO L130 PetriNetUnfolder]: For 1648/1892 co-relation queries the response was YES. [2021-03-25 14:22:40,063 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1642 conditions, 456 events. 200/456 cut-off events. For 1648/1892 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2618 event pairs, 26 based on Foata normal form. 28/446 useless extension candidates. Maximal degree in co-relation 1614. Up to 141 conditions per place. [2021-03-25 14:22:40,065 INFO L142 LiptonReduction]: Number of co-enabled transitions 432 [2021-03-25 14:22:40,336 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 70 [2021-03-25 14:22:40,586 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 89 [2021-03-25 14:22:40,641 INFO L154 LiptonReduction]: Checked pairs total: 97 [2021-03-25 14:22:40,642 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:22:40,642 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 620 [2021-03-25 14:22:40,642 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 301 flow [2021-03-25 14:22:40,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 0 states 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 14:22:40,642 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:40,643 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:40,643 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 14:22:40,643 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:40,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:40,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2065533055, now seen corresponding path program 1 times [2021-03-25 14:22:40,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:40,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210320661] [2021-03-25 14:22:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:22:40,679 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:22:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:22:40,744 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:22:40,790 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:22:40,791 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:22:40,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 14:22:40,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:22:40 BasicIcfg [2021-03-25 14:22:40,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:22:40,915 INFO L168 Benchmark]: Toolchain (without parser) took 29573.86 ms. Allocated memory was 369.1 MB in the beginning and 815.8 MB in the end (delta: 446.7 MB). Free memory was 332.3 MB in the beginning and 435.5 MB in the end (delta: -103.2 MB). Peak memory consumption was 345.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:40,916 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 369.1 MB. Free memory was 350.5 MB in the beginning and 350.4 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:22:40,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 578.39 ms. Allocated memory is still 369.1 MB. Free memory was 332.1 MB in the beginning and 326.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 8.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:40,916 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.45 ms. Allocated memory is still 369.1 MB. Free memory was 326.7 MB in the beginning and 324.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 14:22:40,916 INFO L168 Benchmark]: Boogie Preprocessor took 71.88 ms. Allocated memory is still 369.1 MB. Free memory was 324.6 MB in the beginning and 321.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:40,916 INFO L168 Benchmark]: RCFGBuilder took 1982.85 ms. Allocated memory is still 369.1 MB. Free memory was 321.5 MB in the beginning and 233.0 MB in the end (delta: 88.5 MB). Peak memory consumption was 137.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:40,917 INFO L168 Benchmark]: TraceAbstraction took 26868.93 ms. Allocated memory was 369.1 MB in the beginning and 815.8 MB in the end (delta: 446.7 MB). Free memory was 231.9 MB in the beginning and 435.5 MB in the end (delta: -203.6 MB). Peak memory consumption was 242.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:40,918 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.12 ms. Allocated memory is still 369.1 MB. Free memory was 350.5 MB in the beginning and 350.4 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 578.39 ms. Allocated memory is still 369.1 MB. Free memory was 332.1 MB in the beginning and 326.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 8.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 58.45 ms. Allocated memory is still 369.1 MB. Free memory was 326.7 MB in the beginning and 324.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 71.88 ms. Allocated memory is still 369.1 MB. Free memory was 324.6 MB in the beginning and 321.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1982.85 ms. Allocated memory is still 369.1 MB. Free memory was 321.5 MB in the beginning and 233.0 MB in the end (delta: 88.5 MB). Peak memory consumption was 137.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 26868.93 ms. Allocated memory was 369.1 MB in the beginning and 815.8 MB in the end (delta: 446.7 MB). Free memory was 231.9 MB in the beginning and 435.5 MB in the end (delta: -203.6 MB). Peak memory consumption was 242.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6890.8ms, 125 PlacesBefore, 60 PlacesAfterwards, 114 TransitionsBefore, 48 TransitionsAfterwards, 2766 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 73 TotalNumberOfCompositions, 5208 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2505, positive: 2395, positive conditional: 0, positive unconditional: 2395, negative: 110, negative conditional: 0, negative unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1735, positive: 1684, positive conditional: 0, positive unconditional: 1684, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1735, positive: 1684, positive conditional: 0, positive unconditional: 1684, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1735, positive: 1667, positive conditional: 0, positive unconditional: 1667, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1025, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 972, negative conditional: 0, negative unconditional: 972, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2505, positive: 711, positive conditional: 0, positive unconditional: 711, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 1735, unknown conditional: 0, unknown unconditional: 1735] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 230, Positive conditional cache size: 0, Positive unconditional cache size: 230, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6732.7ms, 56 PlacesBefore, 43 PlacesAfterwards, 45 TransitionsBefore, 32 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 2452 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 748, positive: 633, positive conditional: 0, positive unconditional: 633, negative: 115, negative conditional: 0, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 110, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 110, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 320, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 316, negative conditional: 0, negative unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 748, positive: 538, positive conditional: 0, positive unconditional: 538, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 110, unknown conditional: 0, unknown unconditional: 110] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 206, Positive conditional cache size: 0, Positive unconditional cache size: 206, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1340.7ms, 46 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 27 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1444 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 417, positive: 338, positive conditional: 0, positive unconditional: 338, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 417, positive: 328, positive conditional: 0, positive unconditional: 328, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 181, Positive conditional cache size: 0, Positive unconditional cache size: 181, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 153.9ms, 42 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 516 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 275 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 95, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 113, negative conditional: 0, negative unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.8ms, 46 PlacesBefore, 46 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 542 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 411 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 209, positive: 192, positive conditional: 0, positive unconditional: 192, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 209, positive: 183, positive conditional: 0, positive unconditional: 183, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 207, Positive conditional cache size: 0, Positive unconditional cache size: 207, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 74.4ms, 48 PlacesBefore, 48 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 276 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 96, positive: 86, positive conditional: 0, positive unconditional: 86, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 210, Positive conditional cache size: 0, Positive unconditional cache size: 210, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 820.5ms, 51 PlacesBefore, 51 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 670 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 292, positive: 270, positive conditional: 0, positive unconditional: 270, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 292, positive: 257, positive conditional: 0, positive unconditional: 257, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 217, Positive conditional cache size: 0, Positive unconditional cache size: 217, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 86.9ms, 55 PlacesBefore, 55 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 708 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 747 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 361, positive: 337, positive conditional: 0, positive unconditional: 337, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 361, positive: 335, positive conditional: 0, positive unconditional: 335, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 96.4ms, 57 PlacesBefore, 57 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 802 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 609 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 304, positive: 285, positive conditional: 0, positive unconditional: 285, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 304, positive: 283, positive conditional: 0, positive unconditional: 283, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 221, Positive conditional cache size: 0, Positive unconditional cache size: 221, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 131.1ms, 61 PlacesBefore, 61 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 872 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 978 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 403, positive: 375, positive conditional: 0, positive unconditional: 375, 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: 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 403, positive: 371, positive conditional: 0, positive unconditional: 371, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 225, Positive conditional cache size: 0, Positive unconditional cache size: 225, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 226.5ms, 66 PlacesBefore, 66 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 513 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 168, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 168, positive: 151, positive conditional: 0, positive unconditional: 151, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 230, Positive conditional cache size: 0, Positive unconditional cache size: 230, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 164.3ms, 74 PlacesBefore, 74 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1396 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 562 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 184, positive: 171, positive conditional: 0, positive unconditional: 171, negative: 13, negative conditional: 0, negative unconditional: 13, 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 184, positive: 170, positive conditional: 0, positive unconditional: 170, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 231, Positive conditional cache size: 0, Positive unconditional cache size: 231, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 103.5ms, 78 PlacesBefore, 78 PlacesAfterwards, 78 TransitionsBefore, 75 TransitionsAfterwards, 1500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1616 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 904, positive: 872, positive conditional: 0, positive unconditional: 872, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 904, positive: 847, positive conditional: 0, positive unconditional: 847, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 237, Positive conditional cache size: 0, Positive unconditional cache size: 237, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 79.0ms, 68 PlacesBefore, 68 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 964 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 429 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 146, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 146, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 246, Positive conditional cache size: 0, Positive unconditional cache size: 246, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3898.9ms, 75 PlacesBefore, 71 PlacesAfterwards, 65 TransitionsBefore, 62 TransitionsAfterwards, 930 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1340 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 592, positive: 556, positive conditional: 0, positive unconditional: 556, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 592, positive: 547, positive conditional: 0, positive unconditional: 547, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 218, Positive conditional cache size: 0, Positive unconditional cache size: 218, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 174.3ms, 68 PlacesBefore, 66 PlacesAfterwards, 62 TransitionsBefore, 61 TransitionsAfterwards, 866 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 463 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 209, positive: 197, positive conditional: 0, positive unconditional: 197, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 209, positive: 197, positive conditional: 0, positive unconditional: 197, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 204, Positive conditional cache size: 0, Positive unconditional cache size: 204, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 618.6ms, 71 PlacesBefore, 63 PlacesAfterwards, 45 TransitionsBefore, 43 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 97 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 136, Positive conditional cache size: 0, Positive unconditional cache size: 136, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t491; [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L859] 0 pthread_t t492; [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] 4 z = 1 [L825] 4 __unbuffered_p3_EAX = z [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L831] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L866] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 26612.7ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2825.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6985.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 79 SDtfs, 41 SDslu, 36 SDs, 0 SdLazy, 476 SolverSat, 151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 567.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 416.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=686occurred in iteration=12, InterpolantAutomatonStates: 80, 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: 48.3ms SsaConstructionTime, 499.8ms SatisfiabilityAnalysisTime, 1129.8ms InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 1975 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...