/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:50:06,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:50:06,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:50:06,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:50:06,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:50:06,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:50:06,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:50:06,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:50:06,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:50:06,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:50:06,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:50:06,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:50:06,473 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:50:06,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:50:06,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:50:06,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:50:06,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:50:06,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:50:06,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:50:06,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:50:06,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:50:06,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:50:06,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:50:06,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:50:06,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:50:06,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:50:06,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:50:06,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:50:06,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:50:06,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:50:06,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:50:06,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:50:06,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:50:06,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:50:06,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:50:06,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:50:06,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:50:06,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:50:06,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:50:06,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:50:06,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:50:06,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf [2021-03-25 04:50:06,540 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:50:06,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:50:06,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:50:06,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:50:06,544 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:50:06,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:50:06,545 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:50:06,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:50:06,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:50:06,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:50:06,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:50:06,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:50:06,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:50:06,546 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:50:06,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:50:06,546 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:50:06,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:50:06,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:50:06,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:50:06,547 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:50:06,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:50:06,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:50:06,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:50:06,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:50:06,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:50:06,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:50:06,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:50:06,548 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:50:06,548 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:50:06,548 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:50:06,548 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 04:50:06,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:50:06,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:50:06,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:50:06,875 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:50:06,875 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:50:06,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2021-03-25 04:50:06,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9a707a8b/8aca979395494f94b9f1932bca4c7141/FLAGd2d87f289 [2021-03-25 04:50:07,427 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:50:07,437 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2021-03-25 04:50:07,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9a707a8b/8aca979395494f94b9f1932bca4c7141/FLAGd2d87f289 [2021-03-25 04:50:07,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9a707a8b/8aca979395494f94b9f1932bca4c7141 [2021-03-25 04:50:07,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:50:07,967 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:50:07,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:50:07,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:50:07,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:50:07,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:50:07" (1/1) ... [2021-03-25 04:50:07,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff99382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:07, skipping insertion in model container [2021-03-25 04:50:07,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:50:07" (1/1) ... [2021-03-25 04:50:07,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:50:08,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:50:08,229 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/mix055_tso.oepc.i[949,962] [2021-03-25 04:50:08,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:50:08,478 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:50:08,489 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/mix055_tso.oepc.i[949,962] [2021-03-25 04:50:08,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:50:08,637 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:50:08,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:08 WrapperNode [2021-03-25 04:50:08,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:50:08,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:50:08,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:50:08,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:50:08,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:08" (1/1) ... [2021-03-25 04:50:08,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:08" (1/1) ... [2021-03-25 04:50:08,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:50:08,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:50:08,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:50:08,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:50:08,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:08" (1/1) ... [2021-03-25 04:50:08,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:08" (1/1) ... [2021-03-25 04:50:08,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:08" (1/1) ... [2021-03-25 04:50:08,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:08" (1/1) ... [2021-03-25 04:50:08,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:08" (1/1) ... [2021-03-25 04:50:08,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:08" (1/1) ... [2021-03-25 04:50:08,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:08" (1/1) ... [2021-03-25 04:50:08,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:50:08,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:50:08,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:50:08,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:50:08,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:50:08,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:50:08,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:50:08,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:50:08,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:50:08,854 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:50:08,854 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:50:08,855 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:50:08,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:50:08,855 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:50:08,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:50:08,855 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 04:50:08,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 04:50:08,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:50:08,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:50:08,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:50:08,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:50:08,858 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:50:10,764 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:50:10,765 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:50:10,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:50:10 BoogieIcfgContainer [2021-03-25 04:50:10,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:50:10,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:50:10,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:50:10,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:50:10,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:50:07" (1/3) ... [2021-03-25 04:50:10,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2ec5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:50:10, skipping insertion in model container [2021-03-25 04:50:10,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:08" (2/3) ... [2021-03-25 04:50:10,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2ec5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:50:10, skipping insertion in model container [2021-03-25 04:50:10,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:50:10" (3/3) ... [2021-03-25 04:50:10,772 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2021-03-25 04:50:10,778 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:50:10,782 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:50:10,782 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:50:10,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,816 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,816 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,816 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,816 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,820 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,820 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,820 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,821 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,821 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,821 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,821 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,822 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,825 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,826 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,826 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,826 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,830 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,830 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,830 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,830 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,832 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,836 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,836 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,839 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,839 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,840 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,840 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,840 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,843 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,843 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:10,845 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:50:10,861 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 04:50:10,878 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:50:10,878 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:50:10,878 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:50:10,878 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:50:10,878 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:50:10,879 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:50:10,879 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:50:10,879 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:50:10,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2021-03-25 04:50:10,925 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-25 04:50:10,925 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:10,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 04:50:10,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 115 transitions, 250 flow [2021-03-25 04:50:10,933 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 111 transitions, 234 flow [2021-03-25 04:50:10,935 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:10,943 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-25 04:50:10,945 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-25 04:50:10,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 234 flow [2021-03-25 04:50:10,966 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-25 04:50:10,966 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:10,967 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 04:50:10,970 INFO L142 LiptonReduction]: Number of co-enabled transitions 2664 [2021-03-25 04:50:12,094 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:50:12,500 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:50:12,632 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 04:50:13,372 WARN L205 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-25 04:50:13,696 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 04:50:15,026 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 04:50:15,628 WARN L205 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 04:50:16,821 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 04:50:17,171 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 04:50:17,827 WARN L205 SmtUtils]: Spent 654.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:50:18,533 WARN L205 SmtUtils]: Spent 705.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:50:19,077 INFO L154 LiptonReduction]: Checked pairs total: 5269 [2021-03-25 04:50:19,077 INFO L156 LiptonReduction]: Total number of compositions: 77 [2021-03-25 04:50:19,079 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8145 [2021-03-25 04:50:19,086 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-25 04:50:19,086 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:19,086 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:19,087 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:19,087 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 04:50:19,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:19,092 INFO L82 PathProgramCache]: Analyzing trace with hash 636854298, now seen corresponding path program 1 times [2021-03-25 04:50:19,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:19,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378621877] [2021-03-25 04:50:19,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:19,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:19,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:19,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:19,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:19,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378621877] [2021-03-25 04:50:19,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:19,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:50:19,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044570837] [2021-03-25 04:50:19,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:50:19,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:19,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:50:19,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:50:19,333 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 192 [2021-03-25 04:50:19,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:19,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:19,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 192 [2021-03-25 04:50:19,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:19,515 INFO L129 PetriNetUnfolder]: 185/431 cut-off events. [2021-03-25 04:50:19,515 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:19,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 431 events. 185/431 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2461 event pairs, 123 based on Foata normal form. 20/412 useless extension candidates. Maximal degree in co-relation 708. Up to 209 conditions per place. [2021-03-25 04:50:19,523 INFO L132 encePairwiseOnDemand]: 188/192 looper letters, 11 selfloop transitions, 2 changer transitions 5/46 dead transitions. [2021-03-25 04:50:19,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 46 transitions, 134 flow [2021-03-25 04:50:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:50:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:50:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2021-03-25 04:50:19,549 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.90625 [2021-03-25 04:50:19,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2021-03-25 04:50:19,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2021-03-25 04:50:19,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:19,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2021-03-25 04:50:19,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:19,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:19,569 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:19,571 INFO L185 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 3 states and 522 transitions. [2021-03-25 04:50:19,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 46 transitions, 134 flow [2021-03-25 04:50:19,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 04:50:19,575 INFO L241 Difference]: Finished difference. Result has 51 places, 36 transitions, 84 flow [2021-03-25 04:50:19,577 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2021-03-25 04:50:19,578 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2021-03-25 04:50:19,578 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:19,578 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 36 transitions, 84 flow [2021-03-25 04:50:19,579 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 36 transitions, 84 flow [2021-03-25 04:50:19,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 36 transitions, 84 flow [2021-03-25 04:50:19,585 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-03-25 04:50:19,585 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:19,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:50:19,587 INFO L142 LiptonReduction]: Number of co-enabled transitions 448 [2021-03-25 04:50:19,958 WARN L205 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 04:50:20,324 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 04:50:21,558 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 268 DAG size of output: 267 [2021-03-25 04:50:22,180 WARN L205 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:50:22,893 INFO L154 LiptonReduction]: Checked pairs total: 2104 [2021-03-25 04:50:22,893 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-25 04:50:22,893 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3315 [2021-03-25 04:50:22,894 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-25 04:50:22,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:22,895 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:22,895 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:22,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:50:22,895 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 04:50:22,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1405212220, now seen corresponding path program 1 times [2021-03-25 04:50:22,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:22,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077358182] [2021-03-25 04:50:22,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:23,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:23,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:23,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:23,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:23,050 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:50:23,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:50:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:23,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077358182] [2021-03-25 04:50:23,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:23,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:23,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576022153] [2021-03-25 04:50:23,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:50:23,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:23,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:50:23,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:50:23,060 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 199 [2021-03-25 04:50:23,060 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:23,061 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:23,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 199 [2021-03-25 04:50:23,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:23,083 INFO L129 PetriNetUnfolder]: 3/41 cut-off events. [2021-03-25 04:50:23,083 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 04:50:23,084 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 41 events. 3/41 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 1 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 54. Up to 10 conditions per place. [2021-03-25 04:50:23,084 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 3 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-03-25 04:50:23,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 86 flow [2021-03-25 04:50:23,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:50:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:50:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2021-03-25 04:50:23,086 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.88107202680067 [2021-03-25 04:50:23,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2021-03-25 04:50:23,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2021-03-25 04:50:23,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:23,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2021-03-25 04:50:23,088 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 04:50:23,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:23,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:23,091 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 526 transitions. [2021-03-25 04:50:23,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 86 flow [2021-03-25 04:50:23,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:50:23,092 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 85 flow [2021-03-25 04:50:23,092 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2021-03-25 04:50:23,094 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -14 predicate places. [2021-03-25 04:50:23,094 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:23,094 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 85 flow [2021-03-25 04:50:23,095 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 85 flow [2021-03-25 04:50:23,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 85 flow [2021-03-25 04:50:23,100 INFO L129 PetriNetUnfolder]: 3/39 cut-off events. [2021-03-25 04:50:23,100 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 04:50:23,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 39 events. 3/39 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 82 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2021-03-25 04:50:23,101 INFO L142 LiptonReduction]: Number of co-enabled transitions 454 [2021-03-25 04:50:23,426 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 04:50:23,629 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 04:50:24,094 WARN L205 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 04:50:24,416 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 04:50:24,421 INFO L154 LiptonReduction]: Checked pairs total: 960 [2021-03-25 04:50:24,421 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:50:24,421 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1327 [2021-03-25 04:50:24,422 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 83 flow [2021-03-25 04:50:24,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:24,422 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:24,423 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:24,423 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:50:24,423 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 04:50:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:24,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1185735838, now seen corresponding path program 1 times [2021-03-25 04:50:24,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:24,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41697636] [2021-03-25 04:50:24,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:24,609 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-25 04:50:24,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 04:50:24,632 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-25 04:50:24,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 04:50:24,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:24,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:24,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41697636] [2021-03-25 04:50:24,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:24,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:24,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163735813] [2021-03-25 04:50:24,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:50:24,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:24,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:50:24,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:50:24,678 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 200 [2021-03-25 04:50:24,679 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:24,679 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:24,679 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 200 [2021-03-25 04:50:24,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:24,847 INFO L129 PetriNetUnfolder]: 327/602 cut-off events. [2021-03-25 04:50:24,847 INFO L130 PetriNetUnfolder]: For 43/72 co-relation queries the response was YES. [2021-03-25 04:50:24,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 602 events. 327/602 cut-off events. For 43/72 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3263 event pairs, 209 based on Foata normal form. 6/542 useless extension candidates. Maximal degree in co-relation 1172. Up to 432 conditions per place. [2021-03-25 04:50:24,853 INFO L132 encePairwiseOnDemand]: 192/200 looper letters, 11 selfloop transitions, 9 changer transitions 0/41 dead transitions. [2021-03-25 04:50:24,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 147 flow [2021-03-25 04:50:24,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:50:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:50:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 645 transitions. [2021-03-25 04:50:24,856 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.80625 [2021-03-25 04:50:24,856 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 645 transitions. [2021-03-25 04:50:24,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 645 transitions. [2021-03-25 04:50:24,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:24,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 645 transitions. [2021-03-25 04:50:24,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:24,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:24,860 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:24,860 INFO L185 Difference]: Start difference. First operand has 40 places, 30 transitions, 83 flow. Second operand 4 states and 645 transitions. [2021-03-25 04:50:24,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 147 flow [2021-03-25 04:50:24,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:50:24,862 INFO L241 Difference]: Finished difference. Result has 44 places, 38 transitions, 142 flow [2021-03-25 04:50:24,862 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2021-03-25 04:50:24,862 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2021-03-25 04:50:24,862 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:24,863 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 142 flow [2021-03-25 04:50:24,863 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 142 flow [2021-03-25 04:50:24,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 142 flow [2021-03-25 04:50:24,915 INFO L129 PetriNetUnfolder]: 145/341 cut-off events. [2021-03-25 04:50:24,916 INFO L130 PetriNetUnfolder]: For 120/138 co-relation queries the response was YES. [2021-03-25 04:50:24,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 341 events. 145/341 cut-off events. For 120/138 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1883 event pairs, 70 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 728. Up to 200 conditions per place. [2021-03-25 04:50:24,921 INFO L142 LiptonReduction]: Number of co-enabled transitions 618 [2021-03-25 04:50:24,938 INFO L154 LiptonReduction]: Checked pairs total: 250 [2021-03-25 04:50:24,938 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:24,938 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76 [2021-03-25 04:50:24,939 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 142 flow [2021-03-25 04:50:24,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:24,940 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:24,940 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:24,940 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:50:24,940 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 04:50:24,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:24,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1590582028, now seen corresponding path program 1 times [2021-03-25 04:50:24,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:24,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936560509] [2021-03-25 04:50:24,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:25,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:25,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:50:25,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:25,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:50:25,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:25,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:25,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:25,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936560509] [2021-03-25 04:50:25,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:25,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:25,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483278974] [2021-03-25 04:50:25,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:50:25,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:25,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:50:25,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:50:25,101 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 200 [2021-03-25 04:50:25,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:25,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:25,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 200 [2021-03-25 04:50:25,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:25,250 INFO L129 PetriNetUnfolder]: 315/587 cut-off events. [2021-03-25 04:50:25,251 INFO L130 PetriNetUnfolder]: For 355/976 co-relation queries the response was YES. [2021-03-25 04:50:25,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1663 conditions, 587 events. 315/587 cut-off events. For 355/976 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3196 event pairs, 202 based on Foata normal form. 20/545 useless extension candidates. Maximal degree in co-relation 1650. Up to 440 conditions per place. [2021-03-25 04:50:25,257 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 18 selfloop transitions, 13 changer transitions 0/52 dead transitions. [2021-03-25 04:50:25,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 268 flow [2021-03-25 04:50:25,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:50:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:50:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 656 transitions. [2021-03-25 04:50:25,260 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.82 [2021-03-25 04:50:25,260 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 656 transitions. [2021-03-25 04:50:25,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 656 transitions. [2021-03-25 04:50:25,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:25,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 656 transitions. [2021-03-25 04:50:25,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:25,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:25,264 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:25,264 INFO L185 Difference]: Start difference. First operand has 44 places, 38 transitions, 142 flow. Second operand 4 states and 656 transitions. [2021-03-25 04:50:25,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 268 flow [2021-03-25 04:50:25,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:50:25,268 INFO L241 Difference]: Finished difference. Result has 49 places, 50 transitions, 261 flow [2021-03-25 04:50:25,269 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2021-03-25 04:50:25,269 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -6 predicate places. [2021-03-25 04:50:25,269 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:25,269 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 50 transitions, 261 flow [2021-03-25 04:50:25,269 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 50 transitions, 261 flow [2021-03-25 04:50:25,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 50 transitions, 261 flow [2021-03-25 04:50:25,326 INFO L129 PetriNetUnfolder]: 181/387 cut-off events. [2021-03-25 04:50:25,327 INFO L130 PetriNetUnfolder]: For 457/533 co-relation queries the response was YES. [2021-03-25 04:50:25,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 387 events. 181/387 cut-off events. For 457/533 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2111 event pairs, 51 based on Foata normal form. 8/353 useless extension candidates. Maximal degree in co-relation 1109. Up to 221 conditions per place. [2021-03-25 04:50:25,332 INFO L142 LiptonReduction]: Number of co-enabled transitions 770 [2021-03-25 04:50:25,367 INFO L154 LiptonReduction]: Checked pairs total: 467 [2021-03-25 04:50:25,367 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:25,367 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 98 [2021-03-25 04:50:25,368 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 261 flow [2021-03-25 04:50:25,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:25,369 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:25,369 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:25,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:50:25,369 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 04:50:25,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:25,370 INFO L82 PathProgramCache]: Analyzing trace with hash 206164953, now seen corresponding path program 1 times [2021-03-25 04:50:25,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:25,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146630143] [2021-03-25 04:50:25,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:25,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:25,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:25,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:25,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:50:25,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:25,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:50:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:25,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146630143] [2021-03-25 04:50:25,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:25,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:25,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986217089] [2021-03-25 04:50:25,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:50:25,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:25,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:50:25,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:50:25,509 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 200 [2021-03-25 04:50:25,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 261 flow. Second operand has 5 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:25,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:25,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 200 [2021-03-25 04:50:25,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:25,691 INFO L129 PetriNetUnfolder]: 322/601 cut-off events. [2021-03-25 04:50:25,691 INFO L130 PetriNetUnfolder]: For 838/1948 co-relation queries the response was YES. [2021-03-25 04:50:25,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2032 conditions, 601 events. 322/601 cut-off events. For 838/1948 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3238 event pairs, 121 based on Foata normal form. 45/592 useless extension candidates. Maximal degree in co-relation 2015. Up to 353 conditions per place. [2021-03-25 04:50:25,697 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 29 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2021-03-25 04:50:25,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 389 flow [2021-03-25 04:50:25,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:50:25,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:50:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 657 transitions. [2021-03-25 04:50:25,700 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.82125 [2021-03-25 04:50:25,700 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 657 transitions. [2021-03-25 04:50:25,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 657 transitions. [2021-03-25 04:50:25,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:25,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 657 transitions. [2021-03-25 04:50:25,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.25) internal successors, (657), 4 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:25,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:25,704 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:25,705 INFO L185 Difference]: Start difference. First operand has 49 places, 50 transitions, 261 flow. Second operand 4 states and 657 transitions. [2021-03-25 04:50:25,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 389 flow [2021-03-25 04:50:25,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 389 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:50:25,711 INFO L241 Difference]: Finished difference. Result has 53 places, 54 transitions, 313 flow [2021-03-25 04:50:25,711 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=313, PETRI_PLACES=53, PETRI_TRANSITIONS=54} [2021-03-25 04:50:25,711 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2021-03-25 04:50:25,711 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:25,711 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 54 transitions, 313 flow [2021-03-25 04:50:25,712 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 54 transitions, 313 flow [2021-03-25 04:50:25,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 54 transitions, 313 flow [2021-03-25 04:50:25,782 INFO L129 PetriNetUnfolder]: 276/546 cut-off events. [2021-03-25 04:50:25,782 INFO L130 PetriNetUnfolder]: For 1086/1267 co-relation queries the response was YES. [2021-03-25 04:50:25,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1808 conditions, 546 events. 276/546 cut-off events. For 1086/1267 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3153 event pairs, 86 based on Foata normal form. 11/488 useless extension candidates. Maximal degree in co-relation 1790. Up to 310 conditions per place. [2021-03-25 04:50:25,790 INFO L142 LiptonReduction]: Number of co-enabled transitions 844 [2021-03-25 04:50:25,819 INFO L154 LiptonReduction]: Checked pairs total: 652 [2021-03-25 04:50:25,819 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:25,819 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 108 [2021-03-25 04:50:25,820 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 54 transitions, 313 flow [2021-03-25 04:50:25,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:25,820 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:25,821 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:25,821 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:50:25,821 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 04:50:25,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:25,821 INFO L82 PathProgramCache]: Analyzing trace with hash -635687942, now seen corresponding path program 1 times [2021-03-25 04:50:25,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:25,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549183847] [2021-03-25 04:50:25,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:25,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:25,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:25,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:25,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:25,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549183847] [2021-03-25 04:50:25,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:25,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:50:25,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285006895] [2021-03-25 04:50:25,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:50:25,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:25,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:50:25,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:50:25,898 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 200 [2021-03-25 04:50:25,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 54 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:25,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:25,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 200 [2021-03-25 04:50:25,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:26,008 INFO L129 PetriNetUnfolder]: 357/726 cut-off events. [2021-03-25 04:50:26,009 INFO L130 PetriNetUnfolder]: For 1969/2664 co-relation queries the response was YES. [2021-03-25 04:50:26,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2374 conditions, 726 events. 357/726 cut-off events. For 1969/2664 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4461 event pairs, 157 based on Foata normal form. 59/707 useless extension candidates. Maximal degree in co-relation 2354. Up to 441 conditions per place. [2021-03-25 04:50:26,017 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 4 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2021-03-25 04:50:26,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 327 flow [2021-03-25 04:50:26,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:50:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:50:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2021-03-25 04:50:26,019 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.895 [2021-03-25 04:50:26,019 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 537 transitions. [2021-03-25 04:50:26,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 537 transitions. [2021-03-25 04:50:26,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:26,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 537 transitions. [2021-03-25 04:50:26,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:26,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 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 04:50:26,022 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 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 04:50:26,022 INFO L185 Difference]: Start difference. First operand has 53 places, 54 transitions, 313 flow. Second operand 3 states and 537 transitions. [2021-03-25 04:50:26,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 327 flow [2021-03-25 04:50:26,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 316 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 04:50:26,028 INFO L241 Difference]: Finished difference. Result has 55 places, 54 transitions, 315 flow [2021-03-25 04:50:26,028 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=315, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2021-03-25 04:50:26,028 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2021-03-25 04:50:26,028 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:26,028 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 54 transitions, 315 flow [2021-03-25 04:50:26,028 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 54 transitions, 315 flow [2021-03-25 04:50:26,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 315 flow [2021-03-25 04:50:26,112 INFO L129 PetriNetUnfolder]: 333/690 cut-off events. [2021-03-25 04:50:26,112 INFO L130 PetriNetUnfolder]: For 1359/1731 co-relation queries the response was YES. [2021-03-25 04:50:26,115 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2188 conditions, 690 events. 333/690 cut-off events. For 1359/1731 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4390 event pairs, 95 based on Foata normal form. 10/633 useless extension candidates. Maximal degree in co-relation 2169. Up to 397 conditions per place. [2021-03-25 04:50:26,122 INFO L142 LiptonReduction]: Number of co-enabled transitions 844 [2021-03-25 04:50:26,157 INFO L154 LiptonReduction]: Checked pairs total: 585 [2021-03-25 04:50:26,157 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:26,158 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 130 [2021-03-25 04:50:26,160 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 315 flow [2021-03-25 04:50:26,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:26,160 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:26,160 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:26,160 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:50:26,160 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 04:50:26,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2035873852, now seen corresponding path program 1 times [2021-03-25 04:50:26,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:26,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716187336] [2021-03-25 04:50:26,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:26,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:26,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:50:26,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:26,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:50:26,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:26,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:50:26,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:26,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:26,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716187336] [2021-03-25 04:50:26,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:26,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:26,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800846583] [2021-03-25 04:50:26,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:50:26,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:26,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:50:26,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:50:26,281 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 200 [2021-03-25 04:50:26,281 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 315 flow. Second operand has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:26,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:26,282 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 200 [2021-03-25 04:50:26,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:26,510 INFO L129 PetriNetUnfolder]: 504/920 cut-off events. [2021-03-25 04:50:26,511 INFO L130 PetriNetUnfolder]: For 2191/3978 co-relation queries the response was YES. [2021-03-25 04:50:26,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3557 conditions, 920 events. 504/920 cut-off events. For 2191/3978 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5308 event pairs, 118 based on Foata normal form. 95/958 useless extension candidates. Maximal degree in co-relation 3536. Up to 527 conditions per place. [2021-03-25 04:50:26,519 INFO L132 encePairwiseOnDemand]: 191/200 looper letters, 27 selfloop transitions, 21 changer transitions 0/69 dead transitions. [2021-03-25 04:50:26,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 506 flow [2021-03-25 04:50:26,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:50:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:50:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2021-03-25 04:50:26,522 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8066666666666666 [2021-03-25 04:50:26,522 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 968 transitions. [2021-03-25 04:50:26,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 968 transitions. [2021-03-25 04:50:26,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:26,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 968 transitions. [2021-03-25 04:50:26,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.33333333333334) internal successors, (968), 6 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:26,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:26,527 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:26,527 INFO L185 Difference]: Start difference. First operand has 55 places, 54 transitions, 315 flow. Second operand 6 states and 968 transitions. [2021-03-25 04:50:26,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 506 flow [2021-03-25 04:50:26,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 501 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 04:50:26,532 INFO L241 Difference]: Finished difference. Result has 61 places, 64 transitions, 446 flow [2021-03-25 04:50:26,532 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2021-03-25 04:50:26,532 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2021-03-25 04:50:26,533 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:26,533 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 64 transitions, 446 flow [2021-03-25 04:50:26,533 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 64 transitions, 446 flow [2021-03-25 04:50:26,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 64 transitions, 446 flow [2021-03-25 04:50:26,676 INFO L129 PetriNetUnfolder]: 471/902 cut-off events. [2021-03-25 04:50:26,676 INFO L130 PetriNetUnfolder]: For 2650/3155 co-relation queries the response was YES. [2021-03-25 04:50:26,680 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3619 conditions, 902 events. 471/902 cut-off events. For 2650/3155 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5501 event pairs, 60 based on Foata normal form. 15/858 useless extension candidates. Maximal degree in co-relation 3597. Up to 505 conditions per place. [2021-03-25 04:50:26,690 INFO L142 LiptonReduction]: Number of co-enabled transitions 998 [2021-03-25 04:50:26,807 INFO L154 LiptonReduction]: Checked pairs total: 946 [2021-03-25 04:50:26,808 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:26,808 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 276 [2021-03-25 04:50:26,808 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 446 flow [2021-03-25 04:50:26,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:26,809 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:26,809 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:26,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:50:26,809 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 04:50:26,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:26,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1768509125, now seen corresponding path program 1 times [2021-03-25 04:50:26,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:26,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102202798] [2021-03-25 04:50:26,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:26,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:26,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 04:50:26,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:26,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 04:50:26,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:26,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:26,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:26,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:26,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102202798] [2021-03-25 04:50:26,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:26,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:50:26,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085521767] [2021-03-25 04:50:26,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:50:26,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:26,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:50:26,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:50:26,920 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 200 [2021-03-25 04:50:26,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 446 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:26,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:26,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 200 [2021-03-25 04:50:26,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:27,132 INFO L129 PetriNetUnfolder]: 510/922 cut-off events. [2021-03-25 04:50:27,133 INFO L130 PetriNetUnfolder]: For 3215/5538 co-relation queries the response was YES. [2021-03-25 04:50:27,137 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4537 conditions, 922 events. 510/922 cut-off events. For 3215/5538 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5336 event pairs, 138 based on Foata normal form. 100/962 useless extension candidates. Maximal degree in co-relation 4513. Up to 728 conditions per place. [2021-03-25 04:50:27,143 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 28 selfloop transitions, 21 changer transitions 0/70 dead transitions. [2021-03-25 04:50:27,143 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 70 transitions, 598 flow [2021-03-25 04:50:27,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:50:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:50:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 616 transitions. [2021-03-25 04:50:27,145 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.77 [2021-03-25 04:50:27,145 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 616 transitions. [2021-03-25 04:50:27,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 616 transitions. [2021-03-25 04:50:27,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:27,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 616 transitions. [2021-03-25 04:50:27,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:27,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:27,149 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:27,149 INFO L185 Difference]: Start difference. First operand has 61 places, 64 transitions, 446 flow. Second operand 4 states and 616 transitions. [2021-03-25 04:50:27,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 70 transitions, 598 flow [2021-03-25 04:50:27,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 70 transitions, 571 flow, removed 13 selfloop flow, removed 1 redundant places. [2021-03-25 04:50:27,157 INFO L241 Difference]: Finished difference. Result has 64 places, 67 transitions, 515 flow [2021-03-25 04:50:27,157 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=515, PETRI_PLACES=64, PETRI_TRANSITIONS=67} [2021-03-25 04:50:27,157 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2021-03-25 04:50:27,157 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:27,157 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 67 transitions, 515 flow [2021-03-25 04:50:27,157 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 67 transitions, 515 flow [2021-03-25 04:50:27,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 67 transitions, 515 flow [2021-03-25 04:50:27,280 INFO L129 PetriNetUnfolder]: 493/939 cut-off events. [2021-03-25 04:50:27,280 INFO L130 PetriNetUnfolder]: For 3636/4156 co-relation queries the response was YES. [2021-03-25 04:50:27,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3993 conditions, 939 events. 493/939 cut-off events. For 3636/4156 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5734 event pairs, 77 based on Foata normal form. 15/889 useless extension candidates. Maximal degree in co-relation 3969. Up to 526 conditions per place. [2021-03-25 04:50:27,296 INFO L142 LiptonReduction]: Number of co-enabled transitions 1026 [2021-03-25 04:50:27,413 INFO L154 LiptonReduction]: Checked pairs total: 1123 [2021-03-25 04:50:27,413 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:27,414 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 257 [2021-03-25 04:50:27,414 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 67 transitions, 515 flow [2021-03-25 04:50:27,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:27,414 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:27,414 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:27,415 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:50:27,415 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 04:50:27,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:27,415 INFO L82 PathProgramCache]: Analyzing trace with hash -587619474, now seen corresponding path program 1 times [2021-03-25 04:50:27,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:27,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043653959] [2021-03-25 04:50:27,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:27,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:27,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:27,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:27,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:50:27,484 INFO L142 QuantifierPusher]: treesize reduction 20, result has 79.6 percent of original size [2021-03-25 04:50:27,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-03-25 04:50:27,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:27,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:50:27,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 04:50:27,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043653959] [2021-03-25 04:50:27,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:27,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:50:27,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355548108] [2021-03-25 04:50:27,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:50:27,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:27,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:50:27,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:50:27,513 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 200 [2021-03-25 04:50:27,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 67 transitions, 515 flow. Second operand has 6 states, 6 states have (on average 156.83333333333334) internal successors, (941), 6 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:27,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:27,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 200 [2021-03-25 04:50:27,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:27,745 INFO L129 PetriNetUnfolder]: 484/874 cut-off events. [2021-03-25 04:50:27,745 INFO L130 PetriNetUnfolder]: For 3786/6086 co-relation queries the response was YES. [2021-03-25 04:50:27,748 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4503 conditions, 874 events. 484/874 cut-off events. For 3786/6086 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4928 event pairs, 102 based on Foata normal form. 105/925 useless extension candidates. Maximal degree in co-relation 4477. Up to 595 conditions per place. [2021-03-25 04:50:27,757 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 45 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2021-03-25 04:50:27,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 691 flow [2021-03-25 04:50:27,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:50:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:50:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions. [2021-03-25 04:50:27,761 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.80375 [2021-03-25 04:50:27,761 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 643 transitions. [2021-03-25 04:50:27,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions. [2021-03-25 04:50:27,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:27,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions. [2021-03-25 04:50:27,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:27,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:27,764 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:27,764 INFO L185 Difference]: Start difference. First operand has 64 places, 67 transitions, 515 flow. Second operand 4 states and 643 transitions. [2021-03-25 04:50:27,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 691 flow [2021-03-25 04:50:27,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 647 flow, removed 10 selfloop flow, removed 2 redundant places. [2021-03-25 04:50:27,772 INFO L241 Difference]: Finished difference. Result has 66 places, 67 transitions, 494 flow [2021-03-25 04:50:27,773 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=494, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2021-03-25 04:50:27,773 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 11 predicate places. [2021-03-25 04:50:27,773 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:27,773 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 67 transitions, 494 flow [2021-03-25 04:50:27,773 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 67 transitions, 494 flow [2021-03-25 04:50:27,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 67 transitions, 494 flow [2021-03-25 04:50:27,878 INFO L129 PetriNetUnfolder]: 459/880 cut-off events. [2021-03-25 04:50:27,878 INFO L130 PetriNetUnfolder]: For 2904/3322 co-relation queries the response was YES. [2021-03-25 04:50:27,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3594 conditions, 880 events. 459/880 cut-off events. For 2904/3322 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5383 event pairs, 112 based on Foata normal form. 15/842 useless extension candidates. Maximal degree in co-relation 3569. Up to 477 conditions per place. [2021-03-25 04:50:27,892 INFO L142 LiptonReduction]: Number of co-enabled transitions 1026 [2021-03-25 04:50:28,023 INFO L154 LiptonReduction]: Checked pairs total: 1157 [2021-03-25 04:50:28,023 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:28,023 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 250 [2021-03-25 04:50:28,023 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 494 flow [2021-03-25 04:50:28,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 156.83333333333334) internal successors, (941), 6 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:28,024 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:28,024 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:28,024 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:50:28,024 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 04:50:28,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2084822737, now seen corresponding path program 1 times [2021-03-25 04:50:28,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:28,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350414238] [2021-03-25 04:50:28,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:28,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:28,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:50:28,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:28,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:28,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:28,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:28,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:28,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 04:50:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:28,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350414238] [2021-03-25 04:50:28,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:28,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:50:28,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020169251] [2021-03-25 04:50:28,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:50:28,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:28,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:50:28,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:50:28,105 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 200 [2021-03-25 04:50:28,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 494 flow. Second operand has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:28,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:28,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 200 [2021-03-25 04:50:28,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:28,387 INFO L129 PetriNetUnfolder]: 549/990 cut-off events. [2021-03-25 04:50:28,388 INFO L130 PetriNetUnfolder]: For 4151/6689 co-relation queries the response was YES. [2021-03-25 04:50:28,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4920 conditions, 990 events. 549/990 cut-off events. For 4151/6689 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5664 event pairs, 80 based on Foata normal form. 181/1116 useless extension candidates. Maximal degree in co-relation 4893. Up to 586 conditions per place. [2021-03-25 04:50:28,398 INFO L132 encePairwiseOnDemand]: 191/200 looper letters, 23 selfloop transitions, 37 changer transitions 0/81 dead transitions. [2021-03-25 04:50:28,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 723 flow [2021-03-25 04:50:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:50:28,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:50:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 973 transitions. [2021-03-25 04:50:28,401 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8108333333333333 [2021-03-25 04:50:28,402 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 973 transitions. [2021-03-25 04:50:28,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 973 transitions. [2021-03-25 04:50:28,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:28,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 973 transitions. [2021-03-25 04:50:28,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 162.16666666666666) internal successors, (973), 6 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:28,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:28,407 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:28,407 INFO L185 Difference]: Start difference. First operand has 66 places, 67 transitions, 494 flow. Second operand 6 states and 973 transitions. [2021-03-25 04:50:28,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 723 flow [2021-03-25 04:50:28,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 81 transitions, 710 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:50:28,414 INFO L241 Difference]: Finished difference. Result has 71 places, 76 transitions, 673 flow [2021-03-25 04:50:28,415 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=673, PETRI_PLACES=71, PETRI_TRANSITIONS=76} [2021-03-25 04:50:28,415 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2021-03-25 04:50:28,415 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:28,415 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 76 transitions, 673 flow [2021-03-25 04:50:28,415 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 76 transitions, 673 flow [2021-03-25 04:50:28,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 76 transitions, 673 flow [2021-03-25 04:50:28,544 INFO L129 PetriNetUnfolder]: 536/1033 cut-off events. [2021-03-25 04:50:28,544 INFO L130 PetriNetUnfolder]: For 4837/5409 co-relation queries the response was YES. [2021-03-25 04:50:28,549 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4870 conditions, 1033 events. 536/1033 cut-off events. For 4837/5409 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6474 event pairs, 80 based on Foata normal form. 21/1000 useless extension candidates. Maximal degree in co-relation 4843. Up to 573 conditions per place. [2021-03-25 04:50:28,562 INFO L142 LiptonReduction]: Number of co-enabled transitions 1204 [2021-03-25 04:50:28,883 INFO L154 LiptonReduction]: Checked pairs total: 1699 [2021-03-25 04:50:28,883 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:28,883 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 468 [2021-03-25 04:50:28,883 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 76 transitions, 673 flow [2021-03-25 04:50:28,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:28,884 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:28,884 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:28,884 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:50:28,884 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 04:50:28,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:28,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1320207331, now seen corresponding path program 1 times [2021-03-25 04:50:28,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:28,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689237566] [2021-03-25 04:50:28,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:28,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:28,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:28,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:28,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:28,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:28,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:28,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689237566] [2021-03-25 04:50:28,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:28,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:28,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855281569] [2021-03-25 04:50:28,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:50:28,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:28,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:50:28,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:50:28,929 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 200 [2021-03-25 04:50:28,930 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 76 transitions, 673 flow. Second operand has 4 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 04:50:28,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:28,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 200 [2021-03-25 04:50:28,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:29,397 INFO L129 PetriNetUnfolder]: 1594/2796 cut-off events. [2021-03-25 04:50:29,397 INFO L130 PetriNetUnfolder]: For 9614/11507 co-relation queries the response was YES. [2021-03-25 04:50:29,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10594 conditions, 2796 events. 1594/2796 cut-off events. For 9614/11507 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 20261 event pairs, 529 based on Foata normal form. 480/2858 useless extension candidates. Maximal degree in co-relation 10565. Up to 1425 conditions per place. [2021-03-25 04:50:29,432 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 16 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2021-03-25 04:50:29,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 86 transitions, 701 flow [2021-03-25 04:50:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:50:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:50:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 844 transitions. [2021-03-25 04:50:29,435 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.844 [2021-03-25 04:50:29,435 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 844 transitions. [2021-03-25 04:50:29,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 844 transitions. [2021-03-25 04:50:29,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:29,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 844 transitions. [2021-03-25 04:50:29,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:29,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:29,440 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:29,440 INFO L185 Difference]: Start difference. First operand has 71 places, 76 transitions, 673 flow. Second operand 5 states and 844 transitions. [2021-03-25 04:50:29,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 86 transitions, 701 flow [2021-03-25 04:50:29,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 86 transitions, 655 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-03-25 04:50:29,452 INFO L241 Difference]: Finished difference. Result has 75 places, 81 transitions, 666 flow [2021-03-25 04:50:29,452 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=666, PETRI_PLACES=75, PETRI_TRANSITIONS=81} [2021-03-25 04:50:29,452 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 20 predicate places. [2021-03-25 04:50:29,452 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:29,453 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 81 transitions, 666 flow [2021-03-25 04:50:29,453 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 81 transitions, 666 flow [2021-03-25 04:50:29,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 81 transitions, 666 flow [2021-03-25 04:50:29,719 INFO L129 PetriNetUnfolder]: 1311/2362 cut-off events. [2021-03-25 04:50:29,719 INFO L130 PetriNetUnfolder]: For 9536/10902 co-relation queries the response was YES. [2021-03-25 04:50:29,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10154 conditions, 2362 events. 1311/2362 cut-off events. For 9536/10902 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 17040 event pairs, 399 based on Foata normal form. 91/2207 useless extension candidates. Maximal degree in co-relation 10124. Up to 1152 conditions per place. [2021-03-25 04:50:29,760 INFO L142 LiptonReduction]: Number of co-enabled transitions 1482 [2021-03-25 04:50:30,113 INFO L154 LiptonReduction]: Checked pairs total: 954 [2021-03-25 04:50:30,113 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:30,113 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 661 [2021-03-25 04:50:30,113 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 81 transitions, 666 flow [2021-03-25 04:50:30,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 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 04:50:30,114 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:30,114 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:30,114 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:50:30,114 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 04:50:30,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:30,114 INFO L82 PathProgramCache]: Analyzing trace with hash 2000222830, now seen corresponding path program 1 times [2021-03-25 04:50:30,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:30,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700870830] [2021-03-25 04:50:30,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:30,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:30,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:30,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:30,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:30,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:30,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:30,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:30,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:30,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700870830] [2021-03-25 04:50:30,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:30,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:50:30,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312506698] [2021-03-25 04:50:30,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:50:30,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:30,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:50:30,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:50:30,183 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 200 [2021-03-25 04:50:30,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 81 transitions, 666 flow. Second operand has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:30,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:30,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 200 [2021-03-25 04:50:30,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:30,506 INFO L129 PetriNetUnfolder]: 992/1952 cut-off events. [2021-03-25 04:50:30,506 INFO L130 PetriNetUnfolder]: For 9087/14396 co-relation queries the response was YES. [2021-03-25 04:50:30,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8490 conditions, 1952 events. 992/1952 cut-off events. For 9087/14396 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 14567 event pairs, 113 based on Foata normal form. 886/2623 useless extension candidates. Maximal degree in co-relation 8458. Up to 1077 conditions per place. [2021-03-25 04:50:30,536 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 17 selfloop transitions, 19 changer transitions 0/92 dead transitions. [2021-03-25 04:50:30,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 92 transitions, 784 flow [2021-03-25 04:50:30,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:50:30,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:50:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1182 transitions. [2021-03-25 04:50:30,539 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8442857142857143 [2021-03-25 04:50:30,540 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1182 transitions. [2021-03-25 04:50:30,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1182 transitions. [2021-03-25 04:50:30,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:30,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1182 transitions. [2021-03-25 04:50:30,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.85714285714286) internal successors, (1182), 7 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:30,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:30,546 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:30,546 INFO L185 Difference]: Start difference. First operand has 75 places, 81 transitions, 666 flow. Second operand 7 states and 1182 transitions. [2021-03-25 04:50:30,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 92 transitions, 784 flow [2021-03-25 04:50:30,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 92 transitions, 779 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:50:30,559 INFO L241 Difference]: Finished difference. Result has 83 places, 86 transitions, 777 flow [2021-03-25 04:50:30,559 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=777, PETRI_PLACES=83, PETRI_TRANSITIONS=86} [2021-03-25 04:50:30,559 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 28 predicate places. [2021-03-25 04:50:30,560 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:30,560 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 86 transitions, 777 flow [2021-03-25 04:50:30,560 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 86 transitions, 777 flow [2021-03-25 04:50:30,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 86 transitions, 777 flow [2021-03-25 04:50:30,734 INFO L129 PetriNetUnfolder]: 765/1598 cut-off events. [2021-03-25 04:50:30,734 INFO L130 PetriNetUnfolder]: For 9592/12196 co-relation queries the response was YES. [2021-03-25 04:50:30,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8108 conditions, 1598 events. 765/1598 cut-off events. For 9592/12196 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 12176 event pairs, 105 based on Foata normal form. 153/1636 useless extension candidates. Maximal degree in co-relation 8074. Up to 862 conditions per place. [2021-03-25 04:50:30,758 INFO L142 LiptonReduction]: Number of co-enabled transitions 1710 [2021-03-25 04:50:30,846 INFO L154 LiptonReduction]: Checked pairs total: 964 [2021-03-25 04:50:30,847 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:30,847 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 287 [2021-03-25 04:50:30,847 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 86 transitions, 777 flow [2021-03-25 04:50:30,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:30,848 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:30,848 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:30,848 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:50:30,848 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 04:50:30,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:30,848 INFO L82 PathProgramCache]: Analyzing trace with hash 184277146, now seen corresponding path program 1 times [2021-03-25 04:50:30,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:30,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465435163] [2021-03-25 04:50:30,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:30,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:30,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:30,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:30,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:30,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:30,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:30,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:30,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:30,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:30,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:30,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465435163] [2021-03-25 04:50:30,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:30,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:50:30,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317997345] [2021-03-25 04:50:30,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:50:30,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:30,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:50:30,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:50:30,911 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 200 [2021-03-25 04:50:30,912 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 86 transitions, 777 flow. Second operand has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:30,912 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:30,912 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 200 [2021-03-25 04:50:30,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:31,224 INFO L129 PetriNetUnfolder]: 759/1579 cut-off events. [2021-03-25 04:50:31,224 INFO L130 PetriNetUnfolder]: For 11105/21105 co-relation queries the response was YES. [2021-03-25 04:50:31,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8172 conditions, 1579 events. 759/1579 cut-off events. For 11105/21105 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 11868 event pairs, 20 based on Foata normal form. 1069/2450 useless extension candidates. Maximal degree in co-relation 8136. Up to 1021 conditions per place. [2021-03-25 04:50:31,240 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 11 selfloop transitions, 28 changer transitions 4/95 dead transitions. [2021-03-25 04:50:31,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 95 transitions, 910 flow [2021-03-25 04:50:31,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 04:50:31,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 04:50:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1520 transitions. [2021-03-25 04:50:31,244 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2021-03-25 04:50:31,244 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1520 transitions. [2021-03-25 04:50:31,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1520 transitions. [2021-03-25 04:50:31,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:31,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1520 transitions. [2021-03-25 04:50:31,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 168.88888888888889) internal successors, (1520), 9 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:31,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:31,251 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:31,251 INFO L185 Difference]: Start difference. First operand has 83 places, 86 transitions, 777 flow. Second operand 9 states and 1520 transitions. [2021-03-25 04:50:31,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 95 transitions, 910 flow [2021-03-25 04:50:31,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 95 transitions, 828 flow, removed 18 selfloop flow, removed 7 redundant places. [2021-03-25 04:50:31,287 INFO L241 Difference]: Finished difference. Result has 87 places, 88 transitions, 792 flow [2021-03-25 04:50:31,287 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=792, PETRI_PLACES=87, PETRI_TRANSITIONS=88} [2021-03-25 04:50:31,287 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 32 predicate places. [2021-03-25 04:50:31,287 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:31,287 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 88 transitions, 792 flow [2021-03-25 04:50:31,287 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 88 transitions, 792 flow [2021-03-25 04:50:31,288 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 88 transitions, 792 flow [2021-03-25 04:50:31,381 INFO L129 PetriNetUnfolder]: 511/1192 cut-off events. [2021-03-25 04:50:31,381 INFO L130 PetriNetUnfolder]: For 7316/8287 co-relation queries the response was YES. [2021-03-25 04:50:31,388 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5917 conditions, 1192 events. 511/1192 cut-off events. For 7316/8287 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 9385 event pairs, 27 based on Foata normal form. 73/1186 useless extension candidates. Maximal degree in co-relation 5882. Up to 487 conditions per place. [2021-03-25 04:50:31,427 INFO L142 LiptonReduction]: Number of co-enabled transitions 1806 [2021-03-25 04:50:31,462 INFO L154 LiptonReduction]: Checked pairs total: 1156 [2021-03-25 04:50:31,462 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:31,463 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 176 [2021-03-25 04:50:31,463 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 88 transitions, 792 flow [2021-03-25 04:50:31,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:31,463 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:31,463 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] [2021-03-25 04:50:31,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:50:31,464 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 04:50:31,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1267197823, now seen corresponding path program 1 times [2021-03-25 04:50:31,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:31,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35580006] [2021-03-25 04:50:31,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:31,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:31,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:31,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:31,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:31,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:31,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:31,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35580006] [2021-03-25 04:50:31,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:31,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:31,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139443932] [2021-03-25 04:50:31,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:50:31,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:31,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:50:31,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:50:31,533 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 200 [2021-03-25 04:50:31,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 88 transitions, 792 flow. Second operand has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:31,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:31,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 200 [2021-03-25 04:50:31,534 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:31,813 INFO L129 PetriNetUnfolder]: 1013/2334 cut-off events. [2021-03-25 04:50:31,813 INFO L130 PetriNetUnfolder]: For 15333/17830 co-relation queries the response was YES. [2021-03-25 04:50:31,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11574 conditions, 2334 events. 1013/2334 cut-off events. For 15333/17830 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 20543 event pairs, 38 based on Foata normal form. 159/2314 useless extension candidates. Maximal degree in co-relation 11537. Up to 967 conditions per place. [2021-03-25 04:50:31,841 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 4 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2021-03-25 04:50:31,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 824 flow [2021-03-25 04:50:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:50:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:50:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 711 transitions. [2021-03-25 04:50:31,844 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.88875 [2021-03-25 04:50:31,844 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 711 transitions. [2021-03-25 04:50:31,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 711 transitions. [2021-03-25 04:50:31,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:31,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 711 transitions. [2021-03-25 04:50:31,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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 04:50:31,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:31,848 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:31,848 INFO L185 Difference]: Start difference. First operand has 87 places, 88 transitions, 792 flow. Second operand 4 states and 711 transitions. [2021-03-25 04:50:31,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 824 flow [2021-03-25 04:50:31,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 90 transitions, 727 flow, removed 34 selfloop flow, removed 4 redundant places. [2021-03-25 04:50:31,989 INFO L241 Difference]: Finished difference. Result has 88 places, 89 transitions, 708 flow [2021-03-25 04:50:31,989 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=708, PETRI_PLACES=88, PETRI_TRANSITIONS=89} [2021-03-25 04:50:31,989 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 33 predicate places. [2021-03-25 04:50:31,989 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:31,989 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 89 transitions, 708 flow [2021-03-25 04:50:31,990 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 89 transitions, 708 flow [2021-03-25 04:50:31,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 89 transitions, 708 flow [2021-03-25 04:50:32,199 INFO L129 PetriNetUnfolder]: 1013/2334 cut-off events. [2021-03-25 04:50:32,199 INFO L130 PetriNetUnfolder]: For 9996/11250 co-relation queries the response was YES. [2021-03-25 04:50:32,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9289 conditions, 2334 events. 1013/2334 cut-off events. For 9996/11250 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 20662 event pairs, 51 based on Foata normal form. 150/2327 useless extension candidates. Maximal degree in co-relation 9252. Up to 545 conditions per place. [2021-03-25 04:50:32,245 INFO L142 LiptonReduction]: Number of co-enabled transitions 1848 [2021-03-25 04:50:32,568 INFO L154 LiptonReduction]: Checked pairs total: 517 [2021-03-25 04:50:32,568 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:32,568 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 579 [2021-03-25 04:50:32,568 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 89 transitions, 708 flow [2021-03-25 04:50:32,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:32,569 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:32,569 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] [2021-03-25 04:50:32,569 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 04:50:32,569 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 04:50:32,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:32,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1404039303, now seen corresponding path program 2 times [2021-03-25 04:50:32,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:32,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582150432] [2021-03-25 04:50:32,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:32,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:32,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:32,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:32,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:32,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:32,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:32,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:32,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:32,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:32,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:32,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:32,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:32,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582150432] [2021-03-25 04:50:32,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:32,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:50:32,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414679758] [2021-03-25 04:50:32,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:50:32,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:32,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:50:32,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:50:32,649 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 200 [2021-03-25 04:50:32,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 89 transitions, 708 flow. Second operand has 7 states, 7 states have (on average 164.85714285714286) internal successors, (1154), 7 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:32,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:32,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 200 [2021-03-25 04:50:32,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:33,165 INFO L129 PetriNetUnfolder]: 1416/2943 cut-off events. [2021-03-25 04:50:33,165 INFO L130 PetriNetUnfolder]: For 13121/19928 co-relation queries the response was YES. [2021-03-25 04:50:33,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12454 conditions, 2943 events. 1416/2943 cut-off events. For 13121/19928 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 24891 event pairs, 32 based on Foata normal form. 1453/4051 useless extension candidates. Maximal degree in co-relation 12415. Up to 640 conditions per place. [2021-03-25 04:50:33,199 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 6 selfloop transitions, 33 changer transitions 5/97 dead transitions. [2021-03-25 04:50:33,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 97 transitions, 841 flow [2021-03-25 04:50:33,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 04:50:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 04:50:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1850 transitions. [2021-03-25 04:50:33,204 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8409090909090909 [2021-03-25 04:50:33,204 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1850 transitions. [2021-03-25 04:50:33,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1850 transitions. [2021-03-25 04:50:33,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:33,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1850 transitions. [2021-03-25 04:50:33,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 168.1818181818182) internal successors, (1850), 11 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:33,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:33,213 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:33,213 INFO L185 Difference]: Start difference. First operand has 88 places, 89 transitions, 708 flow. Second operand 11 states and 1850 transitions. [2021-03-25 04:50:33,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 97 transitions, 841 flow [2021-03-25 04:50:33,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 814 flow, removed 11 selfloop flow, removed 2 redundant places. [2021-03-25 04:50:33,313 INFO L241 Difference]: Finished difference. Result has 99 places, 89 transitions, 756 flow [2021-03-25 04:50:33,314 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=756, PETRI_PLACES=99, PETRI_TRANSITIONS=89} [2021-03-25 04:50:33,314 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 44 predicate places. [2021-03-25 04:50:33,314 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:33,314 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 89 transitions, 756 flow [2021-03-25 04:50:33,314 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 89 transitions, 756 flow [2021-03-25 04:50:33,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 89 transitions, 756 flow [2021-03-25 04:50:33,485 INFO L129 PetriNetUnfolder]: 947/2203 cut-off events. [2021-03-25 04:50:33,485 INFO L130 PetriNetUnfolder]: For 8849/10329 co-relation queries the response was YES. [2021-03-25 04:50:33,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9879 conditions, 2203 events. 947/2203 cut-off events. For 8849/10329 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 19974 event pairs, 28 based on Foata normal form. 117/2158 useless extension candidates. Maximal degree in co-relation 9839. Up to 545 conditions per place. [2021-03-25 04:50:33,524 INFO L142 LiptonReduction]: Number of co-enabled transitions 1820 [2021-03-25 04:50:34,024 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 04:50:34,160 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 04:50:35,062 WARN L205 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 194 [2021-03-25 04:50:35,288 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 04:50:36,715 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 348 DAG size of output: 270 [2021-03-25 04:50:37,221 WARN L205 SmtUtils]: Spent 503.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-25 04:50:37,409 INFO L154 LiptonReduction]: Checked pairs total: 1531 [2021-03-25 04:50:37,409 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 04:50:37,409 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4095 [2021-03-25 04:50:37,410 INFO L480 AbstractCegarLoop]: Abstraction has has 96 places, 83 transitions, 716 flow [2021-03-25 04:50:37,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 164.85714285714286) internal successors, (1154), 7 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:37,410 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:37,410 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, 1] [2021-03-25 04:50:37,410 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 04:50:37,410 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 04:50:37,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:37,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1179397023, now seen corresponding path program 1 times [2021-03-25 04:50:37,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:37,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183804481] [2021-03-25 04:50:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:37,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:37,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:37,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:37,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:37,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:37,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:50:37,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183804481] [2021-03-25 04:50:37,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:37,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:37,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601908772] [2021-03-25 04:50:37,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:50:37,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:37,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:50:37,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:50:37,476 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 202 [2021-03-25 04:50:37,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 83 transitions, 716 flow. Second operand has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:37,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:37,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 202 [2021-03-25 04:50:37,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:37,694 INFO L129 PetriNetUnfolder]: 838/1722 cut-off events. [2021-03-25 04:50:37,694 INFO L130 PetriNetUnfolder]: For 19071/20421 co-relation queries the response was YES. [2021-03-25 04:50:37,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7643 conditions, 1722 events. 838/1722 cut-off events. For 19071/20421 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 12748 event pairs, 36 based on Foata normal form. 117/1708 useless extension candidates. Maximal degree in co-relation 7601. Up to 510 conditions per place. [2021-03-25 04:50:37,710 INFO L132 encePairwiseOnDemand]: 199/202 looper letters, 3 selfloop transitions, 1 changer transitions 21/72 dead transitions. [2021-03-25 04:50:37,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 72 transitions, 612 flow [2021-03-25 04:50:37,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:50:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:50:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 694 transitions. [2021-03-25 04:50:37,713 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8589108910891089 [2021-03-25 04:50:37,713 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 694 transitions. [2021-03-25 04:50:37,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 694 transitions. [2021-03-25 04:50:37,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:37,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 694 transitions. [2021-03-25 04:50:37,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.5) internal successors, (694), 4 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:37,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:37,716 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:37,716 INFO L185 Difference]: Start difference. First operand has 96 places, 83 transitions, 716 flow. Second operand 4 states and 694 transitions. [2021-03-25 04:50:37,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 72 transitions, 612 flow [2021-03-25 04:50:37,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 72 transitions, 525 flow, removed 28 selfloop flow, removed 13 redundant places. [2021-03-25 04:50:37,756 INFO L241 Difference]: Finished difference. Result has 78 places, 51 transitions, 353 flow [2021-03-25 04:50:37,756 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=353, PETRI_PLACES=78, PETRI_TRANSITIONS=51} [2021-03-25 04:50:37,756 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 23 predicate places. [2021-03-25 04:50:37,756 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:37,756 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 51 transitions, 353 flow [2021-03-25 04:50:37,757 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 51 transitions, 353 flow [2021-03-25 04:50:37,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 51 transitions, 353 flow [2021-03-25 04:50:37,814 INFO L129 PetriNetUnfolder]: 194/435 cut-off events. [2021-03-25 04:50:37,814 INFO L130 PetriNetUnfolder]: For 1439/1772 co-relation queries the response was YES. [2021-03-25 04:50:37,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1715 conditions, 435 events. 194/435 cut-off events. For 1439/1772 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2417 event pairs, 16 based on Foata normal form. 28/433 useless extension candidates. Maximal degree in co-relation 1683. Up to 151 conditions per place. [2021-03-25 04:50:37,820 INFO L142 LiptonReduction]: Number of co-enabled transitions 594 [2021-03-25 04:50:38,038 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 04:50:38,379 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 04:50:38,487 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 04:50:38,552 INFO L154 LiptonReduction]: Checked pairs total: 131 [2021-03-25 04:50:38,552 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 04:50:38,552 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 796 [2021-03-25 04:50:38,553 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 49 transitions, 361 flow [2021-03-25 04:50:38,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:38,553 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:38,553 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] [2021-03-25 04:50:38,553 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 04:50:38,553 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 04:50:38,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:38,554 INFO L82 PathProgramCache]: Analyzing trace with hash -687820226, now seen corresponding path program 1 times [2021-03-25 04:50:38,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:38,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878670359] [2021-03-25 04:50:38,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:50:38,584 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:50:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:50:38,625 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:50:38,666 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:50:38,666 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:50:38,666 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 04:50:38,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:50:38 BasicIcfg [2021-03-25 04:50:38,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:50:38,760 INFO L168 Benchmark]: Toolchain (without parser) took 30793.60 ms. Allocated memory was 341.8 MB in the beginning and 992.0 MB in the end (delta: 650.1 MB). Free memory was 304.8 MB in the beginning and 771.5 MB in the end (delta: -466.8 MB). Peak memory consumption was 183.3 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:38,761 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 341.8 MB. Free memory is still 323.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:50:38,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.01 ms. Allocated memory is still 341.8 MB. Free memory was 304.6 MB in the beginning and 299.5 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:38,761 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.93 ms. Allocated memory is still 341.8 MB. Free memory was 299.5 MB in the beginning and 296.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:38,761 INFO L168 Benchmark]: Boogie Preprocessor took 53.60 ms. Allocated memory is still 341.8 MB. Free memory was 296.3 MB in the beginning and 294.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:38,761 INFO L168 Benchmark]: RCFGBuilder took 1990.35 ms. Allocated memory was 341.8 MB in the beginning and 411.0 MB in the end (delta: 69.2 MB). Free memory was 294.2 MB in the beginning and 382.0 MB in the end (delta: -87.8 MB). Peak memory consumption was 130.6 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:38,762 INFO L168 Benchmark]: TraceAbstraction took 27992.10 ms. Allocated memory was 411.0 MB in the beginning and 992.0 MB in the end (delta: 580.9 MB). Free memory was 381.0 MB in the beginning and 771.5 MB in the end (delta: -390.6 MB). Peak memory consumption was 190.3 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:38,763 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.48 ms. Allocated memory is still 341.8 MB. Free memory is still 323.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 671.01 ms. Allocated memory is still 341.8 MB. Free memory was 304.6 MB in the beginning and 299.5 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 81.93 ms. Allocated memory is still 341.8 MB. Free memory was 299.5 MB in the beginning and 296.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 53.60 ms. Allocated memory is still 341.8 MB. Free memory was 296.3 MB in the beginning and 294.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1990.35 ms. Allocated memory was 341.8 MB in the beginning and 411.0 MB in the end (delta: 69.2 MB). Free memory was 294.2 MB in the beginning and 382.0 MB in the end (delta: -87.8 MB). Peak memory consumption was 130.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 27992.10 ms. Allocated memory was 411.0 MB in the beginning and 992.0 MB in the end (delta: 580.9 MB). Free memory was 381.0 MB in the beginning and 771.5 MB in the end (delta: -390.6 MB). Peak memory consumption was 190.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8132.2ms, 122 PlacesBefore, 55 PlacesAfterwards, 111 TransitionsBefore, 43 TransitionsAfterwards, 2664 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 5269 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2071, positive: 1948, positive conditional: 0, positive unconditional: 1948, negative: 123, negative conditional: 0, negative unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1204, positive: 1172, positive conditional: 0, positive unconditional: 1172, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1204, positive: 1172, positive conditional: 0, positive unconditional: 1172, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2071, positive: 776, positive conditional: 0, positive unconditional: 776, negative: 91, negative conditional: 0, negative unconditional: 91, unknown: 1204, unknown conditional: 0, unknown unconditional: 1204] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3313.9ms, 51 PlacesBefore, 40 PlacesAfterwards, 36 TransitionsBefore, 29 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 4 FixpointIterations, 6 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 2104 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 500, positive: 389, positive conditional: 0, positive unconditional: 389, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 38, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 500, positive: 362, positive conditional: 0, positive unconditional: 362, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 38, unknown conditional: 0, unknown unconditional: 38] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1326.3ms, 41 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 960 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 199, positive: 151, positive conditional: 0, positive unconditional: 151, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 199, positive: 151, positive conditional: 0, positive unconditional: 151, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75.0ms, 44 PlacesBefore, 44 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 250 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 57, positive: 47, positive conditional: 0, positive unconditional: 47, 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: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 57, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 98, Positive conditional cache size: 0, Positive unconditional cache size: 98, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 97.8ms, 49 PlacesBefore, 49 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 770 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 467 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 98, positive: 82, positive conditional: 0, positive unconditional: 82, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 98, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 107.6ms, 53 PlacesBefore, 53 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 844 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 652 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 133, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 133, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 128.9ms, 55 PlacesBefore, 55 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 844 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 585 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 180, positive: 162, positive conditional: 0, positive unconditional: 162, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 180, positive: 161, positive conditional: 0, positive unconditional: 161, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 274.9ms, 61 PlacesBefore, 61 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 998 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 946 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 226, positive: 201, positive conditional: 0, positive unconditional: 201, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 226, positive: 201, positive conditional: 0, positive unconditional: 201, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 256.0ms, 64 PlacesBefore, 64 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1026 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1123 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 297, positive: 268, positive conditional: 0, positive unconditional: 268, negative: 29, negative conditional: 0, negative unconditional: 29, 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: 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] , Cache Queries: [ total: 297, positive: 266, positive conditional: 0, positive unconditional: 266, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 249.8ms, 66 PlacesBefore, 66 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1026 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1157 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 264, positive: 234, positive conditional: 0, positive unconditional: 234, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 264, positive: 234, positive conditional: 0, positive unconditional: 234, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 467.7ms, 71 PlacesBefore, 71 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 1204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1699 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 391, positive: 352, positive conditional: 0, positive unconditional: 352, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 391, positive: 351, positive conditional: 0, positive unconditional: 351, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 660.1ms, 75 PlacesBefore, 75 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 1482 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 954 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 166, positive: 147, positive conditional: 0, positive unconditional: 147, 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: 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: 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] , Cache Queries: [ total: 166, positive: 144, positive conditional: 0, positive unconditional: 144, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 106, Positive conditional cache size: 0, Positive unconditional cache size: 106, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 286.8ms, 83 PlacesBefore, 83 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 1710 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 964 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 157, positive: 138, positive conditional: 0, positive unconditional: 138, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 157, positive: 137, positive conditional: 0, positive unconditional: 137, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 175.0ms, 87 PlacesBefore, 87 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 1806 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1156 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 232, positive: 210, positive conditional: 0, positive unconditional: 210, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 232, positive: 210, positive conditional: 0, positive unconditional: 210, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 578.2ms, 88 PlacesBefore, 88 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1848 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 517 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 130, positive: 120, positive conditional: 0, positive unconditional: 120, 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: 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: 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] , Cache Queries: [ total: 130, positive: 118, positive conditional: 0, positive unconditional: 118, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 109, Positive conditional cache size: 0, Positive unconditional cache size: 109, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4094.8ms, 99 PlacesBefore, 96 PlacesAfterwards, 89 TransitionsBefore, 83 TransitionsAfterwards, 1820 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 1531 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 693, positive: 666, positive conditional: 0, positive unconditional: 666, negative: 27, negative conditional: 0, negative unconditional: 27, 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: 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] , Cache Queries: [ total: 693, positive: 657, positive conditional: 0, positive unconditional: 657, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 795.4ms, 78 PlacesBefore, 73 PlacesAfterwards, 51 TransitionsBefore, 49 TransitionsAfterwards, 594 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 131 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 85, positive conditional: 0, positive unconditional: 85, 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: 12, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 87, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - 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_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff0_thd4; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$r_buff1_thd4; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1481; [L847] FCALL, FORK 0 pthread_create(&t1481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L848] 0 pthread_t t1482; [L849] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L850] 0 pthread_t t1483; [L851] FCALL, FORK 0 pthread_create(&t1483, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L852] 0 pthread_t t1484; [L853] FCALL, FORK 0 pthread_create(&t1484, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L768] 2 x$w_buff1 = x$w_buff0 [L769] 2 x$w_buff0 = 2 [L770] 2 x$w_buff1_used = x$w_buff0_used [L771] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L773] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L774] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L775] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L776] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L777] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2] [L754] 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) [L754] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L754] 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) [L754] 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) [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 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 [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L758] 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 [L784] 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) [L784] 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) [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L785] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L786] 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 [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L787] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L788] 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 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L804] 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) [L804] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L804] 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) [L804] 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) [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 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 [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L808] 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 [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L824] 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) [L824] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L824] 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) [L824] 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) [L825] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L825] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L826] 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 [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L827] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L828] 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 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] 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) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] 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) [L859] 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) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L861] 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 [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L863] 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 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 x$flush_delayed = weak$$choice2 [L869] 0 x$mem_tmp = x [L870] 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) [L870] 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) [L871] 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)) [L871] EXPR 0 !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) [L871] 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)) [L871] 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)) [L872] 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)) [L872] EXPR 0 !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) [L872] 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)) [L872] 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)) [L873] 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)) [L873] EXPR 0 !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) [L873] 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)) [L873] 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)) [L874] 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)) [L874] EXPR 0 !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) [L874] 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)) [L874] 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)) [L875] 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)) [L875] EXPR 0 !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) [L875] 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)) [L875] 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)) [L876] 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)) [L876] EXPR 0 !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) [L876] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L878] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L878] 0 x = x$flush_delayed ? x$mem_tmp : x [L879] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 27792.2ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4722.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8204.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 73 SDtfs, 49 SDslu, 25 SDs, 0 SdLazy, 500 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 619.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 412.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=792occurred in iteration=13, InterpolantAutomatonStates: 81, 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: 51.1ms SsaConstructionTime, 539.0ms SatisfiabilityAnalysisTime, 1073.4ms InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 1671 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...